On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem

Dong, 2013, A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time, Comput Oper Res, 40, 627, 10.1016/j.cor.2012.08.021

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

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

Framinan, 2003, An efficient constructive heuristic for flowtime minimisation in permutation flowshops, OMEGA, Int J Manag Sci, 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

Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: a survey, Ann Discrete Math, 5, 287, 10.1016/S0167-5060(08)70356-X

Hamed Hendizadeh, 2008, Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times, Int J Prod Econ, 111, 593, 10.1016/j.ijpe.2007.02.031

Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Res Logist Q, 1, 61, 10.1002/nav.3800010110

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

Kalczynski, 2008, An improved NEH heuristic to minimize makespan in permutation flow shops, Comput Oper Res, 35, 3001, 10.1016/j.cor.2007.01.020

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

Kalczynski, 2011, On recent modifications and extensions of the NEH heuristic for flow shop sequencing, Found Comput Decis Sci, 36, 17

Krajewski, 1987, Kanban, MRP, and shaping the manufacturing environment, Manag Sci, 33, 39, 10.1287/mnsc.33.1.39

Nagano, 2002, A high quality solution constructive heuristic for flow shop sequencing, J Oper Res Soc, 53, 1374, 10.1057/palgrave.jors.2601466

Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, Int J Manag Sci, 11, 91, 10.1016/0305-0483(83)90088-9

Pan, 2008, A discrete differential evolution algorithm for the permutation flowshop scheduling problem, Comput Ind Eng, 55, 795, 10.1016/j.cie.2008.03.003

Rad, 2009, New high performing heuristics for minimizing makespan in permutation flowshops, OMEGA, Int J Manag Sci, 37, 331, 10.1016/j.omega.2007.02.002

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

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

Ribas, 2010, Comparing three-step heuristics for the permutation flow shop problem, Comput Oper Res, 37, 2062, 10.1016/j.cor.2010.02.006

Rinnooy Kan, 1976

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

Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, Eur J Oper Res, 177, 2033, 10.1016/j.ejor.2005.12.009

Storer, 1992, New search spaces for sequencing problems with application to job shop scheduling, Manag Sci, 38, 1495, 10.1287/mnsc.38.10.1495

Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, Eur J Oper Res, 47, 65, 10.1016/0377-2217(90)90090-X

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

Tan, 2000, A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times, OMEGA, Int J Manag Sci, 28, 313, 10.1016/S0305-0483(99)00050-X

Tzeng, 2012, A hybrid EDA with ACS for solving permutation flow shop scheduling, Int J Adv Manuf Technol, 60, 1139, 10.1007/s00170-011-3671-1

Vakharia, 1990, Designing a cellular manufacturing system: a materials flow approach based on operation sequences, IIE Trans, 22, 84, 10.1080/07408179008964161

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