Iterated Greedy methods for the distributed permutation flowshop scheduling problem

Bargaoui, 2016, Minimizing makespan in multi-factory flow shop problem using a chemical reaction metaheuristic, 2919

2010

Behnamian, 2016, A survey of multi-factory scheduling, J Intell Manuf, 27, 231, 10.1007/s10845-014-0890-y

Chan, 2013, Optimisation approaches for distributed scheduling problems, Int J Prod Res, 51, 2571, 10.1080/00207543.2012.755345

Deng, 2017, A competitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem, Swarm Evol Comput, 32, 121, 10.1016/j.swevo.2016.06.002

Fernandez-Viagas, 2015, A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problem, Int J Prod Res, 53, 1111, 10.1080/00207543.2014.948578

Fernandez-Viagas, 2017, A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation, Eur J Oper Res, 257, 707, 10.1016/j.ejor.2016.09.055

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, 2014

Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, Int J Comput Intell Syst, 4, 497

Gao, 2011, An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems, Sci Res Essays, 6, 3094

Gao, 2013, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, Int J Prod Res, 51, 641, 10.1080/00207543.2011.644819

Gao, 2012, Solving multi-factory flowshop problems with a novel variable neighbourhood descent algorithm, J Comput Inf Syst, 8, 2025

Gao, 2012, A knowledge-based genetic algorithm for permutation flowshop scheduling problems with multiple factories, Int J Adv Comput Technol, 4, 121

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

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

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

Hatami, 2013, The distributed assembly permutation flowshop scheduling problem, Int J Prod Res, 51, 5292, 10.1080/00207543.2013.807955

Hatami, 2015, Heuristics and metaheuristics for the distributed assembly permutation flowshop scheduling problem with sequence dependent setup times, Int J Prod Econ, 169, 76, 10.1016/j.ijpe.2015.07.027

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

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

Kendall, 2016, Good laboratory practice for optimization research, J Oper Res Soc, 67, 676, 10.1057/jors.2015.77

Lin, 2013, Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, Int J Prod Res, 51, 5029, 10.1080/00207543.2013.790571

Liu, 2010, A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem, 156

MacCarthy, 1993, Addressing the gap in scheduling research: a review of optimization and heuristic methods in production scheduling, Int J Prod Res, 31, 59, 10.1080/00207549308956713

McKay, 2002, Practice-focused research issues for scheduling systems, Prod Oper Manage, 11, 249, 10.1111/j.1937-5956.2002.tb00494.x

McKay, 1988, Job-shop scheduling theory: what is relevant?, Interfaces, 18, 84, 10.1287/inte.18.4.84

Mladenović, 1997, Variable neighborhood search, Comput Oper Res, 24, 1097, 10.1016/S0305-0548(97)00031-2

Montgomery, 2012

Naderi, 2010, The distributed permutation flowshop scheduling problem, Comput Oper Res, 37, 754, 10.1016/j.cor.2009.06.019

Naderi, 2014, A scatter search algorithm for the distributed permutation flowshop scheduling problem, Eur J Oper Res, 239, 323, 10.1016/j.ejor.2014.05.024

Nawaz, 1983, A Heuristic Algorithm for the m-Machine, n-Job Flow-shop Sequencing Problem, OMEGA Int J Manage Sci, 11, 91, 10.1016/0305-0483(83)90088-9

Pan, 2014, An effective iterated greedy algorithm for the mixed no-idle permutation flowshop scheduling problem, OMEGA Int J Manage Sci, 44, 41, 10.1016/j.omega.2013.10.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

Pinedo, 2016

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

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

Ribas, 2017, Efficient heuristics for the parallel blocking flow shop scheduling problem, Expert Syst Appl, 74, 41, 10.1016/j.eswa.2017.01.006

Rifai, 2016, Multi-objective adaptive large neighborhood search for distributed reentrant permutation flow shop scheduling, Appl Soft Comput J, 40, 42, 10.1016/j.asoc.2015.11.034

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

Sörensen, 2015, Metaheuristics-the metaphor exposed, Int Trans Oper Res, 22, 3, 10.1111/itor.12001

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

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

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

Wang, 2016, A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem, 2240

Wang, 2016, A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown, J Oper Res Soc, 67, 62, 10.1057/jors.2015.50

Wang, 2016, Survey on optimization algorithms for distributed shop scheduling, Control Decis, 31, 1

Wang, 2013, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, Int J Prod Econ, 145, 387, 10.1016/j.ijpe.2013.05.004

Xu, 2014, An effective hybrid immune algorithm for solving the distributed permutation flow-shop scheduling problem, Eng Optim, 46, 1269, 10.1080/0305215X.2013.827673