Comparing an ACO Algorithm with Other Heuristics for the Single Machine Scheduling Problem with Sequence-Dependent Setup Times Export

@article{citeulike:6056236, abstract = {We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that we describe is competitive and has a certain advantage for larger problems.}, author = {Gagne, C. and Price, W. L. and Gravel, M.}, citeulike-article-id = {6056236}, citeulike-linkout-0 = {http://dx.doi.org/10.2307/822917}, citeulike-linkout-1 = {http://www.jstor.org/stable/822917}, doi = {10.2307/822917}, issn = {01605682}, journal = {The Journal of the Operational Research Society}, keywords = {aco, scheduling}, number = {8}, pages = {895--906}, posted-at = {2009-11-02 12:47:40}, priority = {2}, publisher = {Palgrave Macmillan Journals on behalf of the Operational Research Society}, title = {Comparing an ACO Algorithm with Other Heuristics for the Single Machine Scheduling Problem with Sequence-Dependent Setup Times}, url = {http://dx.doi.org/10.2307/822917}, volume = {53}, year = {2002} }

TY - JOUR ID - citeulike:6056236 L3 - citeulike-article-id:6056236 N2 - We compare several heuristics for solving a single machine scheduling problem. In the operating situation modelled, setup times are sequence-dependent and the objective is to minimize total tardiness. We describe an Ant Colony Optimization (ACO) algorithm having a new feature using look-ahead information in the transition rule. This feature shows an improvement in performance. A comparison with a genetic algorithm, a simulated annealing approach, a local search method and a branch-and-bound algorithm indicates that the ACO that we describe is competitive and has a certain advantage for larger problems. IS - 8 JF - The Journal of the Operational Research Society SN - 01605682 EP - 906 TI - Comparing an ACO Algorithm with Other Heuristics for the Single Machine Scheduling Problem with Sequence-Dependent Setup Times PB - Palgrave Macmillan Journals on behalf of the Operational Research Society VL - 53 SP - 895 KW - aco KW - scheduling AU - Gagne, C AU - Price, WL AU - Gravel, M PY - 2002/// UR - http://dx.doi.org/10.2307/822917 ER -