Title
Minimization of maximum lateness on parallel machines with sequence-dependent setup times and job release dates
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.
Year
DOI
Venue
2011
10.1016/j.cor.2010.09.020
Computers & OR
Keywords
DocType
Volume
identical parallel machine scheduling,improved approach,benchmark problem data,Parallel machines scheduling problems,Sequence-dependent setup times,job release date,developed heuristic,computational experiment,sequence-dependent setup time,basic iterated greedy heuristic,improved iterated greedy heuristic,Iterated greedy heuristic,well-known benchmark problem data,Maximum lateness,proposed heuristic,maximum lateness,experimental result
Journal
38
Issue
ISSN
Citations 
5
Computers and Operations Research
15
PageRank 
References 
Authors
0.70
6
4
Name
Order
Citations
PageRank
Shih-Wei Lin1105946.26
Zne-Jung Lee294043.45
Kuo-Ching Ying371236.47
Chung-Cheng Lu41369.12