Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 142, Issue 2, Pages 250-257Publisher
ELSEVIER
DOI: 10.1016/S0377-2217(02)00265-5
Keywords
scheduling; multiple objective programming; Ant Colony Optimization
Ask authors/readers for more resources
Consider the 2-machine flowshop scheduling problem with the objective of minimizing both the total completion time and the makespan criteria. The latter is assumed to be optimized prior to the former. In view of the N P-hardness of the problem an Ant Colony Optimization approach is proposed to solve it. The heuristic also uses feature of Simulated Annealing search and local search algorithms. Computational experiments show its effectiveness compared to existing heuristics. The extension to the total completion time problem is also studied. (C) 2002 Published by Elsevier Science B.V.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available