A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots

Ruiz, 2010, The hybrid flow shop scheduling problem, European J. Oper. Res., 205, 1, 10.1016/j.ejor.2009.09.024 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 Zhang, 2019, A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem, Comput. Ind. Eng., 136, 325, 10.1016/j.cie.2019.07.036 Marichelvam, 2020, An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors-A case study, Comput. Oper. Res., 114, 10.1016/j.cor.2019.104812 Alfaro-Fernández, 2020, Automatic algorithm design for hybrid flowshop scheduling problems, European J. Oper. Res., 282, 835, 10.1016/j.ejor.2019.10.004 Öztop, 2019, Metaheuristic algorithms for the hybrid flowshop scheduling problem, Comput. Oper. Res., 111, 177, 10.1016/j.cor.2019.06.009 Meng, 2019, More MILP models for hybrid flow shop scheduling problem and its extended problems, Int. J. Prod. Res., 1 Mousavi, 2018, An efficient bi-objective algorithm to solve re-entrant hybrid flow shop scheduling with learning effect and setup times, Oper. Res., 18, 123 Reiter, 1966, A system for managing job-shop production, J. Bus., 39, 371, 10.1086/294867 Wang, 2019, Two-stage hybrid flow shop batching and lot streaming with variable sublots and sequence-dependent setups, Int. J. Prod. Res., 57, 6893, 10.1080/00207543.2019.1571251 Novas, 2019, Production scheduling and lot streaming at flexible job-shops environments using constraint programming, Comput. Ind. Eng., 136, 252, 10.1016/j.cie.2019.07.011 Zhang, 2020, Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system, European J. Oper. Res., 283, 441, 10.1016/j.ejor.2019.11.016 Cheng, 2013, A review of lot streaming, Int. J. Prod. Res., 51, 7023, 10.1080/00207543.2013.774506 Gong, 2020, Energy-efficient flexible flow shop scheduling with worker flexibility, Expert Syst. Appl., 141, 10.1016/j.eswa.2019.112902 Hansen, 2010, Variable neighbourhood search: methods and applications, Ann. Oper. Res., 175, 367, 10.1007/s10479-009-0657-6 Chen, 2010, Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem, Expert Syst. Appl., 37, 1620, 10.1016/j.eswa.2009.06.047 Zeng, 2018, Adaptive Tabu search and variable neighborhood descent for packing unequal circles into a square, Appl. Soft Comput., 65, 196, 10.1016/j.asoc.2017.11.051 Peng, 2019, A multi-start variable neighbourhood descent algorithm for hybrid flowshop rescheduling, Swarm Evol. Comput., 45, 92, 10.1016/j.swevo.2019.01.002 Liu, 2008, Single-job lot streaming in m-1 two-stage hybrid flowshops, European J. Oper. Res., 187, 1171, 10.1016/j.ejor.2006.06.066 Cheng, 2016, Two-stage, single-lot, lot streaming problem for a hybrid flow shop, J. Global Optim., 66, 263, 10.1007/s10898-015-0298-z Zhang, 2003, Model and heuristics for lot streaming of one job in M-1 hybrid flowshops, Int. J. Oper. Quant. Manag., 9, 49 Kim, 1997, Transfer batch scheduling for a two-stage flowshop with identical parallel machines at each stage, Omega, 25, 547, 10.1016/S0305-0483(97)00015-7 Tsubone, 1996, The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop, Int. J. Prod. Res., 34, 3037, 10.1080/00207549608905076 Song, 2013, Batch scheduling problem of hybrid flow shop based on ant colony algorithm, Comput. Integr. Manuf. Syst., 19, 1640 Naderi, 2014, A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times, J. Manuf. Syst., 33, 647, 10.1016/j.jmsy.2014.06.002 Zhang, 2017, An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming, Appl. Soft Comput., 52, 14, 10.1016/j.asoc.2016.12.021 Zhang, 2005, Multi-job lot streaming to minimize the mean completion time in m-1 hybrid flowshops, Int. J. Prod. Econ., 96, 189, 10.1016/j.ijpe.2004.04.005 Cheng, 2013, Two-stage, multiple-lot, lot streaming problem for a 1+2 hybrid flow shop, IFAC Proc. Vol., 46, 448, 10.3182/20130619-3-RU-3018.00310 Defersha, 2012, Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem, Int. J. Adv. Manuf. Technol., 62, 249, 10.1007/s00170-011-3798-0 Nejati, 2014, Multi-job lot streaming to minimize the weighted completion time in a hybrid flow shop scheduling problem with work shift constraint, Int. J. Adv. Manuf. Technol., 70, 501, 10.1007/s00170-013-5265-6 Lalitha, 2017, Lot streaming in [N-1](1)+N(m) hybrid flow shop, J. Manuf. Syst., 44, 12, 10.1016/j.jmsy.2017.04.018 Nejati, 2016, Lot streaming in a two-stage assembly hybrid flow shop scheduling problem with a work shift constraint, J. Ind. Prod. Eng., 33, 459 Zhang, 2020, A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem, IEEE Trans. Syst. Man Cybern. A, 50, 4984, 10.1109/TSMC.2019.2916088 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 Li, 2014, A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem, Appl. Soft Comput., 24, 63, 10.1016/j.asoc.2014.07.005 Zhang, 2018, A hybrid variable neighborhood search algorithm for the hot rolling batch scheduling problem in compact strip production, Comput. Ind. Eng., 116, 22, 10.1016/j.cie.2017.12.013 Zong, 2001, A new heuristic optimization algorithm: harmony search, Simulation, 76, 60, 10.1177/003754970107600201 Lee, 2005, A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice, Comput. Methods Appl. Mech. Engrg., 194, 3902, 10.1016/j.cma.2004.09.007 Montgomery, 2017 Jing, 2020, An effective iterated greedy algorithm for the distributed permutation flowshop scheduling with due windows, Appl. Soft Comput., 10.1016/j.asoc.2020.106629 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 Khare, 2019, Scheduling hybrid flowshop with sequence-dependent setup times and due windows to minimize total weighted earliness and tardiness, Comput. Ind. Eng., 135, 780, 10.1016/j.cie.2019.06.057 Balande, 2020, A modified teaching learning metaheuristic algorithm with opposite-based learning for permutation flow-shop scheduling problem, Evol. Intell.