Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem

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

Yu, 2016, An Effective Heuristic Rescheduling Method for Steelmaking and Continuous Casting Production Process With Multirefining Modes, IEEE Trans. Syst., Man, Cybernet. Syst., 46, 1675, 10.1109/TSMC.2016.2604081

Pan, 2016, An effective co-evolutionary artificial bee colony algorithm for steelmaking-continuous casting scheduling, Eur. J. Oper. Res., 250, 702, 10.1016/j.ejor.2015.10.007

Jiang, 2018, A preference-inspired multi-objective soft scheduling algorithm for the practical steelmaking-continuous casting production, Comput. Ind. Eng., 115, 582, 10.1016/j.cie.2017.10.028

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

Fu, 2021, Distributed scheduling problems in intelligent manufacturing systems, Tsinghua Sci. Technol., 26, 625, 10.26599/TST.2021.9010009

Lohmer, 2021, Production planning and scheduling in multi-factory production networks: a systematic literature review, Int. J. Prod. Res., 59, 2028, 10.1080/00207543.2020.1797207

Kovalyov, 1985, Efficient epsilon-approximation algorithm for minimizing the makespan in a parallel two-stage system, Ser Phiz-Mat Navuk (in Russian)., 3, 119

Ruiz, 2019, Iterated Greedy methods for the distributed permutation flowshop scheduling problem, Omega., 83, 213, 10.1016/j.omega.2018.03.004

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, 2019, A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time, IEEE Trans. Autom. Sci. Eng., 16, 1344, 10.1109/TASE.2018.2886303

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

Cheng, 2019, Minimising makespan in distributed mixed no-idle flowshops, Int. J. Prod. Res., 57, 48, 10.1080/00207543.2018.1457812

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

Zhang, 2019, Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion, Comput. Oper. Res., 108, 33, 10.1016/j.cor.2019.04.002

Zhang, 2018, Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan, Int. J. Prod. Res., 56, 3226, 10.1080/00207543.2017.1401241

Pan, 2020, An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Transactions on, Cybernetics.

Meng, 2021, A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time, Swarm Evol. Comput., 60, 100804, 10.1016/j.swevo.2020.100804

Mao J-y, Pan Q-k, Miao Z-h, Gao L. 2021. An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance. Exp. Syst. Appl. 169, 114495.

Jing, 2021, Local search-based metaheuristics for the robust distributed permutation flowshop problem, Appl. Soft Comput., 105, 107247, 10.1016/j.asoc.2021.107247

Zhao, 2021, A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem, Comput. Ind. Eng., 153, 107082, 10.1016/j.cie.2020.107082

Ying, 2018, Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks, Expert Syst. Appl., 92, 132, 10.1016/j.eswa.2017.09.032

Shao, 2020, Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem, Knowl.-Based Syst., 194, 105527, 10.1016/j.knosys.2020.105527

Zheng, 2020, A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop, Knowl.-Based Syst., 194, 105536, 10.1016/j.knosys.2020.105536

Lei, 2020, Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping, Eng. Optim., 52, 1461, 10.1080/0305215X.2019.1674295

Li, 2020, A discrete artificial bee colony algorithm for distributed hybrid flowshop scheduling problem with sequence-dependent setup times, Int. J. Prod. Res.

Li, 2020, An improved artificial bee colony algorithm for distributed heterogeneous hybrid flowshop scheduling problem with sequence-dependent setup times, Comput. Ind. Eng., 147, 106638, 10.1016/j.cie.2020.106638

Cai, 2020, Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks, Eng. Appl. Artif. Intell., 90, 103540, 10.1016/j.engappai.2020.103540

Cai, 2020, A shuffled frog-leaping algorithm with memeplex quality for bi-objective distributed scheduling in hybrid flow shop, Int. J. Prod. Res.

Wang J, Wang L. A 2020. bi-population cooperative memetic algorithm for distributed hybrid flow-shop scheduling. IEEE Transactions on Emerging Topics in Computational Intelligence. (online).

Shao, 2021, Multi-objective evolutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem, Expert Syst. Appl., 183, 115453, 10.1016/j.eswa.2021.115453

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

Dios, 2018, Efficient heuristics for the hybrid flow shop scheduling problem with missing operations, Comput. Ind. Eng., 115, 88, 10.1016/j.cie.2017.10.034

Pan, 2014, A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation, Omega., 45, 42, 10.1016/j.omega.2013.12.004

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

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

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

Fernandez-Viagas, 2019, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, Comput. Oper. Res., 109, 77, 10.1016/j.cor.2019.05.002

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

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

Paternina-Arboleda, 2008, Scheduling jobs on a k-stage flexible flow-shop, Ann. Oper. Res., 164, 29, 10.1007/s10479-007-0257-2

Hansen, 2008, Variable neighbourhood search: methods and applications, 4OR., 6, 319, 10.1007/s10288-008-0089-1