An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem

Alaghebandha, 2019, Economic lot sizing and scheduling in distributed permutation flow shops, J. Optimiz. Ind. Eng., 12, 103 Bektaş, 2020, Benders decomposition for the mixed no-idle permutation flowshop scheduling problem, J. Sched., 10.1007/s10951-020-00637-8 Benders, 1962, Partitioning procedures for solving mixed-variables programming problems, Numer. Math., 4, 238, 10.1007/BF01386316 Cao, 2003, Parallel flowshop scheduling using tabu search, Int. J. Prod. Res., 41, 3059, 10.1080/0020754031000106443 Chan, 2010, Comparative Study of Adaptability and Flexibility in Distributed Manufacturing Supply Chains, Decis. Support Syst., 48, 331, 10.1016/j.dss.2009.09.001 Chan, 2005, An adaptive genetic algorithm with dominated genes for distributed scheduling problems, Expert Syst. Appl., 29, 364, 10.1016/j.eswa.2005.04.009 Chung, 2009, A modified genetic algorithm approach for scheduling of perfect maintenance in distributed production scheduling, Eng Appl Artif Intel, 22, 1005, 10.1016/j.engappai.2008.11.004 Cordeau, 2006, An integrated model for logistics network design, Ann. Oper. Res., 144, 59, 10.1007/s10479-006-0001-3 Costa, 2012, Accelerating Benders decomposition with heuristic master problem solutions, Pesquisa Operacional, 32, 3, 10.1590/S0101-74382012005000005 Croce, 2000, Minimizing tardy jobs in a flowshop with common due date, Eur. J. Oper. Res., 120, 375, 10.1016/S0377-2217(99)00164-2 David, 1996, A scheduling problem in glass manufacturing, IIE Trans. (Inst. Ind. Eng.), 28, 129 Della Croce, 2000, Minimizing tardy jobs in a flowshop with common due date, Eur. J. Oper. Res., 120, 375, 10.1016/S0377-2217(99)00164-2 Dong, 2017, An FPTAS for the parallel two-machine flowshop problem, Theoret. Comput. Sci., 657, 64, 10.1016/j.tcs.2016.04.046 Dong, 2017, Corrigendum to “An FPTAS for the parallel two-stage flowshop problem. Theoretical computer science, 657: 64–72 (2017)”, Theor. Comput. Sci., 687, 93, 10.1016/j.tcs.2017.05.016 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 Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, Int J Comput Intell Syst, 4, 497, 10.1080/18756891.2011.9727808 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 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, 1971, M-stage scheduling problem: A critical appraisal, Int. J. Prod. Res., 9, 267, 10.1080/00207547108929878 Hariri, 1989, A branch and bound algorithm to minimize number of late jobs in a permutation flow-shop, Eur. J. Oper. Res., 38, 228, 10.1016/0377-2217(89)90108-2 Jia, 2007, Integration of Genetic Algorithm and Gantt Chart for Job Shop Scheduling in Distributed Manufacturing Systems, Comput. Ind. Eng., 53, 313, 10.1016/j.cie.2007.06.024 Jia, 2003, A Modified Genetic Algorithm for Distributed Scheduling Problems, J. Intell. Manuf., 14, 351, 10.1023/A:1024653810491 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, H., Gao, L., 2010. A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem. In: Proceedings - 6th international conference on manufacturing automation, ICMA 2010; Hong Kong; China. IEEE Computer Society; pp. 156–63. Lodree, 2004, A new rule for minimizing the number of tardy jobs in dynamic flow shops, Eur. J. Oper. Res., 159, 258, 10.1016/S0377-2217(03)00404-1 Magnanti, 1981, Accelerating benders decomposition: Algorithmic enhancement and model selection criteria, Oper. Res., 29, 464, 10.1287/opre.29.3.464 Mokhtar, 2019, The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems, Comput. Oper. Res., 104, 375, 10.1016/j.cor.2018.09.006 Moon, 2002, Integrated Process Planning and Scheduling with Minimizing Total Tardiness in Multi-plants Supply Chain, Comput. Ind. Eng., 43, 331, 10.1016/S0360-8352(02)00078-5 Moore, 1968, An n job, one machine sequencing algorithm for minimizing the number of late jobs, Manage. Sci., 15, 102, 10.1287/mnsc.15.1.102 Moreno, 2020, Decomposition-based algorithms for the crew scheduling and routing problem in road restoration, Comput. Oper. Res., 119, 10.1016/j.cor.2020.104935 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 Papadakos, 2008, Practical enhancements to the Magnanti-Wong method, Oper. Res. Lett., 36, 444, 10.1016/j.orl.2008.01.005 Rahmaniani, 2017, The Benders decomposition algorithm: A literature review, Eur. J. Oper. Res., 259, 801, 10.1016/j.ejor.2016.12.005 Ribas, 2017, Efficient heuristics for the parallel blocking flow shop scheduling problem, Expert Syst. Appl., 74, 41, 10.1016/j.eswa.2017.01.006 Ruiz, 2019, Iterated Greedy methods for the distributed permutation flowshop scheduling problem, OMEGA Int. J. Manage. Sci., 83, 213, 10.1016/j.omega.2018.03.004 Ruiz-Torres, 2008, Minimizing the Number of Late Jobs for the Permutation Flowshop Problem with Secondary Resources, Comput. Oper. Res., 35, 1227, 10.1016/j.cor.2006.07.013 Saharidis, 2013, Speed-up Benders decomposition using maximum density cut (MDC) generation, Ann. Oper. Res., 210, 101, 10.1007/s10479-012-1237-8 Sung, 2003, Minimizing due date related performance measures on two batch processing machines, Eur. J. Oper. Res., 147, 644, 10.1016/S0377-2217(02)00352-1 Taşkın, 2013, Combinatorial Benders cuts for decomposing IMRT fluence maps using rectangular apertures, Comput. Oper. Res., 40, 2178, 10.1016/j.cor.2011.07.005 Vairaktarakis, 2000, The use of flowlines to simplify routing complexity in two-stage flowshops, IIE Trans. (Inst. Ind. Eng.), 32, 687 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 Zhang, 2012, Approximation algorithms for the parallel flow shop problem, Eur. J. Oper. Res., 216, 544, 10.1016/j.ejor.2011.08.007