Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 31, Issue 5, Pages 791-801Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(03)00038-8
Keywords
scheduling; permutation flow-shop; ant colony system; meta-heuristic
Ask authors/readers for more resources
Ant colony system (ACS) is a novel meta-heuristic inspired by the foraging behavior of real ant. This paper is the first to apply ACS for the n/m/P/C-max problem, an NP-hard sequencing problem which is used to find a processing order of n different jobs to be processed on m machines in the same sequence with minimizing the makespan. To verify the developed ACS algorithm, computational experiments are conducted on the well-known benchmark problem set of Taillard. The ACS algorithm is compared with other mata-heuristics such as genetic algorithm, simulated annealing, and neighborhood search from the literature. Computational results demonstrate that ACS is a more effective mata-heuristic for the n/m/P/C-max problem. (C) 2003 Elsevier Ltd. All rights reserved.
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