Handling ties in heuristics for the permutation flow shop scheduling problem

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, 2005, Comparison of heuristics for flowtime minimization in permutation flowshops, Comp Oper Res, 32, 1237, 10.1016/j.cor.2003.11.002

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

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

Pinedo, 2010

Rinnooy Kan, 1976

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

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

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

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

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

Agarval, 2006, Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach, Eur J Oper Res, 169, 801, 10.1016/j.ejor.2004.06.039

Ekskioglu, 2008, A tabu search algorithm for the flowshop scheduling problem with changing neighbourhoods, Comp Ind Eng, 54, 1, 10.1016/j.cie.2007.04.004

Grabowski, 2004, A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Comp Oper Res, 31, 1891, 10.1016/S0305-0548(03)00145-X

Haq, 2007, A scatter search approach for general flow shop scheduling problem, Int J Adv Manuf Technol, 31, 751

Jarboui, 2008, A combinatorial particle swarm optimisation for solving permutation flowshop problems, Comp Ind Eng, 54, 526, 10.1016/j.cie.2007.09.006

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

Laha, 2007, Improved heuristically guided genetic algorithm for the flow shop scheduling problem, Int J Serv Oper Manag, 3, 313

Liao, 2007, A discrete version of particle swarm optimization for flowshop scheduling problems, Comp Oper Res, 34, 3099, 10.1016/j.cor.2005.11.017

Liu, 2007, An effective PSO-based memetic algorithm for flow shop scheduling, IEEE Trans Syst Man Cybern B: Cybern, 37, 18, 10.1109/TSMCB.2006.883272

Nowicki, 1996, A fast tabu search algorithm for the permutation flowshop problem, Eur J Oper Res, 91, 160, 10.1016/0377-2217(95)00037-2

Onwubolu, 2006, Scheduling flow shops using differential evolution algorithm, Eur J Oper Res, 171, 674, 10.1016/j.ejor.2004.08.043

Pan, 2007, A discrete differential evolution algorithm for the permutation flowshop scheduling problem

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

Tasgetiren, 2007, A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem, Eur J Oper Res, 177, 1930, 10.1016/j.ejor.2005.12.024

Dong, 2006, A more effective constructive algorithm for permutation flowshop problem. Intelligent data engineering and automated learning – IDEAL 2006, Lect Notes Comp Sci, 4224, 25, 10.1007/11875581_3

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

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

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

Framinan, 2003, Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idle time or flowtime in the static permutation flowshop sequencing problem, Int J Prod Res, 41, 121, 10.1080/00207540210161650

Taillard, 2004

Watson, 2002, Contrasting structured and random permutation flowshop scheduling problems: search space topology and algorithm performance, ORSA J Comput, 14, 98, 10.1287/ijoc.14.2.98.120

Jin, 2007, An improved version of the NEH algorithm and its application to large-scale flow-shop scheduling problems, IIE Trans, 39, 229, 10.1080/07408170600735553

Hansen, 2001, Variable neighbourhood search: principles and applications, Eur J Oper Res, 130, 449, 10.1016/S0377-2217(00)00100-4

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