An improved NEH-based heuristic for the permutation flowshop problem

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

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

Page, 1961, An approach to the scheduling of jobs on machines, Journal of the Royal Statistical Society, Series B, 3, 484

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

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

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

Dannenbring, 1977, An evaluation of flowshop sequence heuristics, Management Science, 23, 1174, 10.1287/mnsc.23.11.1174

Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flowshop sequencing problem, OMEGA, 11, 91, 10.1016/0305-0483(83)90088-9

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

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

Li XP, Wang YX, Wu C. Heuristic algorithms for large flowshop scheduling problems. In: Proceedings of the 5th world congress on intelligent control and automation. Hangzhou, China; 2004. p. 2999–3003.

Kalczynski, 2007, On the NEH heuristic for minimizing the makespan in permutation flow shops, OMEGA, 35, 53, 10.1016/j.omega.2005.03.003

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

Framinan, 2002, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research, 141, 559, 10.1016/S0377-2217(01)00278-8

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

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

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

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

Nagano, 2002, A high quality solution constructive heuristic for flow shop sequencing, Journal of the Operational Research Society, 53, 1374, 10.1057/palgrave.jors.2601466

Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M