The permutation flow shop batch scheduling problem: an improved population-based iterative greedy algorithm with self-adaption and self-viewing

Open Access

Issue		RAIRO-Oper. Res. Volume 60, Number 2, March-April 2026


Page(s)		553 - 575
DOI		https://doi.org/10.1051/ro/2026005
Published online		18 March 2026

C. Rusinko, Green manufacturing: an evaluation of environmentally sustainable manufacturing practices and their impact on competitive outcomes. IEEE. Trans. Eng. Manage. 54 (2007) 445–454. [Google Scholar]
A.M. Deif, A system model for green manufacturing. J. Clean. Prod. 19 (2011) 1553–1559. [Google Scholar]
S.-H. Ahn, An evaluation of green manufacturing technologies based on research databases. Int. J. Precis. Eng. Manuf.-Green Technol. 1 (2014) 5–9. [Google Scholar]
D. Marsetiya Utama and M. Dines Primayesti, A novel hybrid aquila optimizer for energy-efficient hybrid flow shop scheduling. Results Control. Optim. 9 (2022) 100177. [Google Scholar]
L. Xue and X. Wang, A multi-objective discrete differential evolution algorithm for energy-efficient two-stage flow shop scheduling under time-of-use electricity tariffs. Appl. Soft. Comput. 133 (2023) 109946. [Google Scholar]
R.-H. Huang, S.-C. Yu and P.-H. Chen, Energy-saving scheduling in a flexible flow shop using a hybrid genetic algorithm. J. Environ. Prot. 8 (2017) 1037–1056. [Google Scholar]
X. Xin, Q. Jiang, C. Li, S. Li and K. Chen, Permutation flow shop energy-efficient scheduling with a position-based learning effect. Int. J. Prod. Res. 61 (2023) 382–409. [Google Scholar]
Y. Zhou, S. Du, M. Liu and X. Shen, Machine-fixture-pallet resources constrained flexible job shop scheduling considering loading and unloading times under pallet automation system. J. Manuf. Syst. 73 (2024) 143–158. [Google Scholar]
D. Applegate and W. Cook, A computational study of the job-shop scheduling problem. ORSA J. Comput. 3 (1991) 149–156. [Google Scholar]
B. Çalis and S. Bulkan, A research survey: review of ai solution strategies of job shop scheduling problem. J. Intell. Manuf. 26 (2015) 961–973. [Google Scholar]
J. Mark Wilson, Alternative formulations of a flow-shop scheduling problem. J. Oper. Res. Soc. 40 (1989) 395–399. [Google Scholar]
M. Ben-Daya and M. A-Fawzan, A tabu search approach for the flow shop scheduling problem. Eur. J. Oper. Res. 109 (1998) 88–95. [Google Scholar]
C.-F. Liaw. A hybrid genetic algorithm for the open shop scheduling problem. Eur. J. Oper. Res. 124 (2000) 28–42. [Google Scholar]
M. Mahdi Ahmadian, M. Khatami, A. Salehipour and T. Cheng, Four decades of research on the open-shop scheduling problem to minimize the makespan. Eur. J. Oper. Res. 295 (2021) 399–426. [Google Scholar]
O. Shahvari and R. Logendran, Hybrid flow shop batching and scheduling with a bi-criteria objective. Int. J. Prod. Econ. 179 (2016) 239–258. [Google Scholar]
C. Potts and K. Baker, Flow shop scheduling with lot streaming. Oper. res. lett. 8 (1989) 297–303. [Google Scholar]
G. Gong, R. Chiong, Q. Deng, W. Han, L. Zhang, W. Lin and K. Li, Energy-efficient flexible flow shop scheduling with worker flexibility. Expert. Syst. Appl. 141 (2020) 112902. [Google Scholar]
B. Naderi and Rubén Ruiz, A scatter search algorithm for the distributed permutation flowshop scheduling problem. Eur. J. Oper. Res. 239 (2014) 323–334. [Google Scholar]
S. Luo, W. Liang and G. Zhao, Hybrid PSO-WDBA method for the site selection of tailings pond. Comput. Ind. Eng. 143 (2020) 106429. [Google Scholar]
D. Chang, H. Shi, C. Liu and F. Meng, Scheduling optimization of flexible flow shop with buffer capacity limitation based on an improved discrete particle swarm optimization algorithm. Eng. Optim. 57 (2025) 571–597. [Google Scholar]
M. de Fátima Morais, M.H.D.M. Ribeiro, R.G. da Silva, V.C. Mariani and L. dos Santos Coelho, Discrete differential evolution metaheuristics for permutation flow shop scheduling problems. Comput. Ind. Eng. 166 (2022) 107956. [Google Scholar]
X. Zheng, S. Zhou, R. Xu and H. Chen, Energy-efficient scheduling for multi-objective two-stage flow shop using a hybrid ant colony optimisation algorithm. Int. J. Prod. Res. 58 (2020) 4103–4120. [Google Scholar]
A. Kareem Jabari and A. Hasan, Energy-aware scheduling in hybrid flow shop using firefly algorithm. J. Teknik Ind. 22 (2021) 18–30. [Google Scholar]
X. Li, X. Guo, H. Tang, R. Wu and J. Liu, An improved cuckoo search algorithm for the hybrid flow-shop scheduling problem in sand casting enterprises considering batch processing. Comput. Ind. Eng. 176 (2023) 108921. [Google Scholar]
J. Robert Bellabai, B.N. Murugadhas Leela and S.M. Ramesh Kennedy, Testing the performance of bat-algorithm for permutation flow shop scheduling problems with makespan minimization. Braz. Arch. Biol. Tech. 65 (2022) 20210840. [Google Scholar]
F. Zhao, Z. Xu, L. Wang, N. Zhu, T. Xu and J. Jonrinaldi, A population-based iterated greedy algorithm for distributed assembly no-wait flow-shop scheduling problem. IEEE. Trans. Ind. Inf. 19 (2022) 6692–6705. [Google Scholar]
R. Ruiz, Q.-K. Pan and B. Naderi, Iterated greedy methods for the distributed permutation flowshop scheduling problem. Omega 83 (2019) 213–222. [CrossRef] [Google Scholar]
S.-W. Lin, K.-C. Ying and C.-Y. Huang, Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm. Int. J. Prod. Res. 51 (2013) 5029–5038. [Google Scholar]
G.-G. Wang and Y. Tan, Improving metaheuristic algorithms with information feedback models. IEEE. Trans. Cybern. 49 (2017) 542–555. [Google Scholar]
M. Nawaz, E. Emory Enscore Jr. and I. Ham, A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11 (1983) 91–95. [CrossRef] [Google Scholar]
Q. Wu, Q. Gao, W. Liu and N. Shuai Cheng, Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization. Eng. Optim. 55 (2023) 399–415. [Google Scholar]
R. Ruiz, Q.-K. Pan and B. Naderi, Iterated greedy methods for the distributed permutation flowshop scheduling problem. Omega 83 (2019) 213–222. [CrossRef] [Google Scholar]
X.-R. Tao, J.-Q. Li, T.-H. Huang and P. Duan, Discrete imperialist competitive algorithm for the resource-constrained hybrid flowshop problem with energy consumption. Complex Intell. Syst. 7 (2021) 311–326. [Google Scholar]
G. Moslehi and D. Khorasanian, Optimizing blocking flow shop scheduling problem with total completion time criterion. Comput. Oper. Res. 40 (2013) 1874–1883. [Google Scholar]
H.-X. Qin, Y.-Y. Han, B. Zhang, L.-L. Meng, Y.-P. Liu, Q.-K. Pan and D.-W. Gong, An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem. Swarm Evol. Comput. 69 (2022) 100992. [CrossRef] [Google Scholar]
S. Thomas McCormick, M.L. Pinedo, S. Shenker and B. Wolf, Sequencing in an assembly line with blocking to minimize cycle time. Oper. Res. 37 (1989) 925–935. [Google Scholar]
D.P. Ronconi, A note on constructive heuristics for the flowshop problem with blocking. Int. J. Prod. Econ. 87 (2004) 39–48. [Google Scholar]
S. Deb, Z. Tian, S. Fong, R. Tang, R. Wong and N. Dey, Solving permutation flow-shop scheduling problem by rhinoceros search algorithm. Soft Comput. 22 (2018) 6025–6034. [Google Scholar]
J. Gmys, M. Mezmaz, N. Melab and D. Tuyttens, A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem. Eur. J. Oper. Res. 284 (2020) 814–833. [Google Scholar]
M. Abdel-Basset, G. Manogaran, D. El-Shahat and S. Mirjalili, A hybrid whale optimization algorithm based on local search strategy for the permutation flow shop scheduling problem. Future Gener. Comput. Syst. 85 (2018) 129–145. [Google Scholar]
M. Abdel-Basset, R. Mohamed, M. Abouhawwash, R.K. Chakrabortty and M.J. Ryan, A simple and effective approach for tackling the permutation flow shop scheduling problem. Mathematics 9 (2021) 270. [Google Scholar]
N.A. Alawad and B.H. Abed-alguni, Discrete jaya with refraction learning and three mutation methods for the permutation flow shop scheduling problem. J. Supercomput. 78 (2022) 3517–3538. [Google Scholar]
Z. Pan, L. Wang, J. Wang and J. Lu, Deep reinforcement learning based optimization algorithm for permutation flow-shop scheduling. IEEE. Trans. Emerg. Top Comput. Intell. 7 (2021) 983–994. [Google Scholar]
Z. Dong, T. Ren, J. Weng, F. Qi and X. Wang, Minimizing the late work of the flow shop scheduling problem with a deep reinforcement learning based approach. Appl. Sci. 12 (2022) 2366. [Google Scholar]
E.-K. Boukas, A. Haurie and F. Soumis, Hierarchical approach to steel production scheduling under a global energy constraint. Ann. Oper. Res. 26 (1990) 289–311. [Google Scholar]
A. Janiak, Single machine scheduling problem with a common deadline and resource dependent release dates. Eur. J. Oper. Res. 53 (1991) 317–325. [Google Scholar]
C. Lu, L. Gao, X. Li, Q. Pan and Q. Wang, Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm. J. Clean. Prod. 144 (2017) 228–238. [Google Scholar]
X. Xin, Q. Jiang, S. Li, S. Gong and K. Chen, Energy-efficient scheduling for a permutation flow shop with variable transportation time using an improved discrete whale swarm optimization. J. Clean. Prod. 293 (2021) 126121. [Google Scholar]
Y. Fu, G. Tian, A.M. Fathollahi-Fard, A. Ahmadi and C. Zhang, Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint. J. Clean. Prod. 226 (2019) 515–525. [Google Scholar]
M. Feldmann and D. Biskup, Lot streaming in a multiple product permutation flow shop with intermingling. Int. J. Prod. Res. 46 (2008) 197–216. [Google Scholar]
Y. Pan, K. Gao, Z. Li and N. Wu, Improved meta-heuristics for solving distributed lot-streaming permutation flow shop scheduling problems. IEEE. Tran. Autom. Sci. Eng. 20 (2022) 361–371. [Google Scholar]
Q. Feng, Q. Li, W. Quan and X.-M. Pei, Overview of multiobjective particle swarm optimization algorithm. Chin. J. Eng. 43 (2021) 745–753. [Google Scholar]
J. Robert RB and R. Rajkumar, An effective genetic algorithm for flow shop scheduling problems to minimize makespan. Mechanics 23 (2017) 594–603. [Google Scholar]
Z. Woo Geem, J. Hoon Kim and G. Vasudevan Loganathan, A new heuristic optimization algorithm: harmony search. Simulation 76 (2001) 60–68. [CrossRef] [Google Scholar]
E. Kaya, B. Gorkemli, B. Akay and D. Karaboga, A review on the studies employing artificial bee colony algorithm to solve combinatorial optimization problems. Eng. Appl. Artif. Intell. 115 (2022) 105311. [Google Scholar]
E.H. Houssein, A.G. Gad and Y.M. Wazery, Jaya algorithm and applications: a comprehensive review. Metaheuristics Optim. Comput. Electr. Eng. (2021) 3–24. [Google Scholar]
W. Wang, Z. Xu and X. Gu, A two-stage discrete water wave optimization algorithm for the flowshop lot-streaming scheduling problem with intermingling and variable lot sizes. Knowl.-Based Syst. 238 (2022) 107874. [Google Scholar]
Q.-K. Pan and R. Ruiz, An estimation of distribution algorithm for lot-streaming flow shop problems with setup times. Omega 40 (2012) 166–180. [Google Scholar]
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. 29 (2018) 891–904. [Google Scholar]
S.K. Paul and A. Azeem, Minimization of work in process inventory in hybrid flow shop scheduling using fuzzy logic. Int. J. Ind. Eng. Theory Appl. Pract. 17 (2010) 115–127. [Google Scholar]
W. Shao, D. Pi and Z. Shao, 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 (2019) 1344–1360. [Google Scholar]
B. Farooq, J. Bao and Q. Ma, Flow-shop predictive modeling for multi-automated guided vehicles scheduling in smart spinning cyber-physical production systems. Electronics 9 (2020) 799. [Google Scholar]
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. 75 (2019) 728–749. [Google Scholar]
L. Yin, X. Li, L. Gao, C. Lu and Z. Zhang, A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustain. Comput. Inf. Syst. 13 (2017) 15–30. [Google Scholar]
R. Puka, J. Duda, A. Stawowy and I. Skalna, N-NEH+ algorithm for solving permutation flow shop problems. Comput. Oper. Res. 132 (2021) 105296. [Google Scholar]
X. Dong, H. Huang and P. Chen, An improved NEH-based heuristic for the permutation flowshop problem. Comput. Oper. Res. 35 (2008) 3962–3968. [CrossRef] [Google Scholar]
W. Liu, Y. Jin and M. Price, A new Nawaz-Enscore-Ham-based heuristic for permutation flow-shop problems with bicriteria of makespan and machine idle time. Eng. Optim. 48 (2016) 1808–1822. [Google Scholar]
Q. Wu, Q. Gao, W. Liu and S. Cheng, Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization. Eng. Optim. 55 (2023) 399–415. [Google Scholar]
R. Ruiz and T. Stützle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177 (2007) 2033–2049. [CrossRef] [Google Scholar]
J.-P. Huang, Q.-K. Pan and L. Gao, An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm Evol. Comput. 59 (2020) 100742. [Google Scholar]
J. Zhang, C. Wang and D. Song, A new hybrid iterated greedy algorithm for the distributed permutation flowshop scheduling problem. IEEE Access 8 (2020) 152509–152520. [Google Scholar]
Q.-K. Pan, L. Wang, M. Han and H.-J. Zhou, A novel discrete artificial bee colony algorithm for the distributed flow shop scheduling problem. IEEE Trans. Cybern. 51 (2021) 4313–4325. [Google Scholar]
Z. Liao, X. Li, L. Gao and C. Lu, A self-adaptive multi-objective neighborhood search algorithm for the energy-efficient flexible job shop scheduling problem. IEEE Trans. Autom. Sci. Eng. 18 (2021) 1854–1869. [Google Scholar]
Y. Wang, J. Li, T. Huang and P. Duan, A hybrid artificial bee colony algorithm for the distributed heterogeneous hybrid flow shop scheduling problem. Swarm Evol. Comput. 58 (2020) 100744. [Google Scholar]
H. Li, Y. Gao, W. Zhang and S. Li, Improved discrete bacterial foraging algorithm for blocking flow shop scheduling problem. Control Eng. Chin. 27 (2020) 288. [Google Scholar]
A. Agárdi, K. Nehéz, O. Hornyák and L.T. Kóczy, A hybrid discrete bacterial memetic algorithm with simulated annealing for optimization of the flow shop scheduling problem. Symmetry 13 (2021) 1131. [Google Scholar]
F. Wang, Y. Rao, Q. Tang, X. He and L. Zhang, Fast construction method of pareto non-dominated solution for multi-objective decision-making problem. J. Syst. Eng. Theor. Pract. 36 (2016) 454–463. [Google Scholar]
J.S. Neufeld, S. Schulz and U. Buscher, A systematic review of multi-objective hybrid flow shop scheduling. Eur. J. Oper. Res. 309 (2023) 1–23. [Google Scholar]
Y. Hu, J. Peng, J. Ou, Y. Li, J. Zheng, J. Zou, S. Jiang, S. Yang and J. Li, The IGD-based prediction strategy for dynamic multi-objective optimization. Swarm Evol. Comput. 91 (2024) 101713. [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.