A scatter search algorithm for the distributed permutation flowshop scheduling problem

2012 2009 Chan, 2013, Optimisation approaches for distributed scheduling problems, International Journal of Production Research, 51, 2571, 10.1080/00207543.2012.755345 Emmons, 2012 Framinan, 2004, A review and classification of heuristics for permutation flow-shop scheduling with makespan objective, Journal of the Operational Research Society, 55, 1243, 10.1057/palgrave.jors.2601784 Gao, J., & Chen, R. (2011c). An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems. Technical Report SRE-10-1014. College of Information Science and Technology, Dalian Maritime University, Dalian, Liaoling Province, 116026, China. Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, International Journal of Computational Intelligence Systems, 4, 497, 10.1080/18756891.2011.9727808 Gao, 2011, An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems, Scientific Research and Essays, 6, 3094 Gao, 2013, An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem, International Journal of Production Research, 51, 641, 10.1080/00207543.2011.644819 Gao, 2012, Solving multi-factory flowshop problems with a novel variable neighbourhood descent algorithm, Journal of Computational Information Systems, 8, 2025 Gao, 2012, A knowledge-based genetic algorithm for permutation flowshop scheduling problems with multiple factories, International Journal of Advancements in Computing Technology, 4, 121, 10.4156/ijact.vol4.issue7.13 Garey, 1976, The complexity of flowshop and jobshop scheduling, Mathematics of Operations Research, 1, 117, 10.1287/moor.1.2.117 Glover, 1977, Heuristics for integer programming using surrogate constraints, Decision Sciences, 8, 156, 10.1111/j.1540-5915.1977.tb01074.x Glover, 1998, A template for scatter search and path relinking, vol. 1363, 13 Glover, 2000, Fundamentals of scatter search and path relinking, Control and Cybernetics, 29, 652 Graham, 1979, Optimization and approximation in deterministic sequencing and scheduling: A survey, Annals of Discrete Mathematics, 5, 287, 10.1016/S0167-5060(08)70356-X Gupta, 2006, Flowshop scheduling research after five decades, European Journal of Operational Research, 169, 699, 10.1016/j.ejor.2005.02.001 Hejazi, 2005, Flowshop-scheduling problems with makespan criterion: A review, International Journal of Production Research, 43, 2895, 10.1080/0020754050056417 Johnson, 1954, Optimal two- and three-stage production schedules with setup times included, Naval Research Logistics Quarterly, 1, 61, 10.1002/nav.3800010110 2004 Laguna, 2003 Linn, 1999, Hybrid flow shop scheduling: A survey, Computers & Industrial Engineering, 37, 57, 10.1016/S0360-8352(99)00023-6 Lin, 2013, Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm, International Journal of Production Research, 51, 5029, 10.1080/00207543.2013.790571 Liu, 2010, A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem, 156 Martí, 2006, Principles of scatter search, European Journal of Operational Research, 169, 359, 10.1016/j.ejor.2004.08.004 McKay, 2002, Practice-focused research issues for scheduling systems, Production and Operations Management, 11, 249, 10.1111/j.1937-5956.2002.tb00494.x Mladenović, 1997, Variable neighborhood search, Computers & Operations Research, 24, 1097, 10.1016/S0305-0548(97)00031-2 Montgomery, 2012 Moon, 2002, Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain, Computers & Industrial Engineering, 43, 331, 10.1016/S0360-8352(02)00078-5 Naderi, 2010, The distributed permutation flowshop scheduling problem, Computers & Operations Research, 37, 754, 10.1016/j.cor.2009.06.019 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem, OMEGA, The International Journal of Management Science, 11, 91, 10.1016/0305-0483(83)90088-9 Nowicki, 2006, Some aspects of scatter search in the flow-shop problem, European Journal of Operational Research, 169, 654, 10.1016/j.ejor.2004.08.021 Pinedo, 2012 Pochet, 2006 Quadt, 2007, A taxonomy of flexible flow line scheduling procedures, European Journal of Operational Research, 178, 686, 10.1016/j.ejor.2006.01.042 Reisman, 1997, Flowshop scheduling/sequencing research: A statistical review of the literature, 1952–1994, IEEE Transactions on Engineering Management, 44, 316, 10.1109/17.618173 Ribas, 2010, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Computers & Operations Research, 37, 1439, 10.1016/j.cor.2009.11.001 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 Ruiz, 2006, Two new robust genetic algorithms for the flowshop scheduling problem, OMEGA, The International Journal of Management Science, 34, 461, 10.1016/j.omega.2004.12.006 Ruiz, 2007, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Journal of Operational Research, 177, 2033, 10.1016/j.ejor.2005.12.009 Ruiz, 2010, The hybrid flow shop scheduling problem, European Journal of Operational Research, 205, 1, 10.1016/j.ejor.2009.09.024 Saravanan, 2008, International journal of advanced manufacturing technology, International Journal of Advanced Manufacturing Technology, 37, 1200, 10.1007/s00170-007-1053-5 Sarin, 2007 Taillard, 1990, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research, 47, 67, 10.1016/0377-2217(90)90090-X Taillard, 1993, Benchmarks for basic scheduling problems, European Journal of Operational Research, 64, 278, 10.1016/0377-2217(93)90182-M Vallada, 2009, Cooperative metaheuristics for the permutation flowshop scheduling problem, European Journal of Operational Research, 193, 365, 10.1016/j.ejor.2007.11.049 Vallada, 2010, Genetic algorithms with path relinking for the minimum tardiness permutation flowshop problem, OMEGA, The International Journal of Management Science, 38, 57, 10.1016/j.omega.2009.04.002 Vignier, 1999, Les problèmes d’ordonnancement de type flow-shop hybride: État de l’art, RAIRO Recherche opérationnelle, 33, 117 1997 Wang, 2005, Flexible flow shop scheduling: optimum, heuristics and artificial intelligence solutions, Expert Systems, 22, 78, 10.1111/j.1468-0394.2005.00297.x Wang, 2013, An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem, International Journal of Production Economics, 145, 387, 10.1016/j.ijpe.2013.05.004