{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T16:00:56Z","timestamp":1774454456771,"version":"3.50.1"},"reference-count":56,"publisher":"Tech Science Press","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMC"],"published-print":{"date-parts":[[2025]]},"DOI":"10.32604\/cmc.2025.065972","type":"journal-article","created":{"date-parts":[[2025,5,26]],"date-time":"2025-05-26T05:18:58Z","timestamp":1748236738000},"page":"2305-2330","source":"Crossref","is-referenced-by-count":1,"title":["Multi-Level Subpopulation-Based Particle Swarm Optimization Algorithm for Hybrid Flow Shop Scheduling Problem with Limited Buffers"],"prefix":"10.32604","volume":"84","author":[{"given":"Yuan","family":"Zou","sequence":"first","affiliation":[]},{"given":"Chao","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Lvjiang","family":"Yin","sequence":"additional","affiliation":[]},{"given":"Xiaoyu","family":"Wen","sequence":"additional","affiliation":[]}],"member":"17807","published-online":{"date-parts":[[2025]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","first-page":"1858","DOI":"10.1007\/s12063-023-00403-x","article-title":"A literature review on applications of Industry 4.0 in project management","volume":"16","author":"Jauhar","year":"2023","journal-title":"Oper Manag Res"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.jmsy.2022.08.003","article-title":"Transfer learning assisted batch optimization of jobs arriving dynamically in manufacturing cloud","volume":"65","author":"Zhou","year":"2022","journal-title":"J Manuf Syst"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"3237","DOI":"10.1111\/itor.13108","article-title":"Shop scheduling in manufacturing environments: a review","volume":"29","author":"M\u00e1rquez","year":"2022","journal-title":"Int Trans Operational Res"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/s10951-023-00795-5","article-title":"A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing","volume":"27","author":"Ostermeier","year":"2024","journal-title":"J Sched"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2206074","DOI":"10.1080\/23311916.2023.2206074","article-title":"A systematic literature review on energy-efficient hybrid flow shop scheduling","volume":"10","author":"Utama","year":"2023","journal-title":"Cogent Eng"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2022.08.009","article-title":"A systematic review of multi-objective hybrid flow shop scheduling","volume":"309","author":"Neufeld","year":"2023","journal-title":"Eur J Oper Res"},{"key":"ref7","first-page":"473","article-title":"Modeling and optimization of the hybrid flow shop scheduling problem with sequence-dependent setup times","volume":"15","author":"Xue","year":"2024","journal-title":"Int J Ind Engi-Neering Comput"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.3390\/pr12010143","article-title":"A sequential hybrid optimization algorithm (SHOA) to solve the hybrid flow shop scheduling problems to minimize carbon footprint","volume":"12","author":"Geetha","year":"2024","journal-title":"Processes"},{"key":"ref9","series-title":"Proceedings of the Companion Conference on Genetic and Evolutionary Computation","first-page":"2250","article-title":"Solving the flow-shop scheduling problem using grover\u2019s algorithm","author":"Saiem","year":"2023 Jul 15\u201319"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.4018\/IJeC.307131","article-title":"Application research of IICA algorithm in a limited-buffer scheduling problem","volume":"18","author":"Duan","year":"2022","journal-title":"Int J E Collab"},{"key":"ref11","first-page":"169","article-title":"Heuristics for flow shop rescheduling with mixed blocking constraints","volume":"32","author":"Tighazoui","year":"2024","journal-title":"Trans Oper Res"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/978-3-031-08623-6_52","author":"Ackermann","year":"2022","journal-title":"Operations research proceedings 2021"},{"key":"ref13","doi-asserted-by":"crossref","first-page":"121667","DOI":"10.1016\/j.eswa.2023.121667","article-title":"A tri-individual iterated greedy algorithm for the distributed hybrid flow shop with blocking","volume":"237","author":"Liu","year":"2024","journal-title":"Expert Syst Appl"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"681","DOI":"10.3390\/pr7100681","article-title":"Flexible flow shop scheduling method with public buffer","volume":"7","author":"Han","year":"2019","journal-title":"Processes"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"18623","DOI":"10.1007\/s00500-023-09086-9","article-title":"Constraint programming models for the hybrid flow shop scheduling problem and its extensions","volume":"27","author":"Isik","year":"2023","journal-title":"Soft Comput"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"106154","DOI":"10.1016\/j.cie.2019.106154","article-title":"Considering stockers in reentrant hybrid flow shop scheduling with limited buffer capacity","volume":"139","author":"Lin","year":"2020","journal-title":"Comput Ind Eng"},{"key":"ref17","first-page":"100514","article-title":"Hybrid flow-shop scheduling in collaborative manufacturing with a multi-crossover-operator genetic algorithm","volume":"36","author":"Guan","year":"2023","journal-title":"J Ind Inf Integr"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"101455","DOI":"10.1016\/j.swevo.2023.101455","article-title":"A two-stage cross-neighborhood search algorithm bridging different solution representation spaces for solving the hybrid flow shop scheduling problem","volume":"84","author":"Kuang","year":"2024","journal-title":"Swarm Evol Comput"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"101479","DOI":"10.1016\/j.swevo.2024.101479","article-title":"MRLM: a meta-reinforcement learning-based metaheuristic for hybrid flow-shop scheduling problem with learning and forgetting effects","volume":"85","author":"Zhang","year":"2024","journal-title":"Swarm Evol Comput"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TSMC.2023.3305089","article-title":"Hybrid flow shop scheduling with learning effects and release dates to minimize the makespan","volume":"54","author":"Wang","year":"2024","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"key":"ref21","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TASE.2023.3346446","article-title":"An attribution feature-based memetic algorithm for hybrid flowshop scheduling problem with operation skipping","volume":"22","author":"Yu","year":"2024","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"117256","DOI":"10.1016\/j.eswa.2022.117256","article-title":"A collaborative iterative greedy algorithm for the scheduling of distributed heterogeneous hybrid flow shop with blocking constraints","volume":"201","author":"Qin","year":"2022","journal-title":"Expert Syst Appl"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"109962","DOI":"10.1016\/j.knosys.2022.109962","article-title":"Intelligent optimization under blocking constraints: a novel iterated greedy algorithm for the hybrid flow shop group scheduling problem","volume":"258","author":"Qin","year":"2022","journal-title":"Knowl Based Syst"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"125026","DOI":"10.1016\/j.eswa.2024.125026","article-title":"Theoretical analysis and implementation of mandatory operations-based accelerated search in graph space for hybrid flow shop scheduling","volume":"257","author":"Wang","year":"2024","journal-title":"Expert Syst Appl"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/j.cor.2013.09.014","article-title":"A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion","volume":"52","author":"Moslehi","year":"2014","journal-title":"Comput Oper Res"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1080\/0951192X.2013.814165","article-title":"An improved particle swarm optimisation with a linearly decreasing disturbance term for flow shop scheduling with limited buffers","volume":"27","author":"Zhao","year":"2014","journal-title":"Int J Comput Integr Manuf"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1007\/s11771-015-2887-x","article-title":"An effective discrete artificial bee colony algorithm for flow shop scheduling problem with intermediate buffers","volume":"22","author":"Zhang","year":"2015","journal-title":"J Cent South Univ"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.asoc.2014.11.022","article-title":"Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system","volume":"28","author":"Abdollahpour","year":"2015","journal-title":"Appl Soft Comput"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"7373617","DOI":"10.1155\/2016\/7373617","article-title":"An enhanced discrete artificial bee colony algorithm to minimize the total flow time in permutation flow shop scheduling with limited buffers","volume":"2016","author":"Deng","year":"2016","journal-title":"Math Probl Eng"},{"key":"ref30","series-title":"2019 IEEE 7th International Conference on Computer Science and Network Technology (ICCSNT)","first-page":"87","article-title":"Flow shop scheduling problem with limited buffer based on hybrid shuffled frog leaping algorithm","author":"Liang","year":"2019 Oct 19\u201320"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1162\/evco_a_00287","article-title":"Iterated local search and other algorithms for buffered two-machine permutation flow shops with constant processing times on one machine","volume":"29","author":"Le","year":"2021","journal-title":"Evol Comput"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"102277","DOI":"10.1016\/j.rcim.2021.102277","article-title":"A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers","volume":"74","author":"Lu","year":"2022","journal-title":"Robot Comput Integr Manuf"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"104951","DOI":"10.1016\/j.cor.2020.104951","article-title":"Improved particle swarm optimization algorithm based novel encoding and decoding schemes for flexible job shop scheduling problem","volume":"121","author":"Ding","year":"2020","journal-title":"Comput Oper Res"},{"key":"ref34","doi-asserted-by":"crossref","first-page":"2873","DOI":"10.1108\/K-06-2019-0430","article-title":"An improved hybrid particle swarm optimization for multi-objective flexible job-shop scheduling problem","volume":"49","author":"Zhang","year":"2019","journal-title":"Kybernetes"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3390\/systems11050221","article-title":"Hybridization of particle swarm optimization with variable neighborhood search and simulated annealing for improved handling of the permutation flow-shop scheduling problem","volume":"11","author":"Hayat","year":"2023","journal-title":"Systems"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18180\/tecciencia.2021.30.1","article-title":"Scheduling of flow shop production systems with particle swarm optimization","volume":"16","author":"Leguizamon","year":"2021","journal-title":"Tecciencia"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"7143","DOI":"10.1007\/s00500-021-05673-w","article-title":"Solution for flow shop scheduling problems using chaotic hybrid firefly and particle swarm optimization algorithm with improved local search","volume":"25","author":"Kaya","year":"2021","journal-title":"Soft Comput"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"108672","DOI":"10.1016\/j.cie.2022.108672","article-title":"A parallel hybrid PSO-GA algorithm for the flexible flow-shop scheduling with transportation","volume":"173","author":"Amirteimoori","year":"2022","journal-title":"Comput Ind Eng"},{"key":"ref39","doi-asserted-by":"crossref","first-page":"8833","DOI":"10.3934\/mbe.2022410","article-title":"Multiobjective particle swarm optimization with direction search and differential evolution for distributed flow-shop scheduling problem","volume":"19","author":"Zhang","year":"2022","journal-title":"Math Biosci Eng"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10845-023-02227-9","article-title":"Q-learning-based multi-objective particle swarm optimization with local search within factories for energy-efficient distributed flow-shop scheduling problem","volume":"36","author":"Zhang","year":"2025","journal-title":"J Intell Manuf"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"2791","DOI":"10.1016\/j.cor.2006.12.013","article-title":"An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers","volume":"35","author":"Liu","year":"2008","journal-title":"Comput Oper Res"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","article-title":"Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm","volume":"316","author":"Li","year":"2015","journal-title":"Inf Sci"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers","volume":"68","author":"Zhang","year":"2021","journal-title":"Robot Comput Integr Manuf"},{"key":"ref44","doi-asserted-by":"crossref","first-page":"104503","DOI":"10.1016\/j.engappai.2021.104503","article-title":"An effective hybrid meta-heuristic for flexible flow shop scheduling with limited buffers and step-deteriorating jobs","volume":"106","author":"Zheng","year":"2021","journal-title":"Eng Appl Artif Intell"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1177\/0037549718809542","article-title":"Stochastic flexible flow shop scheduling problem with limited buffers and fixed interval preventive maintenance: a hybrid approach of simulation and metaheuristic algorithms","volume":"95","author":"Rooeinfar","year":"2019","journal-title":"Simulation"},{"key":"ref46","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1016\/j.asoc.2019.03.054","article-title":"The economic lot scheduling problem in limited-buffer flexible flow shops: mathematical models and a discrete fruit fly algorithm","volume":"80","author":"Zohali","year":"2019","journal-title":"Appl Soft Comput"},{"key":"ref47","doi-asserted-by":"crossref","first-page":"11512","DOI":"10.3390\/app122211512","article-title":"Application of modified steady-state genetic algorithm for batch sizing and scheduling problem with limited buffers","volume":"12","author":"Jane\u0161","year":"2022","journal-title":"Appl Sci"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1007\/s40747-023-01147-8","article-title":"A cooperative adaptive genetic algorithm for reentrant hybrid flow shop scheduling with sequence-dependent setup time and limited buffers","volume":"10","author":"Zheng","year":"2024","journal-title":"Complex Intell Syst"},{"key":"ref49","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1080\/0305215X.2024.2328191","article-title":"Scheduling optimization of flexible flow shop with buffer capacity limitation based on an improved discrete particle swarm optimization algorithm","volume":"57","author":"Chang","year":"2025","journal-title":"Eng Optim"},{"key":"ref50","doi-asserted-by":"crossref","first-page":"8503","DOI":"10.3390\/app12178503","article-title":"Hybrid discrete particle swarm optimization algorithm with genetic operators for target coverage problem in directional wireless sensor networks","volume":"12","author":"Fan","year":"2022","journal-title":"Appl Sci"},{"key":"ref51","doi-asserted-by":"crossref","first-page":"311","DOI":"10.5267\/j.dsl.2021.2.006","article-title":"An improved NEH heuristic to minimize makespan for flow shop scheduling problems","volume":"10","author":"Sharma","year":"2021","journal-title":"Decis Sci Lett"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"104812","DOI":"10.1016\/j.cor.2019.104812","article-title":"An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors\u2014a case study","volume":"114","author":"Marichelvam","year":"2020","journal-title":"Comput Oper Res"},{"key":"ref53","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1007\/s00170-010-3111-7","article-title":"Solving the blocking flow shop scheduling problem by a dynamic multi-swarm particle swarm optimizer","volume":"55","author":"Liang","year":"2011","journal-title":"Int J Adv Manuf Technol"},{"key":"ref54","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","article-title":"Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion","volume":"108","author":"Zhang","year":"2019","journal-title":"Comput Oper Res"},{"key":"ref55","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.3390\/sym15071430","article-title":"Multi-strategy discrete teaching-learning-based optimization algorithm to solve No-wait flow-shop-scheduling problem","volume":"15","author":"Li","year":"2023","journal-title":"Symmetry"},{"key":"ref56","doi-asserted-by":"crossref","first-page":"100992","DOI":"10.1016\/j.swevo.2021.100992","article-title":"An improved iterated greedy algorithm for the energy-efficient blocking hybrid flow shop scheduling problem","volume":"69","author":"Qin","year":"2022","journal-title":"Swarm Evol Comput"}],"container-title":["Computers, Materials & Continua"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/cdn.techscience.cn\/files\/cmc\/2025\/TSP_CMC-84-2\/TSP_CMC_65972\/TSP_CMC_65972.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T01:53:07Z","timestamp":1763344387000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.techscience.com\/cmc\/v84n2\/62927"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":56,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2025]]},"published-print":{"date-parts":[[2025]]}},"URL":"https:\/\/doi.org\/10.32604\/cmc.2025.065972","relation":{},"ISSN":["1546-2226"],"issn-type":[{"value":"1546-2226","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}