Production scheduling for blocking flowshop in distributed environment using effective heuristics and iterated greedy algorithm

Ruiz, 2019, Iterated Greedy methods for the distributed permutation flowshop scheduling problem, Omega (Westport), 83, 213 Wang, 2019, Production planning for cloud-based additive manufacturing - A computer vision-based approach, Robot. Comput. Integr. Manuf., 58, 145, 10.1016/j.rcim.2019.03.003 Zhang, 2021, A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers[J], Robot. Comput. Integr. Manuf., 68, 10.1016/j.rcim.2020.102081 Wang, 2003, An effective hybrid heuristic for flow shop scheduling, Int. J. Adv. Manuf. Technol., 21, 38, 10.1007/s001700300005 Suhami, 1981, An implicit enumeration scheme for the flowshop problem with no intermediate storage, Comput. Chem. Eng., 5, 83, 10.1016/0098-1354(81)87003-2 Luo, 2009, Two-stage hybrid batching flowshop scheduling with blocking and machine availability constraints using genetic algorithm, Robot. Comput. Integr. Manuf., 25, 962, 10.1016/j.rcim.2009.06.001 Behnamian, 2016, A survey of multi-factory scheduling, J. Intell. Manuf., 27, 10.1007/s10845-014-0890-y Kahn, 2004 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 N, 2012, Dynamic scheduling for multi-site companies: a decisional approach based on reinforcement multi-agent learning, J. Intell. Manuf., 23, 2513, 10.1007/s10845-011-0580-y Naderi, 2010, The distributed permutation flowshop scheduling problem, Comput. Oper. Res., 37, 754, 10.1016/j.cor.2009.06.019 Pinedo, 2008 Hall, 1996, A survey of machine scheduling problems with blocking and no-wait in process, Oper. Res., 44, 510, 10.1287/opre.44.3.510 Framinan, 2014 Nawaz, 1983, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, Omega (Westport), 11, 91 Rauf, 2020, A smart algorithm for multi-criteria optimization of model sequencing problem in assembly lines[J], Robot. Comput. Integr. Manuf., 61 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 Zhang, 2021, A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers, Robot. Comput. Integr. Manuf., 68, 10.1016/j.rcim.2020.102081 Liu, 2010, A discrete electromagnetism-like mechanism algorithm for solving distributed permutation flowshop scheduling problem, 156 Gao, 2011, A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem, Int. J. Comput. Intell. Syst., 4, 497 Gao, 2012, A knowledge-based genetic algorithm for permutation flowshop scheduling problems with multiple factories, Int. J. Adv. Comput. Technol., 4, 121 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 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 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 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 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 Wang, 2016, A hybrid discrete cuckoo search for distributed permutation flowshop scheduling problem, 2240 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 Bargaoui, 2017, A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion, Comput. Ind. Eng., 111, 239, 10.1016/j.cie.2017.07.020 Fernandez-Viagas, 2018, The distributed permutation flow shop to minimise the total flowtime, Comput. Ind. Eng., 118, 464, 10.1016/j.cie.2018.03.014 Pan, 2019, Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem, Expert Syst. Appl., 124, 309, 10.1016/j.eswa.2019.01.062 Shao, 2017, A hybrid iterated greedy algorithm for the distributed no-wait flow shop scheduling problem, 9 Komaki, 2017, General variable neighborhood search algorithm to minimize makespan of the distributed no-wait flow shop scheduling problem, Prod. Eng., 11, 1, 10.1007/s11740-017-0716-9 Huang, 2021, Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times, Eng. Appl. Artif. Intell., 97, 10.1016/j.engappai.2020.104016 Ying, 2017, Iterated reference greedy algorithm for solving distributed no-idle permutation flowshop scheduling problems, Comput. Ind. Eng., 110, 413, 10.1016/j.cie.2017.06.025 Huang, 2021, An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem, Comput. Ind. Eng., 152, 10.1016/j.cie.2020.107021 Meng, 2021, A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time, Swarm. Evol. Comput., 60 Pan, 2020, An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems, IEEE Trans. Cybern. Companys, 2015, Efficient constructive procedures for the distributed blocking flow shop scheduling problem, 92 Ying, 2017, Minimizing makespan in distributed blocking flowshops using hybrid iterated greedy algorithms, IEEE Access, 5, 15694, 10.1109/ACCESS.2017.2732738 Zhang, 2018, Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion, Eng. Appl. Artif. Intell., 76, 96, 10.1016/j.engappai.2018.09.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 Shao, 2020, Hybrid enhanced discrete fruit fly optimization algorithm for scheduling blocking flow-shop in distributed environment, Expert Syst. App., 145 Ribas, 2019, An iterated greedy algorithm for solving the total tardiness parallel blocking flow shop scheduling problem, Expert Syst. Appl., 121, 347, 10.1016/j.eswa.2018.12.039 Shao, 2020, Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem, Swarm. Evol. Comput., 59, 10.1016/j.swevo.2020.100747 Shao, 2020, Effective Constructive Heuristic and Metaheuristic for the Distributed Assembly Blocking Flow-shop Scheduling Problem, Appl. Intell., 1 Pan, 2012, Effective heuristics for the blocking flowshop scheduling problem with makespan minimization, Omega (Westport), 40, 218 Wang, 2010, A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems, Comput. Oper. Res., 37, 509, 10.1016/j.cor.2008.12.004 Li, 2004, Heuristic algorithms for large flowshop scheduling problems, 2999 Dong, 2008, An improved NEH-based heuristic for the permutation flowshop problem, Comput. Oper. Res., 35, 3962, 10.1016/j.cor.2007.05.005 Mao, 2021, An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance, Expert Syst. Appl., 169 Pan, 2017, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Appl. Math. Comput., 303, 89, 10.1016/j.amc.2017.01.004 Taillard, 1993, Benchmarks for basic scheduling problems, Eur J. Oper. Res., 64, 278, 10.1016/0377-2217(93)90182-M Montgomery, 2012 Zhang, 2020, A Three-Stage Multiobjective Approach Based on Decomposition for an Energy-Efficient Hybrid Flow Shop Scheduling Problem, IEEE Trans. Syst., Man, Cybern., 50, 4984, 10.1109/TSMC.2019.2916088