A comprehensive review and evaluation of permutation flowshop heuristics Export

@article{citeulike:4978640, abstract = {In this work we present a review and comparative evaluation of heuristics and metaheuristics for the well-known permutation flowshop problem with the makespan criterion. A number of reviews and evaluations have already been proposed. However, the evaluations do not include the latest heuristics available and there is still no comparison of metaheuristics. Furthermore, since no common benchmarks and computing platforms are used, the results cannot be generalised. We propose a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques. For the evaluation we use the standard test of Taillard [Eur. J. Operation. Res. 64 (1993) 278] composed of 120 instances of different sizes. In the evaluations we use the experimental design approach to obtain valid conclusions on the effectiveness and efficiency of the different methods tested.}, author = {Ruiz, R. and Maroto, C.}, citeulike-article-id = {4978640}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.ejor.2004.04.017}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0377221704002553}, day = {01}, doi = {10.1016/j.ejor.2004.04.017}, issn = {03772217}, journal = {European Journal of Operational Research}, keywords = {heuristics, phd, review, scheduling}, month = {September}, number = {2}, pages = {479--494}, posted-at = {2009-06-26 16:15:57}, priority = {2}, title = {A comprehensive review and evaluation of permutation flowshop heuristics}, url = {http://dx.doi.org/10.1016/j.ejor.2004.04.017}, volume = {165}, year = {2005} }

TY - JOUR ID - citeulike:4978640 L3 - citeulike-article-id:4978640 N2 - In this work we present a review and comparative evaluation of heuristics and metaheuristics for the well-known permutation flowshop problem with the makespan criterion. A number of reviews and evaluations have already been proposed. However, the evaluations do not include the latest heuristics available and there is still no comparison of metaheuristics. Furthermore, since no common benchmarks and computing platforms are used, the results cannot be generalised. We propose a comparison of 25 methods, ranging from the classical Johnson's algorithm or dispatching rules to the most recent metaheuristics, including tabu search, simulated annealing, genetic algorithms, iterated local search and hybrid techniques. For the evaluation we use the standard test of Taillard [Eur. J. Operation. Res. 64 (1993) 278] composed of 120 instances of different sizes. In the evaluations we use the experimental design approach to obtain valid conclusions on the effectiveness and efficiency of the different methods tested. IS - 2 JF - European Journal of Operational Research SN - 03772217 EP - 494 TI - A comprehensive review and evaluation of permutation flowshop heuristics VL - 165 SP - 479 KW - heuristics KW - phd KW - review KW - scheduling AU - Ruiz, R AU - Maroto, C PY - 2005/09/01/ UR - http://dx.doi.org/10.1016/j.ejor.2004.04.017 ER -