A review of intelligent optimization for group scheduling problems in cellular manufacturing

Abstract

Given that group technology can reduce the changeover time of equipment, broaden the productivity, and enhance the flexibility of manufacturing, especially cellular manufacturing, group scheduling problems (GSPs) have elicited considerable attention in the academic and industry practical literature. There are two issues to be solved in GSPs: One is how to allocate groups into the production cells in view of major setup times between groups and the other is how to schedule jobs in each group. Although a number of studies on GSPs have been published, few integrated reviews have been conducted so far on considered problems with different constraints and their optimization methods. To this end, this study hopes to shorten the gap by reviewing the development of research and analyzing these problems. All literature is classified according to the number of objective functions, number of machines, and optimization algorithms. The classical mathematical models of single-machine, permutation, and distributed flowshop GSPs based on adjacent and position-based modeling methods, respectively, are also formulated. Last but not least, outlooks are given for outspread problems and problem algorithms for future research in the fields of group scheduling.

Graphical abstract

Keywords

cellular manufacturing / group scheduling / flowshop / literature review

References

[1] Adressi, A Tasouji Hassanpour, S Azizi, V (2016). Solving group scheduling problem in no-wait flexible flowshop with random machine breakdown. Decision Science Letters, 5( 1): 157–168

[2] Allison, J D (1990). Combining Petrov’s heuristic and the CDS heuristic in group scheduling problems. Computers & Industrial Engineering, 19( 1): 457–461

[3] Bai, J Li, Z R Huang, X (2012). Single-machine group scheduling with general deterioration and learning effects. Applied Mathematical Modelling, 36( 3): 1267–1274

[4] Baker, K R (1990). Scheduling groups of jobs in the two-machine flow shop. Mathematical and Computer Modelling, 13( 3): 29–36

[5] Behjat, S Salmasi, N (2017). Total completion time minimisation of no-wait flowshop group scheduling problem with sequence dependent setup times. European Journal of Industrial Engineering, 11( 1): 22–48

[6] Behnamian, J Zandieh, M Fatemi Ghomi, S M T (2010). Due windows group scheduling using an effective hybrid optimization approach. International Journal of Advanced Manufacturing Technology, 46( 5–8): 721–735

