Article ID: | iaor20108560 |
Volume: | 38 |
Issue: | 5 |
Start Page Number: | 809 |
End Page Number: | 815 |
Publication Date: | May 2011 |
Journal: | Computers and Operations Research |
Authors: | Lin Shih-Wei, Ying Kuo-Ching, Lee Zne-Jung, Lu Chung-Cheng |
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.