This work addresses bi-objective hybrid flow shop scheduling problems considering consistent sublots (Bi-HFSP_CS). The objectives are to minimize the makespan and total energy consumption. First, the Bi-HFSP_CS is formalized, followed by the establishment of a mathematical model. Second, enhanced version of the artificial bee colony (ABC) algorithms is proposed for tackling the Bi-HFSP_CS. Then, fourteen local search operators are employed to search for better solutions. Two different Q-learning tactics are developed to embed into the ABC algorithm to guide the selection of operators throughout the iteration process. Finally, the proposed tactics are assessed for their efficacy through a comparison of the ABC algorithm, its three variants, and three effective algorithms in resolving 95 instances of 35 different problems. The experimental results and analysis showcase that the enhanced ABC algorithm combined with Q-learning (QABC1) demonstrates as the top performer for solving concerned problems. This study introduces a novel approach to solve the Bi-HFSP_CS and illustrates its efficacy and superior competitive strength, offering beneficial perspectives for exploration and research in relevant domains.
R. Ruiz and J. A. Vázquez-Rodríguez, The hybrid flow shop scheduling problem, European Journal of Operational Research, vol. 205, no. 1, pp. 1–18, 2010.
I. Ribas, R. Leisten, and J. M. Framiñan, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Comput. Oper. Res., vol. 37, no. 8, pp. 1439–1454, 2010.
Q. K. Pan, L. Gao, X. Y. Li, and K. Z. Gao, Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times, Appl. Math. Comput., vol. 303, pp. 89–112, 2017.
W. Qin, J. Zhang, and D. Song, An improved ant colony algorithm for dynamic hybrid flow shop scheduling with uncertain processing time, J. Intell. Manuf., vol. 29, no. 4, pp. 891–904, 2018.
J. H. Chang and H. N. Chiu, A comprehensive review of lot streaming, International Journal of Production Research, vol. 43, no. 8, pp. 1515–1536, 2005.
S. Reiter, A system for managing job-shop production, J. Bus., vol. 39, no. 3, pp. 371–393, 1966.
M. Cheng, N. J. Mukherjee, and S. C. Sarin, A review of lot streaming, International Journal of Production Research, vol. 51, nos. 23&24, pp. 7023–7046, 2013.
J. Liu, Single-job lot streaming in m–1 two-stage hybrid flowshops, Eur. J. Oper. Res., vol. 187, no. 3, pp. 1171–1183, 2008.
M. Cheng, S. C. Sarin, and S. Singh, Two-stage, single-lot, lot streaming problem for a 1+2 hybrid flow shop, J. Glob. Optim., vol. 66, no. 2, pp. 263–290, 2016.
W. Zhang, C. Yin, J. Liu, and R. J. Linn, Multi-job lot streaming to minimize the mean completion time in m–1 hybrid flowshops, Int. J. Prod. Econ., vol. 96, no. 2, pp. 189–200, 2005.
F. M. Defersha and M. Chen, Mathematical model and parallel genetic algorithm for hybrid flexible flowshop lot streaming problem, Int. J. Adv. Manuf. Technol., vol. 62, no. 1, pp. 249–265, 2012.
M. Nejati, I. Mahdavi, R. Hassanzadeh, N. Mahdavi-Amiri, and M. Mojarad, 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., vol. 70, no. 1, pp. 501–514, 2014.
J. L. Lalitha, N. Mohan, and V. M. Pillai, Lot streaming in [ N−1](1)+ N( m) hybrid flow shop, J. Manuf. Syst., vol. 44, pp. 12–21, 2017.
B. Zhang, Q. K. Pan, L. L. Meng, X. L. Zhang, Y. P. Ren, J. Q. Li, and X. C. Jiang, A collaborative variable neighborhood descent algorithm for the hybrid flowshop scheduling problem with consistent sublots, Appl. Soft Comput., vol. 106, p. 107305, 2021.
B. Gürsoy Yılmaz and Ö. Faruk Yılmaz, Lot streaming in hybrid flowshop scheduling problem by considering equal and consistent sublots under machine capability and limited waiting time constraint, Comput. Ind. Eng., vol. 173, p. 108745, 2022.
W. Shao, Z. Shao, and D. Pi, Modelling and optimization of distributed heterogeneous hybrid flow shop lot-streaming scheduling problem, Expert Syst. Appl., vol. 214, p. 119151, 2023.
B. Zhang, Q. K. Pan, L. Gao, X. L. Zhang, H. Y. Sang, and J. Q. Li, An effective modified migrating birds optimization for hybrid flowshop scheduling problem with lot streaming, Appl. Soft Comput., vol. 52, pp. 14–27, 2017.
C. Lu, J. Zhou, L. Gao, X. Li, and J. Wang, Modeling and multi-objective optimization for energy-aware scheduling of distributed hybrid flow-shop, Appl. Soft Comput., vol. 156, p. 111508, 2024.
J. Q. Li, H. Y. Sang, Y. Y. Han, C. G. Wang, and K. Z. Gao, Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions, J. Clean. Prod., vol. 181, pp. 584–598, 2018.
S. Schulz, J. S. Neufeld, and U. Buscher, A multi-objective iterated local search algorithm for comprehensive energy-aware hybrid flow shop scheduling, J. Clean. Prod., vol. 224, pp. 421–434, 2019.
E. Jiang, L. Wang, and J. Wang, Decomposition-based multi-objective optimization for energy-aware distributed hybrid flow shop scheduling with multiprocessor tasks, Tsinghua Science and Technology, vol. 26, no. 5, pp. 646–663, 2021.
Z. Wang, L. Shen, X. Li, and L. Gao, An improved multi-objective firefly algorithm for energy-efficient hybrid flowshop rescheduling problem, J. Clean. Prod., vol. 385, p. 135738, 2023.
C. Lu, Q. Liu, B. Zhang, and L. Yin, A Pareto-based hybrid iterated greedy algorithm for energy-efficient scheduling of distributed hybrid flowshop, Expert Syst. Appl., vol. 204, p. 117555, 2022.
B. Zhang, Q. K. Pan, L. L. Meng, C. Lu, J. H. Mou, and J. Q. Li, An automatic multi-objective evolutionary algorithm for the hybrid flowshop scheduling problem with consistent sublots, Knowl. Based Syst., vol. 238, p. 107819, 2022.
T. L. Chen, C. Y. Cheng, and Y. H. Chou, Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming, Ann. Oper. Res., vol. 290, no. 1, pp. 813–836, 2020.
C. Lu, L. Gao, Q. Pan, X. Li, and J. Zheng, A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution, Appl. Soft Comput., vol. 75, pp. 728–749, 2019.
C. Luo, W. Gong, F. Ming, and C. Lu, A Q-learning memetic algorithm for energy-efficient heterogeneous distributed assembly permutation flowshop scheduling considering priorities, Swarm Evol. Comput., vol. 85, p. 101497, 2024.
G. Tian, W. Wang, H. Zhang, X. Zhou, C. Zhang, and Z. Li, Multi-objective optimization of energy-efficient remanufacturing system scheduling problem with lot-streaming production mode, Expert Syst. Appl., vol. 237, p. 121309, 2024.
K. Gao, Z. Cao, L. Zhang, Z. Chen, Y. Han, and Q. Pan, A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems, IEEE/CAA J. Autom. Sin., vol. 6, no. 4, pp. 904–916, 2019.
K. Z. Gao, Z. M. He, Y. Huang, P. Y. Duan, and P. N. Suganthan, A survey on meta-heuristics for solving disassembly line balancing, planning and scheduling problems in remanufacturing, Swarm Evol. Comput., vol. 57, p. 100719, 2020.
K. Gao, Y. Huang, A. Sadollah, and L. Wang, A review of energy-efficient scheduling in intelligent production systems, Complex Intell. Syst., vol. 6, no. 2, pp. 237–249, 2020.
P. W. Shaikh, M. El-Abd, M. Khanafer, and K. Gao, A review on swarm intelligence and evolutionary algorithms for solving the traffic signal control problem, IEEE Trans. Intell. Transp. Syst., vol. 23, no. 1, pp. 48–63, 2022.
H. Cui, X. Li, L. Gao, and C. Zhang, Multi-population genetic algorithm with greedy job insertion inter-factory neighbourhoods for multi-objective distributed hybrid flow-shop scheduling with unrelated-parallel machines considering tardiness, Int. J. Prod. Res., vol. 62, no. 12, pp. 4427–4445, 2024.
Z. Shao, W. Shao, and D. Pi, LS-HH: A learning-based selection hyper-heuristic for distributed heterogeneous hybrid blocking flow-shop scheduling, IEEE Trans. Emerg. Top. Comput. Intell., vol. 7, no. 1, pp. 111–127, 2023.
W. Shao, Z. Shao, and D. Pi, A network memetic algorithm for energy and labor-aware distributed heterogeneous hybrid flow shop scheduling problem, Swarm Evol. Comput., vol. 75, p. 101190, 2022.
H. X. Qin, Y. Y. Han, Y. P. Liu, J. Q. Li, Q. K. Pan, and X. Han, A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints, Expert Syst. Appl., vol. 201, p. 117256, 2022.
F. Yu, C. Lu, J. Zhou, and L. Yin, Mathematical model and knowledge-based iterated greedy algorithm for distributed assembly hybrid flow shop scheduling problem with dual-resource constraints, Expert Syst. Appl., vol. 239, p. 122434, 2024.
Y. Zeng, K. Xiang, D. Li, and A. V. Vasilakos, Directional routing and scheduling for green vehicular delay tolerant networks, Wirel. Netw., vol. 19, no. 2, pp. 161–173, 2013.
H. Yu, K. Gao, N. Wu, M. Zhou, P. N. Suganthan, and S. Wang, Scheduling multiobjective dynamic surgery problems via Q-learning-based meta-heuristics, IEEE Trans. Syst. Man Cybern, Syst., vol. 54, no. 6, pp. 3321–3333, 2024.
Z. Lin, K. Gao, N. Wu, and P. N. Suganthan, Scheduling eight-phase urban traffic light problems via ensemble meta-heuristics and Q-learning based local search, IEEE Trans. Intell. Transp. Syst., vol. 24, no. 12, pp. 14415–14426, 2023.
H. Li, K. Gao, P. Y. Duan, J. Q. Li, and L. Zhang, An improved artificial bee colony algorithm with Q-learning for solving permutation flow-shop scheduling problems, IEEE Trans. Syst. Man Cybern. Syst., vol. 53, no. 5, pp. 2684–2693, 2023.
F. Zhao, S. Di, and L. Wang, A hyperheuristic with Q-learning for the multiobjective energy-efficient distributed blocking flow shop scheduling problem, IEEE Trans. Cybern., vol. 53, no. 5, pp. 3337–3350, 2023.
B. Xi and D. Lei, Q-learning-based teaching-learning optimization for distributed two-stage hybrid flow shop scheduling with fuzzy processing time, Complex System Modeling and Simulation, vol. 2, no. 2, pp. 113–129, 2022.
J. Cai, D. Lei, J. Wang, and L. Wang, A novel shuffled frog-leaping algorithm with reinforcement learning for distributed assembly hybrid flow shop scheduling, Int. J. Prod. Res., vol. 61, no. 4, pp. 1233–1251, 2023.
H. Yu, K. Z. Gao, Z. F. Ma, and Y. X. Pan, Improved meta-heuristics with Q-learning for solving distributed assembly permutation flowshop scheduling problems, Swarm Evol. Comput., vol. 80, p. 101335, 2023.
X. R. Tao, Q. K. Pan, H. Y. Sang, L. Gao, A. L. Yang, and M. Rong, Nondominated sorting genetic algorithm-II with Q-learning for the distributed permutation flowshop rescheduling problem, Knowl. Based Syst., vol. 278, p. 110880, 2023.
H. Bao, Q. Pan, R. Ruiz, and L. Gao, A collaborative iterated greedy algorithm with reinforcement learning for energy-aware distributed blocking flow-shop scheduling, Swarm Evol. Comput., vol. 83, p. 101399, 2023.
L. Deng, Y. Di, and L. Wang, A reinforcement-learning-based 3-D estimation of distribution algorithm for fuzzy distributed hybrid flow-shop scheduling considering on-time-delivery, IEEE Trans. Cybern., vol. 54, no. 2, pp. 1024–1036, 2024.
Y. Ren, K. Gao, Y. Fu, D. Li, and P. N. Suganthan, Ensemble artificial bee colony algorithm with Q-learning for scheduling bi-objective disassembly line, Appl. Soft Comput., vol. 155, p. 111415, 2024.
D. Yüksel, L. Kandiller, and M. F. Taşgetiren, Q-learning guided algorithms for bi-criteria minimization of total flow time and makespan in no-wait permutation flowshops, Swarm Evol. Comput., vol. 89, p. 101617, 2024.
Z. Lin, K. Gao, N. Wu, and P. N. Suganthan, Problem-specific knowledge based multi-objective meta-heuristics combined Q-learning for scheduling urban traffic lights with carbon emissions, IEEE Trans. Intell. Transp. Syst., vol. 25, no. 10, pp. 15053–15064, 2024.
C. Zhao, L. Wu, C. Zuo, and H. Zhang, An improved fruit fly optimization algorithm with Q-learning for solving distributed permutation flow shop scheduling problems, Complex Intell. Syst., vol. 10, no. 5, pp. 5965–5988, 2024.
B. Zhang, Q. K. Pan, L. Gao, X. Y. Li, L. L. Meng, and K. K. Peng, A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem, Comput. Ind. Eng., vol. 136, pp. 325–344, 2019.