Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474728 | Computers & Operations Research | 2011 | 7 Pages |
Abstract
In this paper, we consider an identical parallel machine scheduling problem with sequence-dependent setup times and job release dates. An improved iterated greedy heuristic with a sinking temperature is presented to minimize the maximum lateness. To verify the developed heuristic, computational experiments are conducted on a well-known benchmark problem data set. The experimental results show that the proposed heuristic outperforms the basic iterated greedy heuristic and the state-of-art algorithms on the same benchmark problem data set. It is believed that this improved approach will also be helpful for other applications.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Shih-Wei Lin, Zne-Jung Lee, Kuo-Ching Ying, Chung-Cheng Lu,