A comprehensive review and evaluation of permutation flowshop heuristics

Ashour, 1970, An experimental investigation and comparative evaluation of flow-shop scheduling techniques, Operations Research, 18, 541, 10.1287/opre.18.3.541

Baker, 1974

Ben-Daya, 1998, A tabu search approach for the flow shop scheduling problem, European Journal of Operational Research, 109, 88, 10.1016/S0377-2217(97)00136-7

Bonney, 1976, Solutions to the constrained flowshop sequencing problem, Operational Research Quarterly, 27, 869, 10.1057/jors.1976.176

Byung Park, 1984, A survey and evaluation of static flowshop scheduling heuristics, International Journal of Production Research, 22, 127, 10.1080/00207548408942436

Campbell, 1970, A heuristic algorithm for the n job, m machine sequencing problem, Management Science, 16, B630, 10.1287/mnsc.16.10.B630

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

Conway, 1967

Dannenbring, 1977, An evaluation of flow shop sequencing heuristics, Management Science, 23, 1174, 10.1287/mnsc.23.11.1174

Davoud Pour, 2001, A new heuristic for the n-job, m-machine flow-shop problem, Production Planning and Control, 12, 648, 10.1080/09537280152582995

Dudek, 1992, The lessons of flowshop scheduling research, Operations Research, 40, 7, 10.1287/opre.40.1.7

Dudek, 1964, Development of m-stage decision rule for scheduling n jobs through m machines, Operations Research, 12, 471, 10.1287/opre.12.3.471

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

Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X

Gupta, 1971, A functional heuristic algorithm for the flowshop scheduling problem, Operational Research Quarterly, 22, 39, 10.1057/jors.1971.18

Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823

Ho, 1991, A new heuristic for the n-job, m-machine flow-shop problem, European Journal of Operational Research, 52, 194, 10.1016/0377-2217(91)90080-F

Hundal, 1988, An extension of Palmer's heuristic for the flow shop scheduling problem, International Journal of Production Research, 26, 1119, 10.1080/00207548808947922

Ishibuchi, 1995, Modified simulated annealing algorithms for the flow shop sequencing problem, European Journal of Operational Research, 81, 388, 10.1016/0377-2217(93)E0235-P

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110

King, 1980, Heuristics for flow-shop scheduling, International Journal of Production Research, 18, 345, 10.1080/00207548008919673

Koulamas, 1998, A new constructive heuristic for the flowshop scheduling problem, European Journal of Operational Research Society, 105, 66, 10.1016/S0377-2217(97)00027-1

Moccellin, 1995, A new heuristic method for the permutation flow shop scheduling problem, Journal of the Operational Research Society, 46, 883, 10.1057/jors.1995.119

Moccellin, 2000, An adaptive hybrid meta-heuristic 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

Ogbu, 1990, The application of the simulated annealing algorithms to the solution of the n/m/Cmax flowshop problem, Computers and Operations Research, 17, 243, 10.1016/0305-0548(90)90001-N

Ogbu, 1990, Simulated annealing for the permutation flowshop problem, OMEGA, The International Journal of Management Science, 19, 64, 10.1016/0305-0483(91)90036-S

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

Page, 1961, An approach to the scheduling of jobs on machines, Journal of the Royal Statistical Society, B Series, 23, 484, 10.1111/j.2517-6161.1961.tb00432.x

Palmer, 1965, Sequencing jobs through a multi-stage process in the minimum total time––a quick method of obtaining a near optimum, Operational Research Quarterly, 16, 101, 10.1057/jors.1965.8

Pinedo, 2002

Ponnambalam, 2001, Constructive and improvement flow shop scheduling heuristics: An extensive evaluation, Production Planning and Control, 12, 335, 10.1080/09537280152004950

Potts, 1991, Permutation vs. non-permutation flow shop schedules, Operations Research Letters, 10, 281, 10.1016/0167-6377(91)90014-G

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

Reeves, 1998, Genetic algorithms, path relinking, and the flowshop sequencing problem, Evolutionary Computation, 6, 45, 10.1162/evco.1998.6.1.45

Reisman, 1994, Flowshop scheduling/sequencing research: A statistical review of the literature, 1952–1994, IEEE Transactions on Engineering Management, 44, 316, 10.1109/17.618173

Sarin, 1993, Scheduling heuristic for the n-job m-machine flow shop, OMEGA, The International Journal of Management Science, 21, 229, 10.1016/0305-0483(93)90055-P

Stinson, 1982, A heuristic programming procedure for sequencing the static flowshop, International Journal of Production Research, 20, 753, 10.1080/00207548208947802

Stützle, T., 1998. Applying iterated local search to the permutation flow shop problem. Technical Report, AIDA-98-04, FG Intellektik,TU Darmstadt

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

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

Zegordi, 1995, Minimizing makespan for flowshop scheduling by combining simulated annealing with sequencing knowledge, European Journal of Operational Research, 85, 515, 10.1016/0377-2217(94)00021-4