A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

Adler, 1993, BPSS: a scheduling support system for the packaging industry, Oper. Res., 41, 641, 10.1287/opre.41.4.641

Alfieri, 2009, Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study, Int. J. Prod. Res., 47, 5129, 10.1080/00207540802010823

Botta-Genoulaz, 2000, Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness, Int. J. Prod. Econ., 64, 101, 10.1016/S0925-5273(99)00048-1

Chamnanlor, 2015, Embedding ant system in genetic algorithm for re-entrant hybrid flow shop scheduling problems with time window constraints, J. Intell. Manuf., 1

Chen, 2009, Bottleneck-based heuristics to minimize total tardiness for the flexible flow line with unrelated parallel machines, Comput. Ind. Eng., 56, 1393, 10.1016/j.cie.2008.08.016

Chen, 2007, A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal, Eur. J. Oper. Res., 181, 40, 10.1016/j.ejor.2006.06.033

Choi, 2005, Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop, Int. J. Prod. Res., 43, 2149, 10.1080/00207540500050071

Cui, 2015, An improved discrete artificial bee colony algorithm to minimize the makespan on hybrid flow shop problems, Neurocomputing, 148, 248, 10.1016/j.neucom.2013.07.056

Engin, 2011, An efficient genetic algorithm for hybrid flow shop scheduling with multiprocessor task problems, Appl. Soft Comput., 11, 3056, 10.1016/j.asoc.2010.12.006

Fanjul-Peyro, 2010, Iterated greedy local search methods for unrelated parallel machine scheduling, Eur. J. Oper. Res., 207, 55, 10.1016/j.ejor.2010.03.030

Goldberg, 1985, Alleles, Loci, and the Traveling Salesman Problem, Vol. 154, 154

Gupta, 1988, Two-stage, hybrid flowshop scheduling problem, J. Oper. Res. Soc., 39, 359, 10.1057/jors.1988.63

Holland, 1992

Holm, 1979, A simple sequentially rejective multiple test procedure, Scand. J. Stat., 65

Hunsucker, 1992, Performance of priority rules in a due date flow shop, Omega, 20, 73, 10.1016/0305-0483(92)90057-E

Jungwattanakit, 2009, A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria, Comput. Oper. Res., 36, 358, 10.1016/j.cor.2007.10.004

Kurz, 2004, Scheduling flexible flow lines with sequence-dependent setup times, Eur. J. Oper. Res., 159, 66, 10.1016/S0377-2217(03)00401-6

Lee, 2004, Bottleneck-focused scheduling for a hybrid flowshop, Int. J. Prod. Res., 42, 165, 10.1080/00207540310001602892

Li, 2015, A heuristic-search genetic algorithm for multi-stage hybrid flow shop scheduling with single processing machines and batch processing machines, J. Intell. Manuf., 26, 873, 10.1007/s10845-014-0874-y

Li, 2016, An improved artificial bee colony algorithm for solving hybrid flexible flowshop with dynamic operation skipping, IEEE Trans. Cybern., 46, 1311, 10.1109/TCYB.2015.2444383

Liao, 2012, An approach using particle swarm optimization and bottleneck heuristic to solve hybrid flow shop scheduling problem, Appl. Soft Comput., 12, 1755, 10.1016/j.asoc.2012.01.011

Marichelvam, 2014, A discrete firefly algorithm for the multi-objective hybrid flowshop scheduling problems, IEEE Trans. Evol. Comput., 18, 301, 10.1109/TEVC.2013.2240304

Marichelvam, 2014, Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan, Appl. Soft Comput., 19, 93, 10.1016/j.asoc.2014.02.005

Michalewicz, 1996, Genetic algorithms + data structures = evolution programs, Math. Intell., 18, 71

Naderi, 2009, An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness, Expert Syst. Appl., 36, 9625, 10.1016/j.eswa.2008.09.063

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

Oĝuz, 2005, A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks, J. Sched., 8, 323, 10.1007/s10951-005-1640-y

Pan, 2012, An estimation of distribution algorithm for lot-streaming flow shop problems with setup times, Omega, 40, 166, 10.1016/j.omega.2011.05.002

Pan, 2017, Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows, Comput. Oper. Res., 80, 50, 10.1016/j.cor.2016.11.022

Pargar, 2012, Bi-criteria SDST hybrid flow shop scheduling with learning effect of setup times: water flow-like algorithm approach, Int. J. Prod. Res., 50, 2609, 10.1080/00207543.2010.546380

Paul, 1979, A production scheduling problem in the glass-container industry, Oper. Res., 27, 290, 10.1287/opre.27.2.290

Pinedo, 2012

Rashidi, 2010, An improved hybrid multi-objective parallel genetic algorithm for hybrid flow shop scheduling with unrelated parallel machines, Int. J. Adv. Manuf. Technol., 49, 1129, 10.1007/s00170-009-2475-z

Ribas, 2010, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Comput. Oper. Res., 37, 1439, 10.1016/j.cor.2009.11.001

Ruiz, 2006, A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility, Eur. J. Oper. Res., 169, 781, 10.1016/j.ejor.2004.06.038

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

Ruiz, 2010, The hybrid flow shop scheduling problem, Eur. J. Oper. Res., 205, 1, 10.1016/j.ejor.2009.09.024

Semeraro, 1983, Heuristic scheduling in a flow shop type manufacturing cell, Manuf. Syst., 12, 197

Şen, 2015, A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines, INFORMS J. Comput., 27, 135, 10.1287/ijoc.2014.0615

Tavakkoli-Moghaddam, 2009, A memetic algorithm for the flexible flow line scheduling problem with processor blocking, Comput. Oper. Res., 36, 402, 10.1016/j.cor.2007.10.011

Urlings, 2010, Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems, Int. J. Metaheuristics, 1, 30, 10.1504/IJMHEUR.2010.033122

Urlings, 2010, Shifting representation search for hybrid flexible flowline problems, Eur. J. Oper. Res., 207, 1086, 10.1016/j.ejor.2010.05.041

Vignier, 1999, Les problèmes d’ordonnancement de type flow-shop hybride: état de l’art, RAIRO-Oper. Res., 33, 117, 10.1051/ro:1999108

Voß, 2007, Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements: a real-world application, Int. J. Prod. Econ., 105, 445, 10.1016/j.ijpe.2004.05.029

Wang, 2009, A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers, Comput. Oper. Res., 36, 907, 10.1016/j.cor.2007.11.004

Wolpert, 1997, No free lunch theorems for optimization, IEEE Trans. Evol. Comput., 1, 67, 10.1109/4235.585893

Xiao, 2000, Hybrid flow shop scheduling using genetic algorithms. intelligent control and automation, 2000, 1, 537

Yaurima, 2009, Hybrid flowshop with unrelated machines, sequence-dependent setup time, availability constraints and limited buffers, Comput. Ind. Eng., 56, 1452, 10.1016/j.cie.2008.09.004

Ying, 2006, Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach, Int. J. Prod. Res., 44, 3161, 10.1080/00207540500536939

Zandieh, 2006, An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times, Appl. Math. Comput., 180, 111