{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T18:11:30Z","timestamp":1783620690894,"version":"3.55.0"},"reference-count":62,"publisher":"Springer Science and Business Media LLC","issue":"17-18","license":[{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T00:00:00Z","timestamp":1720656000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51705428"],"award-info":[{"award-number":["51705428"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s00500-024-09763-3","type":"journal-article","created":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T09:01:48Z","timestamp":1720688508000},"page":"9521-9545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["An enhanced teaching\u2013learning-based optimization for the flexible job shop scheduling problem considering worker behaviours"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9738-2428","authenticated-orcid":false,"given":"Zongyan","family":"Cai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mengke","family":"Sun","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tianyu","family":"Yan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haonan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xinping","family":"Tian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,7,11]]},"reference":[{"key":"9763_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10479-019-03196-0","volume":"291","author":"JL Andrade-Pineda","year":"2020","unstructured":"Andrade-Pineda JL, Canca D, Gonzalez PL, Calle M (2020) Scheduling a dual-resource flexible job shop with makespan and due date-related criteria. Ann Oper Res 291:5\u201335. https:\/\/doi.org\/10.1007\/s10479-019-03196-0","journal-title":"Ann Oper Res"},{"key":"9763_CR2","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1080\/0951192x.2013.834465","volume":"27","author":"MET Araghi","year":"2014","unstructured":"Araghi MET, Jolai F, Rabiee M (2014) Incorporating learning effect and deterioration for solving a sdst flexible job-shop scheduling problem with a hybrid meta-heuristic approach. Int J Comput Integr Manuf 27:733\u2013746. https:\/\/doi.org\/10.1080\/0951192x.2013.834465","journal-title":"Int J Comput Integr Manuf"},{"key":"9763_CR3","unstructured":"Bautista J, Alfaro R, Batalla C, Cano A (2013) Incorporating the work pace concept into the mmsp-w (first version). In: 7th International Conference on Industrial Engineering and Industrial Management-XVII Congreso de Ingenier\u00eda de Organizaci\u00f3n (CIO 2013) \u00b7 XIX International Conference on Industrial Engineering and Operations Management (ICIEOM). Province of Valladolid, pp 427\u2013435"},{"key":"9763_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijpe.2021.108151","volume":"237","author":"N Berti","year":"2021","unstructured":"Berti N, Finco S, Battaia O, Delorme X (2021) Ageing workforce effects in dual-resource constrained job-shop scheduling. Int J Prod Econ 237:108151. https:\/\/doi.org\/10.1016\/j.ijpe.2021.108151","journal-title":"Int J Prod Econ"},{"key":"9763_CR5","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. https:\/\/doi.org\/10.1016\/s0377-2217(98)00246-x","journal-title":"Eur J Oper Res"},{"key":"9763_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/bf02023073","volume":"41","author":"P Brandimarte","year":"1993","unstructured":"Brandimarte P (1993) Routing and scheduling in a flexible job shop by tabu search. Ann Oper Res 41:157\u2013183. https:\/\/doi.org\/10.1007\/bf02023073","journal-title":"Ann Oper Res"},{"key":"9763_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2020.106863","volume":"149","author":"RH Caldeira","year":"2020","unstructured":"Caldeira RH, Gnanavelbabu A, Vaidyanathan T (2020) An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption. Comput Ind Eng 149:106863. https:\/\/doi.org\/10.1016\/j.cie.2020.106863","journal-title":"Comput Ind Eng"},{"key":"9763_CR8","doi-asserted-by":"publisher","first-page":"1113","DOI":"10.1057\/palgrave.jors.2602095","volume":"57","author":"P Chen","year":"2006","unstructured":"Chen P, Wu CC, Lee WC (2006) A bi-criteria two-machine flowshop scheduling problem with a learning effect. J Oper Res Soc 57:1113\u20131125. https:\/\/doi.org\/10.1057\/palgrave.jors.2602095","journal-title":"J Oper Res Soc"},{"key":"9763_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10710-005-6164-x","volume":"6","author":"CA Coello Coello","year":"2005","unstructured":"Coello Coello CA, Cruz Cortes N (2005) Solving multiobjective optimization problems using an artificial immune system. Genet Program Evolvable Mach 6:163\u2013190. https:\/\/doi.org\/10.1007\/s10710-005-6164-x","journal-title":"Genet Program Evolvable Mach"},{"key":"9763_CR10","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3208942","author":"Y Du","year":"2022","unstructured":"Du Y, Li JQ, Li CD, Duan PY (2022) A reinforcement learning approach for flexible job shop scheduling problem with crane transportation and setup times. IEEE Trans Neural Netw Learn Syst. https:\/\/doi.org\/10.1109\/tnnls.2022.3208942","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"9763_CR11","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1109\/tetci.2022.3145706","volume":"7","author":"Y Du","year":"2023","unstructured":"Du Y, Li JQ, Chen XL, Duan PY, Pan QK (2023) Knowledge-based reinforcement learning and estimation of distribution algorithm for flexible job shop scheduling problem. IEEE Trans Emerg Topics Comput Intell 7:1036\u20131050. https:\/\/doi.org\/10.1109\/tetci.2022.3145706","journal-title":"IEEE Trans Emerg Topics Comput Intell"},{"key":"9763_CR12","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1080\/09537289008919318","volume":"1","author":"SE Elmaghraby","year":"1990","unstructured":"Elmaghraby SE (1990) Economic manufacturing quantities under conditions of learning and forgetting (EMQ\/LaF). Prod Plan Control 1:196\u2013208. https:\/\/doi.org\/10.1080\/09537289008919318","journal-title":"Prod Plan Control"},{"key":"9763_CR13","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.jmsy.2021.05.018","volume":"60","author":"JX Fan","year":"2021","unstructured":"Fan JX, Shen WM, Gao L, Zhang CJ, Zhang Z (2021) A hybrid jaya algorithm for solving flexible job shop scheduling problem considering multiple critical paths. J Manuf Syst 60:298\u2013311. https:\/\/doi.org\/10.1016\/j.jmsy.2021.05.018","journal-title":"J Manuf Syst"},{"key":"9763_CR14","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.engstruct.2015.10.039","volume":"106","author":"M Farshchin","year":"2016","unstructured":"Farshchin M, Camp CV, Maniat M (2016) Multi-class teaching-learning-based optimization for truss design with frequency constraints. Eng Struct 106:355\u2013369. https:\/\/doi.org\/10.1016\/j.engstruct.2015.10.039","journal-title":"Eng Struct"},{"key":"9763_CR15","doi-asserted-by":"publisher","first-page":"53429","DOI":"10.1109\/access.2019.2911028","volume":"7","author":"YP Fu","year":"2019","unstructured":"Fu YP, Zhou MC, Guo XW, Qi L (2019) Artificial-molecule-based chemical reaction optimization for flow shop scheduling problem with deteriorating and learning effects. IEEE Access 7:53429\u201353440. https:\/\/doi.org\/10.1109\/access.2019.2911028","journal-title":"IEEE Access"},{"key":"9763_CR16","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1108\/eb054802","volume":"7","author":"S Globerson","year":"1987","unstructured":"Globerson S, Levin N (1987) Incorporating forgetting into learning curves. Int J Oper Prod Man 7:80\u201394","journal-title":"Int J Oper Prod Man"},{"key":"9763_CR17","doi-asserted-by":"publisher","first-page":"2506","DOI":"10.1080\/00207543.2017.1388933","volume":"56","author":"XR Gong","year":"2018","unstructured":"Gong XR, Deng QW, Gong GL, Liu W, Ren QH (2018) A memetic algorithm for multi-objective flexible job-shop problem with worker flexibility. Int J Prod Res 56:2506\u20132522. https:\/\/doi.org\/10.1080\/00207543.2017.1388933","journal-title":"Int J Prod Res"},{"key":"9763_CR18","doi-asserted-by":"publisher","first-page":"4406","DOI":"10.1080\/00207543.2019.1653504","volume":"58","author":"GL Gong","year":"2020","unstructured":"Gong GL, Chiong R, Deng QW, Gong XR (2020) A hybrid artificial bee colony algorithm for flexible job shop scheduling with worker flexibility. Int J Prod Res 58:4406\u20134420. https:\/\/doi.org\/10.1080\/00207543.2019.1653504","journal-title":"Int J Prod Res"},{"key":"9763_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/s23010090","volume":"23","author":"Z He","year":"2023","unstructured":"He Z, Tang B, Luan F (2023) An improved African vulture optimization algorithm for dual-resource constrained multi-objective flexible job shop scheduling problems. Sensors 23:1\u201390. https:\/\/doi.org\/10.3390\/s23010090","journal-title":"Sensors"},{"key":"9763_CR20","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/0307-904x(95)00157-f","volume":"20","author":"MY Jaber","year":"1996","unstructured":"Jaber MY, Bonney M (1996) Production breaks and the learning curve: The forgetting phenomenon. Appl Math Modell 20:162\u2013169. https:\/\/doi.org\/10.1016\/0307-904x(95)00157-f","journal-title":"Appl Math Modell"},{"key":"9763_CR21","doi-asserted-by":"publisher","first-page":"7287","DOI":"10.1016\/j.apm.2013.02.028","volume":"37","author":"MY Jaber","year":"2013","unstructured":"Jaber MY, Givi ZS, Neumann WP (2013) Incorporating human fatigue and recovery into the learning-forgetting process. Appl Math Modell 37:7287\u20137299. https:\/\/doi.org\/10.1016\/j.apm.2013.02.028","journal-title":"Appl Math Modell"},{"key":"9763_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106317","volume":"123","author":"SR Kamali","year":"2023","unstructured":"Kamali SR, Banirostam T, Motameni H, Teshnehlab M (2023) An immune-based multi-agent system for flexible job shop scheduling problem in dynamic and multi-objective environments. Eng Appl Artif Intell 123:106317. https:\/\/doi.org\/10.1016\/j.engappai.2023.106317","journal-title":"Eng Appl Artif Intell"},{"key":"9763_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/s0169-8141(97)00069-3","volume":"22","author":"S Konz","year":"1998","unstructured":"Konz S (1998) Work\/rest: part II\u2014the scientific basis (knowledge base) for the guide. Int J Ind Ergonom 22:73\u201399. https:\/\/doi.org\/10.1016\/s0169-8141(97)00069-3","journal-title":"Int J Ind Ergonom"},{"key":"9763_CR24","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.eswa.2017.02.004","volume":"77","author":"P Korytkowski","year":"2017","unstructured":"Korytkowski P (2017) Competences-based performance model of multi-skilled workers with learning and forgetting. Expert Syst Appl 77:226\u2013235. https:\/\/doi.org\/10.1016\/j.eswa.2017.02.004","journal-title":"Expert Syst Appl"},{"key":"9763_CR25","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/s0925-5273(03)00179-8","volume":"88","author":"WC Lee","year":"2004","unstructured":"Lee WC, Wu CC (2004) Minimizing total completion time in a two-machine flowshop with a learning effect. Int J Prod Econ 88:85\u201393. https:\/\/doi.org\/10.1016\/s0925-5273(03)00179-8","journal-title":"Int J Prod Econ"},{"key":"9763_CR26","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/tem.2017.2774281","volume":"65","author":"DM Lei","year":"2018","unstructured":"Lei DM, Gao L, Zheng YL (2018) A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop. IEEE Trans Eng Manage 65:330\u2013340. https:\/\/doi.org\/10.1109\/tem.2017.2774281","journal-title":"IEEE Trans Eng Manage"},{"key":"9763_CR27","doi-asserted-by":"publisher","first-page":"7232","DOI":"10.1080\/00207543.2020.1836422","volume":"59","author":"DM Lei","year":"2021","unstructured":"Lei DM, Su B, Li M (2021) Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling. Int J Prod Res 59:7232\u20137245. https:\/\/doi.org\/10.1080\/00207543.2020.1836422","journal-title":"Int J Prod Res"},{"key":"9763_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117796","volume":"205","author":"K Lei","year":"2022","unstructured":"Lei K, Guo P, Zhao W, Wang Y, Qian L, Meng X, Tang L (2022) A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst Appl 205:117796. https:\/\/doi.org\/10.1016\/j.eswa.2022.117796","journal-title":"Expert Syst Appl"},{"key":"9763_CR29","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/j.cie.2011.04.021","volume":"61","author":"DC Li","year":"2011","unstructured":"Li DC, Hsu PH, Wu CC, Cheng TCE (2011) Two-machine flowshop scheduling with truncated learning to minimize the total completion time. Comput Ind Eng 61:655\u2013662. https:\/\/doi.org\/10.1016\/j.cie.2011.04.021","journal-title":"Comput Ind Eng"},{"key":"9763_CR30","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.ijpe.2012.10.015","volume":"142","author":"G Li","year":"2013","unstructured":"Li G, Wang XY, Wang JB, Sun LY (2013) Worst case analysis of flow shop scheduling problems with a time-dependent learning effect. Int J Prod Econ 142:98\u2013104. https:\/\/doi.org\/10.1016\/j.ijpe.2012.10.015","journal-title":"Int J Prod Econ"},{"key":"9763_CR31","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106544","volume":"95","author":"YB Li","year":"2020","unstructured":"Li YB, Huang WX, Wu R, Guo K (2020) An improved artificial bee colony algorithm for solving multi-objective low-carbon flexible job shop scheduling problem. Appl Soft Comput 95:106544. https:\/\/doi.org\/10.1016\/j.asoc.2020.106544","journal-title":"Appl Soft Comput"},{"key":"9763_CR32","doi-asserted-by":"publisher","first-page":"10721","DOI":"10.1109\/tcyb.2021.3069184","volume":"52","author":"WF Li","year":"2022","unstructured":"Li WF, He LJ, Cao YL (2022) Many-objective evolutionary algorithm with reference point-based fuzzy correlation entropy for energy-efficient job shop scheduling with limited workers. IEEE Trans Cybern 52:10721\u201310734. https:\/\/doi.org\/10.1109\/tcyb.2021.3069184","journal-title":"IEEE Trans Cybern"},{"key":"9763_CR33","doi-asserted-by":"publisher","DOI":"10.1109\/tase.2023.3300922","author":"JQ Li","year":"2023","unstructured":"Li JQ, Han YY, Gao KZ, Xiao XM, Duan PY (2023) Bi-population balancing multi-objective algorithm for fuzzy flexible job shop with energy and transportation. IEEE Trans Autom Sci Eng. https:\/\/doi.org\/10.1109\/tase.2023.3300922","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"9763_CR34","doi-asserted-by":"publisher","first-page":"106352","DOI":"10.1109\/access.2021.3098823","volume":"9","author":"X Liang","year":"2021","unstructured":"Liang X, Chen JB, Gu XL, Huang M (2021) Improved adaptive non-dominated sorting genetic algorithm with elite strategy for solving multi-objective flexible job-shop scheduling problem. IEEE Access 9:106352\u2013106362. https:\/\/doi.org\/10.1109\/access.2021.3098823","journal-title":"IEEE Access"},{"key":"9763_CR35","doi-asserted-by":"publisher","first-page":"3659","DOI":"10.1109\/tase.2021.3129439","volume":"19","author":"CR Lin","year":"2022","unstructured":"Lin CR, Cao ZC, Zhou MC (2022) Learning-based grey wolf optimizer for stochastic flexible job shop scheduling. IEEE Trans Autom Sci Eng 19:3659\u20133671. https:\/\/doi.org\/10.1109\/tase.2021.3129439","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"9763_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/app12010205","volume":"12","author":"CP Liu","year":"2022","unstructured":"Liu CP, Yao YY, Zhu HB (2022) Hybrid salp swarm algorithm for solving the green scheduling problem in a double-flexible job shop. Appl Sci-Basel 12:1\u2013205. https:\/\/doi.org\/10.3390\/app12010205","journal-title":"Appl Sci-Basel"},{"key":"9763_CR37","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2022.102478","author":"YS Liu","year":"2023","unstructured":"Liu YS, Shen WM, Zhang CJ, Sun XY (2023) Agent-based simulation and optimization of hybrid flow shop considering multi-skilled workers and fatigue factors. Rob Comput Integr Manuf. https:\/\/doi.org\/10.1016\/j.rcim.2022.102478","journal-title":"Rob Comput Integr Manuf"},{"key":"9763_CR38","doi-asserted-by":"publisher","first-page":"688","DOI":"10.3390\/math7080688","volume":"7","author":"F Luan","year":"2019","unstructured":"Luan F, Cai ZY, Wu SQ, Liu SQ, He YX (2019) Optimizing the low-carbon flexible job shop scheduling problem with discrete whale optimization algorithm. Mathematics 7:688. https:\/\/doi.org\/10.3390\/math7080688","journal-title":"Mathematics"},{"key":"9763_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117984","volume":"207","author":"Q Luo","year":"2022","unstructured":"Luo Q, Deng QW, Gong GL, Guo X, Liu XH (2022) A distributed flexible job shop scheduling problem considering worker arrangement using an improved memetic algorithm. Expert Syst Appl 207:117984. https:\/\/doi.org\/10.1016\/j.eswa.2022.117984","journal-title":"Expert Syst Appl"},{"key":"9763_CR40","doi-asserted-by":"publisher","first-page":"3815","DOI":"10.3390\/s23083815","volume":"23","author":"LL Meng","year":"2023","unstructured":"Meng LL, Cheng WY, Zhang B, Zou WQ, Fang WK, Duan P (2023) An improved genetic algorithm for solving the multi-AGV flexible job shop scheduling problem. Sensors 23:3815. https:\/\/doi.org\/10.3390\/s23083815","journal-title":"Sensors"},{"key":"9763_CR41","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.24200\/sci.2017.4451","volume":"25","author":"SM Mousavi","year":"2018","unstructured":"Mousavi SM, Mahdavi I, Rezaeian J, Zandieh M (2018) Bi-objective scheduling for the re-entrant hybrid flow shop with learning effect and setup times. Sci Iran 25:2233\u20132253. https:\/\/doi.org\/10.24200\/sci.2017.4451","journal-title":"Sci Iran"},{"key":"9763_CR42","doi-asserted-by":"publisher","first-page":"4386","DOI":"10.1080\/00207543.2019.1652780","volume":"58","author":"FF Ostermeier","year":"2020","unstructured":"Ostermeier FF (2020) The impact of human consideration, schedule types and product mix on scheduling objectives for unpaced mixed-model assembly lines. Int J Prod Res 58:4386\u20134405. https:\/\/doi.org\/10.1080\/00207543.2019.1652780","journal-title":"Int J Prod Res"},{"key":"9763_CR43","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1007\/s10845-020-01713-8","volume":"33","author":"Z Peng","year":"2022","unstructured":"Peng Z, Zhang H, Tang HT, Feng Y, Yin WM (2022) Research on flexible job-shop scheduling problem in green sustainable manufacturing based on learning effect. J Intell Manuf 33:1725\u20131746. https:\/\/doi.org\/10.1007\/s10845-020-01713-8","journal-title":"J Intell Manuf"},{"key":"9763_CR44","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.cad.2010.12.015","volume":"43","author":"RV Rao","year":"2011","unstructured":"Rao RV, Savsani VJ, Vakharia DP (2011) Teaching-learning-based optimization: a novel method for constrained mechanical design optimization problems. Comput Aided Des 43:303\u2013315. https:\/\/doi.org\/10.1016\/j.cad.2010.12.015","journal-title":"Comput Aided Des"},{"key":"9763_CR45","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.measurement.2017.09.022","volume":"114","author":"M Reddy","year":"2018","unstructured":"Reddy M, Ratnam C, Rajyalakshmi G, Manupati VK (2018) An effective hybrid multi objective evolutionary algorithm for solving real time event in flexible job shop scheduling problem. Measurement 114:78\u201390. https:\/\/doi.org\/10.1016\/j.measurement.2017.09.022","journal-title":"Measurement"},{"key":"9763_CR46","doi-asserted-by":"publisher","first-page":"521","DOI":"10.5267\/j.ijiec.2019.3.003","volume":"10","author":"P Renna","year":"2019","unstructured":"Renna P (2019) Flexible job-shop scheduling with learning and forgetting effect by multi-agent system. Int J Ind Eng Comput 10:521\u2013534. https:\/\/doi.org\/10.5267\/j.ijiec.2019.3.003","journal-title":"Int J Ind Eng Comput"},{"key":"9763_CR47","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.cor.2019.06.015","volume":"111","author":"S Sanchez-Herrera","year":"2019","unstructured":"Sanchez-Herrera S, Montoya-Torres JR, Solano-Charris EL (2019) Flow shop scheduling problem with position-dependent processing times. Comput Oper Res 111:325\u2013345. https:\/\/doi.org\/10.1016\/j.cor.2019.06.015","journal-title":"Comput Oper Res"},{"key":"9763_CR48","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.asoc.2017.08.020","volume":"61","author":"WS Shao","year":"2017","unstructured":"Shao WS, Pi DC, Shao ZS (2017) An extended teaching-learning based optimization algorithm for solving no-wait flow shop scheduling problem. Appl Soft Comput 61:193\u2013210. https:\/\/doi.org\/10.1016\/j.asoc.2017.08.020","journal-title":"Appl Soft Comput"},{"key":"9763_CR49","doi-asserted-by":"publisher","first-page":"6531","DOI":"10.1007\/s00500-016-2245-4","volume":"21","author":"XN Shen","year":"2017","unstructured":"Shen XN, Han Y, Fu JZ (2017) Robustness measures and robust scheduling for multi-objective stochastic flexible job shop scheduling problems. Soft Comput 21:6531\u20136554. https:\/\/doi.org\/10.1007\/s00500-016-2245-4","journal-title":"Soft Comput"},{"key":"9763_CR50","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.108694","volume":"120","author":"HT Tang","year":"2022","unstructured":"Tang HT, Fang B, Liu R, Li YB, Guo SS (2022) A hybrid teaching and learning-based optimization algorithm for distributed sand casting job-shop scheduling problem. Appl Soft Comput 120:108694. https:\/\/doi.org\/10.1016\/j.asoc.2022.108694","journal-title":"Appl Soft Comput"},{"key":"9763_CR51","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1111\/j.1937-5956.2010.01140.x","volume":"20","author":"S Teyarachakul","year":"2011","unstructured":"Teyarachakul S, Chand S, Ward J (2011) Effect of learning and forgetting on batch sizes. Prod Oper Manag 20:116\u2013128. https:\/\/doi.org\/10.1111\/j.1937-5956.2010.01140.x","journal-title":"Prod Oper Manag"},{"key":"9763_CR52","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1080\/00207543.2014.962113","volume":"53","author":"A Turkyilmaz","year":"2015","unstructured":"Turkyilmaz A, Bulkan S (2015) A hybrid algorithm for total tardiness minimisation in flexible job shop: genetic algorithm with parallel VNS execution. Int J Prod Res 53:1832\u20131848. https:\/\/doi.org\/10.1080\/00207543.2014.962113","journal-title":"Int J Prod Res"},{"key":"9763_CR53","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s11590-011-0334-y","volume":"6","author":"JB Wang","year":"2012","unstructured":"Wang JB, Ji P, Cheng TCE, Wang D (2012) Minimizing makespan in a two-machine flow shop with effects of deterioration and learning. Optim Lett 6:1393\u20131409. https:\/\/doi.org\/10.1007\/s11590-011-0334-y","journal-title":"Optim Lett"},{"key":"9763_CR54","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.advengsoft.2014.07.006","volume":"77","author":"ZP Xie","year":"2014","unstructured":"Xie ZP, Zhang CY, Shao XY, Lin WW, Zhu HP (2014) An effective hybrid teaching-learning-based optimization algorithm for permutation flow shop scheduling problem. Adv Eng Software 77:35\u201347. https:\/\/doi.org\/10.1016\/j.advengsoft.2014.07.006","journal-title":"Adv Eng Software"},{"key":"9763_CR55","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1080\/00207543.2021.2008041","volume":"61","author":"X Xin","year":"2023","unstructured":"Xin X, Jiang QQ, Li C, Li SH, Chen K (2023) Permutation flow shop energy-efficient scheduling with a position-based learning effect. Int J Prod Res 61:382\u2013409. https:\/\/doi.org\/10.1080\/00207543.2021.2008041","journal-title":"Int J Prod Res"},{"key":"9763_CR56","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/j.neucom.2013.10.042","volume":"148","author":"Y Xu","year":"2015","unstructured":"Xu Y, Wang L, Wang SY, Liu M (2015) An effective teaching-learning-based optimization algorithm for the flexible job-shop scheduling problem with fuzzy processing time. Neurocomputing 148:260\u2013268. https:\/\/doi.org\/10.1016\/j.neucom.2013.10.042","journal-title":"Neurocomputing"},{"key":"9763_CR57","doi-asserted-by":"publisher","first-page":"042066 (5 pp.)","DOI":"10.1088\/1742-6596\/1952\/4\/042066","volume":"1952","author":"RY Yang","year":"2021","unstructured":"Yang RY (2021) An improved genetic algorithm for solving flexible job shop. J Phys Conf Ser 1952:042066 (5 pp.). https:\/\/doi.org\/10.1088\/1742-6596\/1952\/4\/042066","journal-title":"J Phys Conf Ser"},{"key":"9763_CR58","first-page":"1242","volume":"22","author":"M Yazdani","year":"2015","unstructured":"Yazdani M, Zandieh M, Tavakkoli-Moghaddam R, Jolai F (2015) Two meta-heuristic algorithms for the dual-resource constrained flexible job-shop scheduling problem. Sci Iran 22:1242\u20131257","journal-title":"Sci Iran"},{"key":"9763_CR59","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/tevc.2007.892759","volume":"11","author":"QF Zhang","year":"2007","unstructured":"Zhang QF, Li H (2007) MOEA\/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11:712\u2013731. https:\/\/doi.org\/10.1109\/tevc.2007.892759","journal-title":"IEEE Trans Evol Comput"},{"key":"9763_CR60","doi-asserted-by":"publisher","first-page":"5554","DOI":"10.1080\/00207543.2016.1170226","volume":"54","author":"XL Zheng","year":"2016","unstructured":"Zheng XL, Wang L (2016) A knowledge-guided fruit fly optimization algorithm for dual resource constrained flexible job-shop scheduling problem. Int J Prod Res 54:5554\u20135566. https:\/\/doi.org\/10.1080\/00207543.2016.1170226","journal-title":"Int J Prod Res"},{"key":"9763_CR61","doi-asserted-by":"publisher","first-page":"1691","DOI":"10.1007\/s11081-020-09494-y","volume":"21","author":"H Zhu","year":"2020","unstructured":"Zhu H, Deng QW, Zhang L, Hu X, Lin WH (2020) Low carbon flexible job shop scheduling problem considering worker learning using a memetic algorithm. Optim Eng 21:1691\u20131716. https:\/\/doi.org\/10.1007\/s11081-020-09494-y","journal-title":"Optim Eng"},{"key":"9763_CR62","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler E, Thiele L (1999) Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans Evol Comput 3:257\u2013271. https:\/\/doi.org\/10.1109\/4235.797969","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09763-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-024-09763-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-024-09763-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T19:12:38Z","timestamp":1729192358000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-024-09763-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,11]]},"references-count":62,"journal-issue":{"issue":"17-18","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["9763"],"URL":"https:\/\/doi.org\/10.1007\/s00500-024-09763-3","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,7,11]]},"assertion":[{"value":"14 February 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}