A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem

Aldowaisan, 2003, New heuristics for no-wait flowshops to minimize makespan, Computers and Operations Research, 30, 1219, 10.1016/S0305-0548(02)00068-0 Beasley, J.E., 2004. Available from: OR-Library. <http://mscmga.ms.ic.ac.uk/info.html>. Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 16, B630, 10.1287/mnsc.16.10.B630 Chandrasekharan, 2004, Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research, 155, 426, 10.1016/S0377-2217(02)00908-6 Chen, 1995, An application of genetic algorithms for flow shop problems, European Journal of Operational Research, 80, 389, 10.1016/0377-2217(93)E0228-P Dannenbring, 1977, An evaluation of flow shop sequencing heuristics, Management Science, 23, 1174, 10.1287/mnsc.23.11.1174 Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem, International Journal of Production Research, 41, 121, 10.1080/00207540210161650 Grabowski, 2004, A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion, Computers and Operations Research, 31, 1891, 10.1016/S0305-0548(03)00145-X Jacobs, 1995, A local search heuristic for large set-covering problems, Naval Research Logistics Quarterly, 42, 1129, 10.1002/1520-6750(199510)42:7<1129::AID-NAV3220420711>3.0.CO;2-M Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 Lourenço, 2002, Iterated local search, 321 Marchiori, 2000, An evolutionary algorithm for large set covering problems with applications to airline crew scheduling, vol. 1803, 367 Moccellin, 2000, An adaptive hybrid metaheuristic for permutation flowshop scheduling, Control and Cybernetics, 29, 761 Montgomery, 2000 Murata, 1996, Genetic algorithms for flowshop scheduling problems, Computers and Industrial Engineering, 30, 1061, 10.1016/0360-8352(96)00053-8 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, The International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9 Nowicki, 1996, A fast tabu search algorithm for the permutation flow-shop problem, European Journal of Operational Research, 91, 160, 10.1016/0377-2217(95)00037-2 Osman, 1989, Simulated annealing for permutation flow-shop scheduling, OMEGA, The International Journal of Management Science, 17, 551, 10.1016/0305-0483(89)90059-5 Pinedo, 2002 Reeves, 1998, Genetic algorithms, path relinking, and the flowshop sequencing problem, Evolutionary Computation, 6, 45, 10.1162/evco.1998.6.1.45 Reeves, 1993, Improving the efficiency of tabu search for machine scheduling problems, Journal of the Operational Research Society, 44, 375, 10.1057/jors.1993.67 Reeves, 1995, A genetic algorithm for flowshop sequencing, Computers and Operations Research, 22, 5, 10.1016/0305-0548(93)E0014-K Rinnooy Kan, 1976 Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, European Journal of Operational Research, 165, 479, 10.1016/j.ejor.2004.04.017 Ruiz, 2006, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, European Journal of Operational Research, 169, 781, 10.1016/j.ejor.2004.06.038 Ruiz, 2005, Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics, European Journal of Operational Research, 165, 34, 10.1016/j.ejor.2004.01.022 Ruiz, 2006, Two new robust genetic algorithms for the flowshop scheduling problem, OMEGA, the International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006 Stützle, T., 1998. Applying iterated local search to the permutation flow shop problem. Technical report, AIDA-98-04, FG Intellektik, FB Informatik, TU Darmstadt. Stützle, 1998, An ant approach to the flow shop problem, vol. 3, 1560 Suliman, 2000, A two-phase heuristic approach to the permutation flow-shop scheduling problem, International Journal of Production Economics, 64, 143, 10.1016/S0925-5273(99)00053-5 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 67, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Taillard, E., 2004. Summary of best known lower and upper bounds of Taillard’s instances. Available from: <http://ina.eivd.ch/collaborateurs/etd/problemes.dir/ordonnancement.dir/ordonnancement.html>. Turner, 1987, Comparison of heuristics for flow shop sequencing, OMEGA, The International Journal of Management Science, 15, 75, 10.1016/0305-0483(87)90054-5 Wang, 2003, An effective hybrid heuristic for flow shop scheduling, The International Journal of Advanced Manufacturing Technology, 21, 38, 10.1007/s001700300005 Werner, 1993, On the heuristic solution of the permutation flow shop problem by path algorithms, Computers and Operations Research, 20, 707, 10.1016/0305-0548(93)90058-Q Widmer, 1989, A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research, 41, 186, 10.1016/0377-2217(89)90383-4 Wodecki, 2002, Solving the flow shop problem by parallel simulated annealing, vol. 2328, 236