[7] Biskup, D (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115( 1): 173–178

[8] Bozorgirad, M A Logendran, R (2013). Bi-criteria group scheduling in hybrid flowshops. International Journal of Production Economics, 145( 2): 599–612

[9] Bozorgirad, M A Logendran, R (2016). A comparison of local search algorithms with population-based algorithms in hybrid flow shop scheduling problems with realistic characteristics. International Journal of Advanced Manufacturing Technology, 83( 5): 1135–1151

[10] Chen, M Wen, J Song, Y J Xing, L Chen, Y (2021). A population perturbation and elimination strategy based genetic algorithm for multi-satellite TT&C scheduling problem. Swarm and Evolutionary Computation, 65: 100912

[11] Chen, R Yang, B Li, S Wang, S (2020). A self-learning genetic algorithm based on reinforcement learning for flexible job-shop scheduling problem. Computers & Industrial Engineering, 149: 106778

[12] Chen, X Fu, J Zhou, J Li, Y (2022). Distributed reinforcement learning algorithm for multi-wave fire fighting scheduling problem. IFAC-PapersOnLine, 55( 3): 245–250

[13] ChoK KAhnB H (2003). A hybrid genetic algorithm for group scheduling with sequence dependent group setup time. International Journal of Industrial Engineering: Theory, Applications and Practice, 10(4): 442–448

[14] Costa, A Cappadonna, F A Fichera, S (2014). Joint optimization of a flow-shop group scheduling with sequence dependent set-up times and skilled workforce assignment. International Journal of Production Research, 52( 9): 2696–2728

[15] Costa, A Cappadonna, F A Fichera, S (2017). A hybrid genetic algorithm for minimizing makespan in a flow-shop sequence-dependent group scheduling problem. Journal of Intelligent Manufacturing, 28( 6): 1269–1283

[16] Costa, A Cappadonna, F V Fichera, S (2020). Minimizing makespan in a flow shop sequence dependent group scheduling problem with blocking constraint. Engineering Applications of Artificial Intelligence, 89: 103413

[17] Feng, H Tan, C Xia, T Pan, E Xi, L (2019). Joint optimization of preventive maintenance and flexible flowshop sequence-dependent group scheduling considering multiple setups. Engineering Optimization, 51( 9): 1529–1546

[18] Feng, H Xi, L Xiao, L Xia, T Pan, E (2018). Imperfect preventive maintenance optimization for flexible flowshop manufacturing cells considering sequence-dependent group scheduling. Reliability Engineering & System Safety, 176: 218–229

[19] Fernandez-Viagas, V Costa, A (2021). Two novel population based algorithms for the single machine scheduling problem with sequence dependent setup times and release times. Swarm and Evolutionary Computation, 63: 100869

[20] Frazier, G V (1996). An evaluation of group scheduling heuristics in a flow-line manufacturing cell. International Journal of Production Research, 34( 4): 959–976

[21] Gelogullari, C A Logendran, R (2010). Group-scheduling problems in electronics manufacturing. Journal of Scheduling, 13( 2): 177–202

[22] Gholipour-Kanani, Y Tavakkoli-Moghaddam, R Khorrami, A (2011). Solving a multi-criteria group scheduling problem for a cellular manufacturing system by scatter search. Journal of the Chinese Institute of Industrial Engineers, 28( 3): 192–205

[23] Gu, X (2022). Modeling of reconfigurable manufacturing system architecture with geometric machines and in-stage gantries. Journal of Manufacturing Systems, 62: 102–113

[24] GuoFHanWSuXLiuYCuiR (2021). A bi-population immune algorithm for weapon transportation support scheduling problem with pickup and delivery on aircraft carrier deck. Defence Technology, in press, doi:10.1016/j.dt.2021.12.006

[25] Hajinejad, D Salmasi, N Mokhtari, R (2011). A fast hybrid particle swarm optimization algorithm for flow shop sequence dependent group scheduling problem. Scientia Iranica, 18( 3): 759–764

[26] Hamzadayı, A (2020). An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem. Computers & Operations Research, 123: 105006

[27] Han, X Han, Y Zhang, B Qin, H Li, J Liu, Y Gong, D (2022). An effective iterative greedy algorithm for distributed blocking flowshop scheduling problem with balanced energy costs criterion. Applied Soft Computing, 129: 109502

[28] HeXPanQGaoLWangLSuganthanP N (2021). A greedy cooperative co-evolution ARY algorithm with problem-specific knowledge for multi-objective flowshop group scheduling problems. IEEE Transactions on Evolutionary Computation, in press, doi:10.1109/TEVC.2021.3115795

[29] Huang, X Wang, M Z (2014). Single machine group scheduling with time and position dependent processing times. Optimization Letters, 8( 4): 1475–1485

[30] Huang, X Wang, M Z Wang, J B (2011). Single-machine group scheduling with both learning effects and deteriorating jobs. Computers & Industrial Engineering, 60( 4): 750–754

[31] Huang, Y Y Pan, Q K Gao, L Miao, Z H Peng, C (2022). A two-phase evolutionary algorithm for multi-objective distributed assembly permutation flowshop scheduling problem. Swarm and Evolutionary Computation, 74: 101128

[32] Janiak, A Kovalyov, M Y (1995). Single machine group scheduling with ordered criteria. Annals of Operations Research, 57( 1): 191–201

[33] Jiang, R Chen, Y Guan, Z Zhou, H (2013). Constraint satisfaction modeling and solving method for single machine group scheduling problem. China Mechanical Engineering, 24( 12): 1642–1649

[34] Karimi, N Zandieh, M Karamooz, H R (2010). Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach. Expert Systems with Applications, 37( 6): 4024–4032

[35] Karimi, N Zandieh, M Najafi, A A (2011). Group scheduling in flexible flow shops: A hybridised approach of imperialist competitive algorithm and electromagnetic-like mechanism. International Journal of Production Research, 49( 16): 4965–4977

[36] Keshavarz, T Salmasi, N (2013). Makespan minimisation in flexible flowshop sequence-dependent group scheduling problem. International Journal of Production Research, 51( 20): 6182–6193

[37] Keshavarz, T Salmasi, N (2014). Efficient upper and lower bounding methods for flowshop sequence-dependent group scheduling problems. European Journal of Industrial Engineering, 8( 3): 366–387

[38] Keshavarz, T Salmasi, N Varmazyar, M (2015a). Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem. Annals of Operations Research, 226( 1): 351–377

[39] Keshavarz, T Salmasi, N Varmazyar, M (2019). Flowshop sequence-dependent group scheduling with minimisation of weighted earliness and tardiness. European Journal of Industrial Engineering, 13( 1): 54–80

[40] Keshavarz, T Savelsbergh, M Salmasi, N (2015b). A branch-and-bound algorithm for the single machine sequence-dependent group scheduling problem with earliness and tardiness penalties. Applied Mathematical Modelling, 39( 20): 6410–6424

[41] Khamseh, A Jolai, F Babaei, M (2015). Integrating sequence-dependent group scheduling problem and preventive maintenance in flexible flow shops. International Journal of Advanced Manufacturing Technology, 77( 1–4): 173–185

[42] Koksal, E Hegde, A R Pandiarajan, H P Veeravalli, B (2021). Performance characterization of reinforcement learning-enabled evolutionary algorithms for integrated school bus routing and scheduling problem. International Journal of Cognitive Computing in Engineering, 2: 47–56

[43] Kuo, W H (2012). Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect. Annals of Operations Research, 196( 1): 349–359

[44] Lee, W C Wu, C C (2009). A note on single-machine group scheduling problems with position-based learning effect. Applied Mathematical Modelling, 33( 4): 2159–2163

[45] Li, S (1997). A hybrid two-stage flowshop with part family, batch production, major and minor set-ups. European Journal of Operational Research, 102( 1): 142–156

[46] Li, S Ng, C T Yuan, J (2011). Group scheduling and due date assignment on a single machine. International Journal of Production Economics, 130( 2): 230–235

[47] Li, W X Zhao, C L (2015). Single machine scheduling problem with multiple due windows assignment in a group technology. Journal of Applied Mathematics & Computing, 48( 1–2): 477–494

[48] Li, X Bayrak, A E Epureanu, B I Koren, Y (2018). Real-time teaming of multiple reconfigurable manufacturing systems. CIRP Annals, 67( 1): 437–440

[49] Liao, W Zhang, X Jiang, M (2017). Production scheduling model considering failure rate threshold for group production. Computer Integrated Manufacturing Systems, 23( 3): 599–608

[50] Lin, H T Liao, C J (2003). A case study in a two-stage hybrid flow shop with setup time and dedicated machines. International Journal of Production Economics, 86( 2): 133–143

[51] Lin, S W Ying, K C (2019). Makespan optimization in a no-wait flowline manufacturing cell with sequence-dependent family setup times. Computers & Industrial Engineering, 128: 1–7

[52] Liou, C D Hsieh, Y C (2015). A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times. International Journal of Production Economics, 170: 258–267

[53] Liou, C D Hsieh, Y C Chen, Y Y (2013). A new encoding scheme-based hybrid algorithm for minimising two-machine flow-shop group scheduling problem. International Journal of Systems Science, 44( 1): 77–93

[54] Liou, C D Liu, C H (2010). A novel encoding scheme of PSO for two-machine group scheduling. In: 1st International Conference on Swarm Intelligence: Advances in Swarm Intelligence. Beijing: Springer, 128–134

[55] Liu, P Tang, L Zhou, X (2010). Two-agent group scheduling with deteriorating jobs on a single machine. International Journal of Advanced Manufacturing Technology, 47( 5–8): 657–664

[56] Liu, Y (2020). Effective heuristics to minimize total flowtime for distributed flowshop group scheduling problems. In: 5th International Conference on Mechanical, Control and Computer Engineering (ICMCCE). Harbin: IEEE, 708–711

[57] Logendran, R (1992). Group scheduling problem: Key to flexible manufacturing systems. Computers & Industrial Engineering, 23( 1): 113–116

[58] Logendran, R Carson, S Hanson, E (2005). Group scheduling in flexible flow shops. International Journal of Production Economics, 96( 2): 143–155

[59] Logendran, R deSzoeke, P Barnard, F (2006a). Sequence-dependent group scheduling problems in flexible flow shops. International Journal of Production Economics, 102( 1): 66–86

[60] Logendran, R Mai, L Talkington, D (1995). Combined heuristics for bi-level group scheduling problems. International Journal of Production Economics, 38( 2): 133–145

[61] Logendran, R Nudtasomboon, N (1991). Minimizing the makespan of a group scheduling problem: A new heuristic. International Journal of Production Economics, 22( 3): 217–230

[62] Logendran, R Salmasi, N Sriskandarajah, C (2006b). Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups. Computers & Operations Research, 33( 1): 158–180

[63] Logendran, R Sriskandarajah, C (1993). Two-machine group scheduling problem with blocking and anticipatory setups. European Journal of Operational Research, 69( 3): 467–481

[64] Low, C Lin, W Y (2012). Single machine group scheduling with learning effects and past-sequence-dependent setup times. International Journal of Systems Science, 43( 1): 1–8

[65] Lu, D Logendran, R (2013). Bi-criteria group scheduling with sequence-dependent setup time in a flow shop. Journal of the Operational Research Society, 64( 4): 530–546

[66] Lu, Y Y Wang, J J Wang, J B (2014). Single machine group scheduling with decreasing time-dependent processing times subject to release dates. Applied Mathematics and Computation, 234: 286–292

[67] Mahmoodi, F Dooley, K J (1991). A comparison of exhaustive and non-exhaustive group scheduling heuristics in a manufacturing cell. International Journal of Production Research, 29( 9): 1923–1939

[68] Mahmoodi, F Dooley, K J Starr, P J (1990). An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell. International Journal of Production Research, 28( 9): 1695–1711

[69] Mendes, N F M Arroyo, J E C Villadiego, H M M (2013). Local search heuristics for the flowshop sequence dependent group scheduling problem. In: 29th Latin American Computing Conference. Caracas: IEEE, 1–7

[70] Neufeld, J S Gupta, J N D Buscher, U (2015). Minimising makespan in flowshop group scheduling with sequence-dependent family set-up times using inserted idle times. International Journal of Production Research, 53( 6): 1791–1806

[71] Neufeld, J S Gupta, J N D Buscher, U (2016). A comprehensive review of flowshop group scheduling literature. Computers & Operations Research, 70: 56–74

[72] NieLGaoLHuY D (2007). Prefix-gene-expression-programming-based algorithm for scheduling groups of jobs on a single machine. Computer Integrated Manufacturing Systems, 115(11): 2261–2268, 2275 (in Chinese)

[73] Pan, E Wang, G Xi, L Chen, L Han, X (2014). Single-machine group scheduling problem considering learning, forgetting effects and preventive maintenance. International Journal of Production Research, 52( 19): 5690–5704

[74] Pan, Q K Gao, L Wang, L (2022). An effective cooperative co-evolutionary algorithm for distributed flowshop group scheduling problems. IEEE Transactions on Cybernetics, 52( 7): 5999–6012

[75] Qin, H Han, Y Wang, Y Liu, Y Li, J Pan, Q (2022a). Intelligent optimization under blocking constraints: A novel iterated greedy algorithm for the hybrid flow shop group scheduling problem. Knowledge-Based Systems, 258: 109962

[76] Qin, H Zhang, Z H Bai, D (2016). Permutation flowshop group scheduling with position-based learning effect. Computers & Industrial Engineering, 92: 1–15

[77] Qin, H X Han, Y Y Liu, Y P Li, J Q Pan, Q K Han, X (2022b). A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints. Expert Systems with Applications, 201: 117256

[78] Qin, H X Han, Y Y Zhang, B Meng, L L Liu, Y P Pan, Q K Gong, D W (2022c). An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem. Swarm and Evolutionary Computation, 69: 100992

[79] Radharamanan, R (1986). A heuristic algorithm for group scheduling. Computers & Industrial Engineering, 11( 1): 204–208

[80] Ren, J Ye, C Yang, F (2021). Solving flow-shop scheduling problem with a reinforcement learning algorithm that generalizes the value function with neural network. Alexandria Engineering Journal, 60( 3): 2787–2800

[81] Rossit, D A Tohmé, F Frutos, M (2018). The non-permutation flow-shop scheduling problem: A literature review. Omega, 77: 143–153

[82] Ruben, R A Mosier, C T Mahmoodi, F (1993). A comprehensive analysis of group scheduling heuristics in a job shop cell. International Journal of Production Research, 31( 6): 1343–1369

[83] Salmasi, N Logendran, R (2008). A heuristic approach for multi-stage sequence-dependent group scheduling problems. Journal of Industrial Engineering International, 4( 7): 48–58

[84] Salmasi, N Logendran, R Skandari, M R (2010). Total flow time minimization in a flowshop sequence-dependent group scheduling problem. Computers & Operations Research, 37( 1): 199–212

[85] Salmasi, N Logendran, R Skandari, M R (2011). Makespan minimization of a flowshop sequence-dependent group scheduling problem. International Journal of Advanced Manufacturing Technology, 56( 5): 699–710

[86] Schaller, J (2001). A new lower bound for the flow shop group scheduling problem. Computers & Industrial Engineering, 41( 2): 151–161

[87] Schaller, J E Gupta, J N D Vakharia, A J (2000). Scheduling a flowline manufacturing cell with sequence dependent family setup times. European Journal of Operational Research, 125( 2): 324–339

[88] Shahvari, O Salmasi, N Logendran, R Abbasi, B (2012). An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems. International Journal of Production Research, 50( 15): 4237–4254

[89] Shao, Z Shao, W Pi, D (2021). Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem. Knowledge-Based Systems, 221: 106959

[90] Solimanpur, M Elmi, A (2011). A tabu search approach for group scheduling in buffer-constrained flow shop cells. International Journal of Computer Integrated Manufacturing, 24( 3): 257–268

[91] Song, H Yi, S Wu, C Zhang, S Deng, G Liu, P Wei, X (2020). Research on group scheduling of optimal setup uncorrelated parallel machine based on GATS hybrid algorithm. Journal of Chongqing University, 43( 1): 53–63

[92] Taghavi-fard, M T Javanshir, H Roueintan, M A Soleimany, E (2011). Multi-objective group scheduling with learning effect in the cellular manufacturing system. International Journal of Industrial Engineering Computations, 2( 3): 617–630

[93] Tang, H Fang, B Liu, R Li, Y Guo, S (2022a). A hybrid teaching and learning-based optimization algorithm for distributed sand casting job-shop scheduling problem. Applied Soft Computing, 120: 108694

[94] Tang, J Haddad, Y Salonitis, K (2022b). Reconfigurable manufacturing system scheduling: A deep reinforcement learning approach. Procedia CIRP, 107: 1198–1203

[95] Tavakkoli-Moghaddam, R Javadian, N Khorrami, A Gholipour-Kanani, Y (2010). Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system. Expert Systems with Applications, 37( 3): 2661–2669

[96] van der Zee, D J (2013). Family based dispatching with batch availability. International Journal of Production Research, 51( 12): 3643–3653

[97] Villadiego, H M M Arroyo, J E C Jacob, V V dos Santos, A G Goncalves, L B (2012). An efficient ILS heuristic for total flow time minimization in a flow shop sequence dependent group scheduling problem. In: 12th International Conference on Hybrid Intelligent Systems (HIS). Pune: IEEE, 259–264

[98] Wang, J B Gao, W J Wang, L Y Wang, D (2009). Single machine group scheduling with general linear deterioration to minimize the makespan. International Journal of Advanced Manufacturing Technology, 43( 1–2): 146–150

[99] Wang, J B Guo, A X Shan, F Jiang, B Wang, L Y (2007). Single machine group scheduling under decreasing linear deterioration. Journal of Applied Mathematics & Computing, 24( 1): 283–293

[100] Wang, J B Wang, J J (2014). Single machine group scheduling with time dependent processing times and ready times. Information Sciences, 275: 226–231

[101] Wang, J J Liu, Y J (2014). Single-machine bicriterion group scheduling with deteriorating setup times and job processing times. Applied Mathematics and Computation, 242: 309–314

[102] Wang, Y Wang, S Li, D Shen, C Yang, B (2021). An improved multi-objective whale optimization algorithm for the hybrid flow shop scheduling problem considering device dynamic reconfiguration processes. Expert Systems with Applications, 174: 114793

[103] Wang, Z Y Pan, Q K Gao, L Wang, Y L (2022). An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem. Swarm and Evolutionary Computation, 74: 101143

[104] Wilson, A D King, R E Hodgson, T J (2004). Scheduling non-similar groups on a flow line: Multiple group setups. Robotics and Computer-integrated Manufacturing, 20( 6): 505–515

[105] Wu, C Wang, L Wang, J (2021). A path relinking enhanced estimation of distribution algorithm for direct acyclic graph task scheduling problem. Knowledge-Based Systems, 228: 107255

[106] Wu, X Cao, Z (2022). An improved multi-objective evolutionary algorithm based on decomposition for solving re-entrant hybrid flow shop scheduling problem with batch processing machines. Computers & Industrial Engineering, 169: 108236

[107] Yan, Y Zhao, C (2007). Single machine group scheduling with resource dependent setup times. Systems Engineering and Electronics, 333( 6): 938–941

[108] Yang, D L Chern, M S (2000). Two-machine flowshop group scheduling problem. Computers & Operations Research, 27( 10): 975–985

[109] Yang, D L Kuo, W H Chern, M S (2008a). Multi-family scheduling in a two-machine reentrant flow shop with setups. European Journal of Operational Research, 187( 3): 1160–1170

[110] Yang, S J (2011). Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine. Applied Mathematical Modelling, 35( 8): 4008–4016

[111] Yang, S J Yang, D L (2010). Note on “A note on single-machine group scheduling problems with position-based learning effect”. Applied Mathematical Modelling, 34( 12): 4306–4308

[112] Yang, W H (2002). Group scheduling in a two-stage flowshop. Journal of the Operational Research Society, 53( 12): 1367–1373

[113] Yang, W H Liao, C J (1996). Group scheduling on two cells with intercell movement. Computers & Operations Research, 23( 10): 997–1006

[114] Yang, Y Li, X (2022). A knowledge-driven constructive heuristic algorithm for the distributed assembly blocking flow shop scheduling problem. Expert Systems with Applications, 202: 117269

[115] YangYWangD ZWangD WWangH F (2008b). Single machine group scheduling problem with resource constraints and deteriorating jobs. Control and Decision, 23(12): 1413–1416, 1422 (in Chinese)

[116] Yazdani Sabouni, M T Logendran, R (2013a). A single machine carryover sequence-dependent group scheduling in PCB manufacturing. Computers & Operations Research, 40( 1): 236–247

[117] Yazdani Sabouni, M T Logendran, R (2013b). Carryover sequence-dependent group scheduling with the integration of internal and external setup times. European Journal of Operational Research, 224( 1): 8–22

[118] Yin, N Kang, L Wang, X Y (2014). Single-machine group scheduling with processing times dependent on position, starting time and allotted resource. Applied Mathematical Modelling, 38( 19–20): 4602–4613

[119] Yoshida, T Nakamura, N Hitomi, K (1977). A study of group scheduling. Journal of Japan Industrial Management Association, 28( 3): 323–328

[120] Yuan, S Li, T Wang, B (2020a). A co-evolutionary genetic algorithm for the two-machine flow shop group scheduling problem with job-related blocking and transportation times. Expert Systems with Applications, 152: 113360

[121] Yuan, S Li, T Wang, B (2021). A discrete differential evolution algorithm for flow shop group scheduling problem with sequence-dependent setup and transportation times. Journal of Intelligent Manufacturing, 32( 2): 427–439

[122] Yuan, S Li, T Wang, B (2022). Enhanced migrating birds optimization algorithm for hybrid flowshop group scheduling problem with unrelated parallel machines. Computer Integrated Manufacturing Systems, 28( 12): 3912–3922

[123] Yuan, S Li, T Wang, B Yu, N (2020b). Model and algorithm for two-stage flow shop group scheduling problem with special blocking constraint. Control and Decision, 35( 7): 1773–1779

[124] Yue, L Guan, Z Saif, U Zhang, F Wang, H (2016). Hybrid Pareto artificial bee colony algorithm for multi-objective single machine group scheduling problem with sequence-dependent setup times and learning effects. SpringerPlus, 5( 1): 1593

[125] Zandieh, M Dorri, B Khamseh, A R (2009). Robust metaheuristics for group scheduling with sequence-dependent setup times in hybrid flexible flow shops. International Journal of Advanced Manufacturing Technology, 43( 7–8): 767–778

[126] Zandieh, M Hashemi, A R (2015). Group scheduling in hybrid flexible flowshop with sequence-dependent setup times and random breakdowns via integrating genetic algorithm and simulation. International Journal of Industrial and Systems Engineering, 21( 3): 377–394

[127] Zandieh, M Karimi, N (2011). An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid flexible flowshop with sequence-dependent setup times. Journal of Intelligent Manufacturing, 22( 6): 979–989

[128] Zhang, B Pan, Q Meng, L Lu, C Mou, J Li, J (2022a). An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots. Knowledge-Based Systems, 238: 107819

[129] Zhang, C Xu, W Liu, J Liu, Z Zhou, Z Pham, D T (2019). A reconfigurable modeling approach for digital twin-based manufacturing system. Procedia CIRP, 83: 118–125

[130] Zhang, X Liao, L Zhang, W Cheng, T C E Tan, Y Ji, M (2018). Single-machine group scheduling with new models of position-dependent processing times. Computers & Industrial Engineering, 117: 1–5

[131] Zhang, Z Q Qian, B Hu, R Jin, H P Wang, L Yang, J B (2022b). A matrix-cube-based estimation of distribution algorithm for blocking flow-shop scheduling problem with sequence-dependent setup times. Expert Systems with Applications, 205: 117602

[132] Zhao, F Shao, D Wang, L Xu, T Zhu, N (2022). An effective water wave optimization algorithm with problem-specific knowledge for the distributed assembly blocking flow-shop scheduling problem. Knowledge-Based Systems, 243: 108471

[133] Zhao, F Zhang, L Cao, J Tang, J (2021). A cooperative water wave optimization algorithm with reinforcement learning for the distributed assembly no-idle flowshop scheduling problem. Computers & Industrial Engineering, 153: 107082

[134] Zheng, Y Xie, S Qian, W (2014). Hybrid differential evolution algorithm for FSDGS problem with limited buffers. Computer Integrated Manufacturing Systems, 20( 8): 1941–1947

[135] Zhou, Y Miao, J Yan, B Zhang, Z (2021). Stochastic resource-constrained project scheduling problem with time varying weather conditions and an improved estimation of distribution algorithm. Computers & Industrial Engineering, 157: 107322

[136] Zhu, Z Sun, L Chu, F Liu, M (2011). Single-machine group scheduling with resource allocation and learning effect. Computers & Industrial Engineering, 60( 1): 148–157

[137] Zolfaghari, S Liang, M (1999). Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach. International Journal of Production Research, 37( 10): 2377–2397

RIGHTS & PERMISSIONS

Higher Education Press