Comparison of heuristics for flowtime minimisation in permutation flowshops

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 Graham, 1979, Optimisation and approximation in deterministic sequencing and scheduling, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, European Journal of Operational Research, 103, 129, 10.1016/S0377-2217(96)00273-1 Liu, 2001, Constructive and composite heuristic solutions to the P||∑ Ci scheduling problem, European Journal of Operational Research, 132, 439, 10.1016/S0377-2217(00)00137-5 Pinedo, 1995 Vempati, 1993, An effective heuristic for flow-shop problems with total flow time as criterion, Computers and Industrial Engineering, 25, 219, 10.1016/0360-8352(93)90260-5 Gupta, 2000, Designing a tabu search algorithm to minimize total flow time in a flow shop, The Arabian Journal for Science and Engineering, 25, 79 Tang, 2002, A modified genetic algorithm for the flow shop sequencing problem to minimize mean flow time, Journal of Intelligent Manufacturing, 13, 61, 10.1023/A:1013681029869 Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Computers and Operations Research, 25, 175, 10.1016/S0305-0548(97)00050-6 Allahverdi, 2002, New heuristics to minimize total completion time in m-machine flowshops, International Journal of Production Economics, 7, 71, 10.1016/S0925-5273(01)00228-6 Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop, International Journal of Production Research, 41, 121, 10.1080/00207540210161650 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, 11, 91, 10.1016/0305-0483(83)90088-9 Framinan, 2003, An efficient heuristic for flowtime minimisation in permutation flowshops, OMEGA, 31, 311, 10.1016/S0305-0483(03)00047-1 Gupta, 1972, Heuristic algorithms for multistage flowshop scheduling problem, AIIE Transactions, 4, 11, 10.1080/05695557208974823 Miyazaki, 1978, An adjacent pairwise approach to the mean flowtime scheduling problem, Journal of the Operations Research Society of Japan, 21, 287, 10.15807/jorsj.21.287 Rajendran, 1991, An efficient heuristic approach to the scheduling of jobs in a flowshop, European Journal of Operational Research, 61, 318, 10.1016/0377-2217(92)90361-C Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimise total flowtime, International Journal of Production Economics, 29, 65, 10.1016/0925-5273(93)90024-F Ho, 1995, Flowshop sequencing with mean flowtime objective, European Journal of Operational Research, 81, 571, 10.1016/0377-2217(93)E0353-Y Wang, 1997, Heuristic approaches for n|m|F|∑ Ci scheduling problems, European Journal of Operational Research, 96, 636, 10.1016/0377-2217(95)00347-9 Framinan, 2002, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research, 141, 561, 10.1016/S0377-2217(01)00278-8 Framinan JM, Leisten R, Gupta JND. A review and classification heuristics for permutation flow shop scheduling with makespan objective. Technical Report 2001/02, Industrial Management, University of Seville; 2001. Taillard, 1990, Some efficient heuristic methods for the flow-shop sequencing problem, European Journal of Operational Research, 47, 65, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmark for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Beasley, 1990, OR-Library, Journal of the Operational Research Society, 41, 1069, 10.2307/2582903 Campbell, 1970, A heuristic algorithm for the n-job, m-machine sequencing problem, Management Science, 16, B630, 10.1287/mnsc.16.10.B630 Dannenbring, 1977, An evaluation of flow-shop sequence heuristics, Management Science, 23, 1174, 10.1287/mnsc.23.11.1174 Bamberg, 1998 Kenkel, 1996