New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem

Allahverdi, 2002, New heuristics to minimize total completion time in m-machine flowshops, Int J Prod Econ, 77, 71, 10.1016/S0925-5273(01)00228-6

Dong, 2008, An improved NEH-based heuristic for the permutation flowshop problem, Comput Oper Res, 35, 3962, 10.1016/j.cor.2007.05.005

Fernandez-Viagas, 2014, On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem, Comput Oper Res, 45, 60, 10.1016/j.cor.2013.12.012

Fernandez-Viagas, 2015, A new set of high-performing heuristics to minimize flowtime in permutation flowshops, Comput Oper Res, 53, 68, 10.1016/j.cor.2014.08.004

Framinan, 2003, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, Omega, 31, 311, 10.1016/S0305-0483(03)00047-1

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, Int J Prod Res, 41, 121, 10.1080/00207540210161650

Framinan, 2002, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, Eur J Oper Res, 141, 559, 10.1016/S0377-2217(01)00278-8

Framinan, 2005, Comparison of heuristics for flowtime minimisation in permutation flowshops, Comput Oper Res, 32, 1237, 10.1016/j.cor.2003.11.002

Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, J Oper Res Soc, 55, 1243, 10.1057/palgrave.jors.2601784

Garey, 1976, The complexity of flowshop and jobshop scheduling, Math Oper Res, 1, 117, 10.1287/moor.1.2.117

Gupta, 1971, A functional heuristic algorithm for the flowshop scheduling problem, Oper Res Q, 22, 39, 10.1057/jors.1971.18

Gupta, 2006, Performance guarantees for flowshop heuristics to minimize makespan, Eur J Oper Res, 169, 865, 10.1016/j.ejor.2004.05.034

Gupta, 2006, Flowshop scheduling research after five decades, Eur J Oper Res, 169, 699, 10.1016/j.ejor.2005.02.001

Jarboui, 2009, An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems, Comput Oper Res, 36, 2638, 10.1016/j.cor.2008.11.004

Kalczynski, 2009, An empirical analysis of the optimality rate of flow shop heuristics, Eur J Oper Res, 198, 93, 10.1016/j.ejor.2008.08.021

Laha, 2009, A heuristic to minimize total flow time in permutation flow shop, Omega, 37, 734, 10.1016/j.omega.2008.05.002

Mutlu, 2014, Multi-objective permutation flow shop scheduling problem: literature review, classification and current trends, Omega, 45, 119, 10.1016/j.omega.2013.07.004

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

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

Pan, 2012, Local search methods for the flowshop scheduling problem with flowtime minimization, Eur J Oper Res, 222, 31, 10.1016/j.ejor.2012.04.034

Pan, 2013, A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime, Comput Oper Res, 40, 117, 10.1016/j.cor.2012.05.018

Rajendran, 1993, Heuristic algorithm for scheduling in a flowshop to minimize total flowtime, Int J Prod Econ, 29, 65, 10.1016/0925-5273(93)90024-F

Rajendran, 1997, An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs, Eur J Oper Res, 103, 129, 10.1016/S0377-2217(96)00273-1

Reisman, 1997, Flowshop scheduling/sequencing research: a statistical review of the literature, 1952–1994, IEEE Trans Eng Manag, 44, 316, 10.1109/17.618173

Reza Hejazi, 2005, Flowshop-scheduling problems with makespan criterion: a review, Int J Prod Res, 43, 2895, 10.1080/0020754050056417

Ruiz, 2005, A comprehensive review and evaluation of permutation flowshop heuristics, Eur J Oper Res, 165, 479, 10.1016/j.ejor.2004.04.017

Semančo, 2012, A comparison of constructive heuristics with the objective of minimizing makespan in the flow-shop scheduling problem, Acta Polytech Hung, 9, 177

Taillard, 1993, Benchmarks for basic scheduling problems, Eur J Oper Res, 64, 278, 10.1016/0377-2217(93)90182-M

Vasiljevic, 2015, Handling ties in heuristics for the permutation flow shop scheduling problem, J Manuf Syst, 35, 1, 10.1016/j.jmsy.2014.11.011

Woo, 1998, A heuristic algorithm for mean flowtime objective in flowshop scheduling, Com. Oper. Res., 25, 175, 10.1016/S0305-0548(97)00050-6