Real-World Applications of Evolutionary Computing, EvoWorkshops 2000: EvoIASP, EvoSCONDI, EvoTel, EvoSTIM, EvoROB, and EvoFlight
Expert Systems with Applications: An International Journal
NP-complete scheduling problems
Journal of Computer and System Sciences
A GRASP approach to transporter scheduling and routing at a shipyard
Computers and Industrial Engineering
An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
Computers and Operations Research
Hi-index | 0.01 |
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.