標題: Minimizing weighted earliness and tardiness penalties in single-machine scheduling with idle time permitted
作者: Chen, JY
Lin, SF
電控工程研究所
Institute of Electrical and Control Engineering
關鍵字: scheduling theory;branch-and-bound;earliness/tardiness;idle time;dominance rule
公開日期: 1-Dec-2002
摘要: In this paper, a single-machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch-and-bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. (C) 2002 Wiley Periodicals, Inc.
URI: http://dx.doi.org/10.1002/nav.10039
http://hdl.handle.net/11536/28366
ISSN: 0894-069X
DOI: 10.1002/nav.10039
期刊: NAVAL RESEARCH LOGISTICS
Volume: 49
Issue: 8
起始頁: 760
結束頁: 780
Appears in Collections:Articles


Files in This Item:

  1. 000179521800003.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.