References
- Neufeld JS, Schulz S, Buscher U. A systematic review of multi-objective hybrid flow shop scheduling[J]. Eur J Oper Res. 2023;309(1):1–23.
- Shao W, Shao Z, Pi D. Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem[J]. Knowledge-Based Syst. 2020;194:105527.
- Lin JT, Chen CM. Simulation optimization approach for hybrid flow shop scheduling problem in semiconductor back-end manufacturing[J]. Simul Modell Pract Theory. 2015;51:100–114.
- Wang CN, Hsu HP, Fu HP, et al. Scheduling flexible flow shop in labeling companies to minimize the makespan[J]. Comput Syst Sci Eng. 2022;40(1):17–36.
- Johnson SM. Optimal twoand threestage production schedules with setup times included[J]. Nav Res Logist Q. 1954;1(1):61–68.
- Kyparisis GJ, Koulamas C. A note on makespan minimization in two-stage flexible flow shops with uniform machines[J]. Eur J Oper Res. 2006;175(2):1321–1327.
- Paternina-Arboleda CD, Montoya-Torres JR, Acero-Dominguez MJ, et al. Scheduling jobs on ak-stage flexible flow-shop[J]. Ann Oper Res. 2008;164(1):29–40.
- Ribas I, Leisten R, Framian JM. Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective[J]. Comput Oper Res. 2010;37(8):1439–1454.
- Lin SW, Cheng CY, Pourhejazy P, et al. New benchmark algorithm for hybrid flowshop scheduling with identical machines[J]. Expert Syst Appl. 2021;183:115422.
- Ab Rashid MFF, Nik Mutasim MA. Cost-based hybrid flow shop scheduling with uniform machine optimization using an improved tiki-taka algorithm[J]. J Ind Prod Eng. 2024;41(2):182–199.
- Kyparisis GJ, Koulamas C. Flexible flow shop scheduling with uniform parallel machines[J]. Eur J Oper Res. 2006;168(3):985–997.
- Kazemi H, Mahdavi Mazdeh M, Rostami M, et al. The integrated production-distribution scheduling in parallel machine environment by using improved genetic algorithms[J]. J Ind Prod Eng. 2021;38(3):157–170.
- Garavito-Hernndez EA, Pea-Tibaduiza E, Perez-Figueredo LE, et al. A meta-heuristic based on the Imperialist Competitive Algorithm (ICA) for solving Hybrid Flow Shop (HFS) scheduling problem with unrelated parallel machines[J]. J Ind Prod Eng. 2019;36(6):362–370.
- Meng L, Zhang C, Shao X, et al. More MILP models for hybrid flow shop scheduling problem and its extended problems[J]. Int J P Res. 2020;58(13):3905–3930.
- Ruiz R, Vzquez-Rodrguez JA. The hybrid flow shop scheduling problem[J]. Eur J Oper Res. 2010;205(1):1–18.
- Moursli O, Pochet Y. A branch-and-bound algorithm for the hybrid flowshop[J]. Int J Prod Econ. 2000;64(1–3):113–125.
- Han W, Deng Q, Gong G, et al. Multi-objective evolutionary algorithms with heuristic decoding for hybrid flow shop scheduling problem with worker constraint[J]. Expert Syst Appl. 2021;168:114282.
- SHAO Z, SHAO W, PI D. Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem [J]. Knowledge-Based Syst. 2021;221:106959.
- Wang S, Wang X, Chu F, et al. An energy-efficient two-stage hybrid flow shop scheduling problem in a glass production[J]. Int J P Res. 2020;58(8):2283–2314.
- Zheng J, Wang L, Wang J. A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop[J]. Knowledge-Based Syst. 2020;194:105536.
- Zhao F, He X, Wang L. A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem[J]. IEEE Trans Cybern. 2020;51(11):5291–5303.
- Zhang C, Tan J, Peng K, et al. A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers[J]. Rob Comput Integr Manuf. 2021;68:102081.
- HAN Y, LI J, Sang H, et al. Discrete evolutionary multi-objective optimization for energy-efficient blocking flow shop scheduling with setup time [J]. Appl Soft Comput. 2020;93:106343.
- Lei C, Zhao N, Ye S, et al. Memetic algorithm for solving flexible flow-shop scheduling problems with dynamic transport waiting times[J]. Comput Ind Eng. 2020;139:105984.
- Babayan A, He* D. Solving the n-job 3-stage flexible flowshop scheduling problem using an agent-based approach[J]. Int J P Res. 2004;42(4):777–799.
- Han W, Guo F, Su X. A reinforcement learning method for a hybrid flow-shop scheduling problem[J]. Algorithms. 2019;12(11):222.
- LUO J, Fujimura S, El Baz D, et al. GPU based parallel genetic algorithm for solving an energy efficient dynamic flexible flow shop scheduling problem [J]. J Parallel Distrib Comput. 2019;133:244–257.
- Tliba K, Diallo TML, Penas O, et al. Digital twin-driven dynamic scheduling of a hybrid flow shop[J]. J Intell Manuf. 2023;34(5):2281–2306.
- Shi L, Guo G, Song X. Multi-agent based dynamic scheduling optimisation of the sustainable hybrid flow shop in a ubiquitous environment[J]. Int J P Res. 2021;59(2):576–597.
- Williams HP. Model building in mathematical programming[M]. Chichester, England: John Wiley & Sons; 2013.
- Bemporad A, Morari M. Control of systems integrating logic, dynamics, and constraints[J]. Automatica. 1999;35(3):407–427.
- Darby ML, Nikolaou M. MPC: current practice and challenges[J]. Control Eng Pract. 2012;20(4):328–342.
- Kianfar K, Fatemi Ghomi SMT, Oroojlooy Jadid A. Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA [J]. Eng Appl Artif Intell. 2012;25(3):494–506.
- Hart WE, Laird CD, Watson JP, et al. Pyomo-optimization modeling in python[M]. Berlin: Springer; 2017.
- Bangsow S. Tecnomatix plant simulation[M]. Cham, Switzerland: Springer International Publishing; 2020.