{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T06:17:06Z","timestamp":1783664226869,"version":"3.55.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:00:00Z","timestamp":1783641600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T00:00:00Z","timestamp":1783641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Projects of International Cooperation and Exchanges NSFC","award":["W2411063"],"award-info":[{"award-number":["W2411063"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["72371095"],"award-info":[{"award-number":["72371095"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2026,9]]},"DOI":"10.1007\/s12293-026-00519-0","type":"journal-article","created":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T05:48:33Z","timestamp":1783662513000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Serial-batching scheduling in a fuzzy manufacturing system using a hybrid particle swarm optimization algorithm"],"prefix":"10.1007","volume":"18","author":[{"given":"Wei","family":"Ding","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaojun","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yonghuang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Cheng","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinbao","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,10]]},"reference":[{"key":"519_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.cie.2018.05.056","volume":"122","author":"K Peng","year":"2018","unstructured":"Peng K, Pan Q-K, Gao L, Zhang B, Pang X (2018) An improved artificial bee colony algorithm for real-world hybrid flowshop rescheduling in steelmaking-refining-continuous casting process. Computers & Industrial Engineering 122:235\u2013250","journal-title":"Computers & Industrial Engineering"},{"key":"519_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1016\/S0377-2217(99)00380-X","volume":"124","author":"L Tang","year":"2000","unstructured":"Tang L, Liu J, Rong A, Yang Z (2000) A multiple traveling salesman problem model for hot rolling scheduling in shanghai baoshan iron & steel complex. Eur J Oper Res 124:267\u2013282","journal-title":"Eur J Oper Res"},{"key":"519_CR3","doi-asserted-by":"crossref","unstructured":"Pei J, Song Q, Liao B, Liu X, Pardalos PM (2020) Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration. Ann Oper Res 1\u201338","DOI":"10.1007\/s10479-020-03555-2"},{"key":"519_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D Biskup","year":"1999","unstructured":"Biskup D (1999) Single-machine scheduling with learning considerations. Eur J Oper Res 115:173\u2013178","journal-title":"Eur J Oper Res"},{"key":"519_CR5","doi-asserted-by":"publisher","first-page":"2097","DOI":"10.1080\/00207721003718436","volume":"42","author":"V Mani","year":"2011","unstructured":"Mani V, Chang P, Chen S (2011) Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis. Int J Syst Sci 42:2097\u20132102","journal-title":"Int J Syst Sci"},{"key":"519_CR6","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S Browne","year":"1990","unstructured":"Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495\u2013498","journal-title":"Oper Res"},{"key":"519_CR7","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/0377-2217(90)90089-T","volume":"47","author":"AS Kunnathur","year":"1990","unstructured":"Kunnathur AS, Gupta SK (1990) Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem. Eur J Oper Res 47:56\u201364","journal-title":"Eur J Oper Res"},{"key":"519_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.ins.2003.05.012","volume":"166","author":"J Peng","year":"2004","unstructured":"Peng J, Liu B (2004) Parallel machine scheduling models with fuzzy processing times. Inf Sci 166:49\u201366","journal-title":"Inf Sci"},{"key":"519_CR9","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.ins.2011.04.010","volume":"181","author":"S Balin","year":"2011","unstructured":"Balin S (2011) Parallel machine scheduling with fuzzy processing times using a robust genetic algorithm and simulation. Inf Sci 181:3551\u20133569","journal-title":"Inf Sci"},{"key":"519_CR10","doi-asserted-by":"crossref","unstructured":"Zhao F, Du Y, Zhuang C, Wang L, Yu Y (2025) An iterative greedy algorithm for solving a multiobjective distributed assembly flexible job shop scheduling problem with fuzzy processing time. IEEE Transactions on Cybernetics","DOI":"10.1109\/TCYB.2025.3538007"},{"key":"519_CR11","doi-asserted-by":"publisher","first-page":"1459","DOI":"10.1007\/s00500-023-08342-2","volume":"28","author":"M Jim\u00e9nez Tovar","year":"2024","unstructured":"Jim\u00e9nez Tovar M, Acevedo-Chedid J, Ospina-Mateus H, Salas-Navarro K, Sana SS (2024) An optimization algorithm for the multi-objective flexible fuzzy job shop environment with partial flexibility based on adaptive teaching-learning considering fuzzy processing times. Soft Comput 28:1459\u20131489","journal-title":"Soft Comput"},{"key":"519_CR12","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1080\/00207543.2022.2049911","volume":"61","author":"J Pei","year":"2023","unstructured":"Pei J, Zhou Y, Yan P, Pardalos PM (2023) A concise guide to scheduling with learning and deteriorating effects. Int J Prod Res 61:2010\u20132031","journal-title":"Int J Prod Res"},{"key":"519_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.cie.2011.03.008","volume":"61","author":"W Kuo","year":"2011","unstructured":"Kuo W, Hsu C, Yang D (2011) Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects. Computers & Industrial Engineering 61:179\u2013183","journal-title":"Computers & Industrial Engineering"},{"key":"519_CR14","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/j.cie.2016.05.001","volume":"97","author":"C Wang","year":"2016","unstructured":"Wang C, Liu C, Zhang Z-H, Zheng L (2016) Minimizing the total completion time for parallel machine scheduling with job splitting and learning. Computers & Industrial Engineering 97:170\u2013182","journal-title":"Computers & Industrial Engineering"},{"key":"519_CR15","doi-asserted-by":"publisher","first-page":"2010","DOI":"10.1080\/00207543.2022.2049911","volume":"61","author":"J Pei","year":"2023","unstructured":"Pei J, Zhou Y, Yan P, Pardalos PM (2023) A concise guide to scheduling with learning and deteriorating effects. Int J Prod Res 61:2010\u20132031","journal-title":"Int J Prod Res"},{"key":"519_CR16","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1080\/0305215X.2024.2372633","volume":"57","author":"D-Y Lv","year":"2025","unstructured":"Lv D-Y, Wang J-B (2025) Research on two-machine flow shop scheduling problem with release dates and truncated learning effects. Eng Optim 57:1828\u20131848","journal-title":"Eng Optim"},{"key":"519_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.apm.2017.07.028","volume":"58","author":"J Pei","year":"2018","unstructured":"Pei J, Liu X, Liao B, Pardalos PM, Kong M (2018) Single-machine scheduling with learning effect and resource-dependent processing times in the serial-batching production. Appl Math Model 58:245\u2013253","journal-title":"Appl Math Model"},{"key":"519_CR18","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10479-017-2481-8","volume":"272","author":"J Pei","year":"2019","unstructured":"Pei J, Cheng B, Liu X, Pardalos PM, Kong M (2019) Single-machine and parallel-machine serial-batching scheduling problems with position-based learning effect and linear setup time. Ann Oper Res 272:217\u2013241","journal-title":"Ann Oper Res"},{"key":"519_CR19","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1080\/10170669.2012.737374","volume":"29","author":"H Lee","year":"2012","unstructured":"Lee H, Yang S (2012) Parallel machines scheduling with deterioration effects and resource allocations. Journal of the Chinese Institute of Industrial Engineers 29:534\u2013543","journal-title":"Journal of the Chinese Institute of Industrial Engineers"},{"key":"519_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2024.110599","volume":"197","author":"D-Y Lv","year":"2024","unstructured":"Lv D-Y, Wang J-B (2024) Considering the peak power consumption problem with learning and deterioration effect in flow shop scheduling. Computers & Industrial Engineering 197:110599","journal-title":"Computers & Industrial Engineering"},{"key":"519_CR21","doi-asserted-by":"publisher","first-page":"2527","DOI":"10.1007\/s12190-024-02306-x","volume":"71","author":"X-Y Qiu","year":"2025","unstructured":"Qiu X-Y, Wang J-B (2025) Single-machine scheduling with mixed due-windows and deterioration effects. J Appl Math Comput 71:2527\u20132542","journal-title":"J Appl Math Comput"},{"key":"519_CR22","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/s10479-015-1824-6","volume":"249","author":"J Pei","year":"2017","unstructured":"Pei J, Liu X, Pardalos PM, Fan W, Yang S (2017) Scheduling deteriorating jobs on a single serial-batching machine with multiple job types and sequence-dependent setup times. Ann Oper Res 249:175\u2013195","journal-title":"Ann Oper Res"},{"key":"519_CR23","doi-asserted-by":"crossref","unstructured":"Shen J (2019) An uncertain parallel machine problem with deterioration and learning effect. Comput Appl Math 38:","DOI":"10.1007\/s40314-019-0789-5"},{"key":"519_CR24","unstructured":"Mir J, Rezaeian M, Mohamadian H (2019) Scheduling parallel machine problem under general effects of deterioration and learning with past-sequence-dependent setup time: heuristic and meta-heuristic approaches. Soft Comput 1\u201321"},{"key":"519_CR25","doi-asserted-by":"publisher","first-page":"7619","DOI":"10.1080\/00207543.2024.2323065","volume":"62","author":"K Li","year":"2024","unstructured":"Li K, Xu L, Zhang H, Chen J (2024) A genetic algorithm for fuzzy identical parallel machine scheduling of minimising total weighted tardiness under resource constraint. Int J Prod Res 62:7619\u20137643","journal-title":"Int J Prod Res"},{"key":"519_CR26","doi-asserted-by":"publisher","first-page":"548","DOI":"10.1016\/j.asoc.2018.11.027","volume":"75","author":"Z Jia","year":"2019","unstructured":"Jia Z, Yan J, Leung JY, Li K, Chen H (2019) Ant colony optimization algorithm for scheduling jobs with fuzzy processing time on parallel batch machines with different capacities. Appl Soft Comput 75:548\u2013561","journal-title":"Appl Soft Comput"},{"key":"519_CR27","doi-asserted-by":"crossref","unstructured":"Chang Z, Ding JY, Song S (2019) Distributionally robust scheduling on parallel machines under moment uncertainty. Eur J Oper Res 272:832\u2013846","DOI":"10.1016\/j.ejor.2018.07.007"},{"key":"519_CR28","doi-asserted-by":"publisher","first-page":"5131","DOI":"10.1080\/00207543.2021.1951446","volume":"60","author":"C Gahm","year":"2022","unstructured":"Gahm C, Wahl S, Tuma A (2022) Scheduling parallel serial-batch processing machines with incompatible job families, sequence-dependent setup times and arbitrary sizes. Int J Prod Res 60:5131\u20135154","journal-title":"Int J Prod Res"},{"key":"519_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2024.109865","volume":"141","author":"S Lu","year":"2025","unstructured":"Lu S, Hu C, Kong M, Fathollahi-Fard AM, Wu B (2025) A modified adaptive large neighborhood search algorithm for serial-batching machines scheduling considering changeover time and rate-modifying activities. Eng Appl Artif Intell 141:109865","journal-title":"Eng Appl Artif Intell"},{"key":"519_CR30","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.omega.2017.12.003","volume":"82","author":"J Pei","year":"2019","unstructured":"Pei J, Liu X, Fan W, Pardalos PM, Lu S (2019) A hybrid ba-vns algorithm for coordinated serial-batching scheduling with deteriorating jobs, financial budget, and resource constraint in multiple manufacturers. Omega 82:55\u201369","journal-title":"Omega"},{"key":"519_CR31","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1016\/j.ejor.2022.09.006","volume":"306","author":"DB Fontes","year":"2023","unstructured":"Fontes DB, Homayouni SM, Gon\u00e7alves JF (2023) A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources. Eur J Oper Res 306:1140\u20131157","journal-title":"Eur J Oper Res"},{"key":"519_CR32","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.jmsy.2024.02.007","volume":"73","author":"Y Xu","year":"2024","unstructured":"Xu Y, Zhang M, Yang M, Wang D (2024) Hybrid quantum particle swarm optimization and variable neighborhood search for flexible job-shop scheduling problem. J Manuf Syst 73:334\u2013348","journal-title":"J Manuf Syst"},{"key":"519_CR33","doi-asserted-by":"crossref","unstructured":"Li X, Gao L, Wang W, Wang C, Wen L (2019) Particle swarm optimization hybridized with genetic algorithm for uncertain integrated process planning and scheduling with interval processing time, Computers & Industrial Engineering","DOI":"10.1016\/j.cie.2019.04.028"},{"key":"519_CR34","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"LA Zadeh","year":"1965","unstructured":"Zadeh LA (1965) Fuzzy sets. Inf Control 8:338\u2013353","journal-title":"Inf Control"},{"key":"519_CR35","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11590-010-0253-3","volume":"6","author":"J Wang","year":"2012","unstructured":"Wang J, Wang M (2012) Single-machine scheduling with nonlinear deterioration. Optimization Letters 6:87\u201398","journal-title":"Optimization Letters"},{"key":"519_CR36","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1016\/j.eswa.2018.08.024","volume":"115","author":"FL Biajoli","year":"2019","unstructured":"Biajoli FL, Chaves AA, Lorena LAN (2019) A biased random-key genetic algorithm for the two-stage capacitated facility location problem. Expert Syst Appl 115:418\u2013426","journal-title":"Expert Syst Appl"},{"key":"519_CR37","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1504\/IJSOM.2019.097040","volume":"32","author":"AN Balaji","year":"2019","unstructured":"Balaji AN, Porselvi S, Jawahar N (2019) Particle swarm optimisation algorithm and multi-start simulated annealing algorithm for scheduling batches of parts in multi-cell flexible manufacturing system. International Journal of Services and Operations Management 32:83\u2013129","journal-title":"International Journal of Services and Operations Management"},{"key":"519_CR38","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00500-017-2547-1","volume":"22","author":"Y Xue","year":"2018","unstructured":"Xue Y, Jiang J, Zhao B, Ma T (2018) A self-adaptive artificial bee colony algorithm based on global best for global optimization. Soft Comput 22:2935\u20132952","journal-title":"Soft Comput"},{"key":"519_CR39","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s10462-011-9276-0","volume":"39","author":"P Civicioglu","year":"2013","unstructured":"Civicioglu P, Besdok E (2013) A conceptual comparison of the cuckoo-search, particle swarm optimization, differential evolution and artificial bee colony algorithms. Artif Intell Rev 39:315\u2013346","journal-title":"Artif Intell Rev"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00519-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-026-00519-0","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-026-00519-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T05:48:36Z","timestamp":1783662516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-026-00519-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7,10]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,9]]}},"alternative-id":["519"],"URL":"https:\/\/doi.org\/10.1007\/s12293-026-00519-0","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7,10]]},"assertion":[{"value":"18 September 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 June 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"34"}}