{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T19:05:11Z","timestamp":1782327911502,"version":"3.54.5"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:00:00Z","timestamp":1743120000000},"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":["No. 62076225"],"award-info":[{"award-number":["No. 62076225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62076225"],"award-info":[{"award-number":["No. 62076225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["No. 62076225"],"award-info":[{"award-number":["No. 62076225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s12293-025-00450-w","type":"journal-article","created":{"date-parts":[[2025,3,30]],"date-time":"2025-03-30T22:28:30Z","timestamp":1743373710000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Two-stage memetic algorithm for green flexible job shop scheduling problem considering machine deterioration and maintenance"],"prefix":"10.1007","volume":"17","author":[{"given":"Guoqiang","family":"Zhu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianfeng","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wenyin","family":"Gong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,3,28]]},"reference":[{"key":"450_CR1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2020.113348","volume":"157","author":"M Abedi","year":"2020","unstructured":"Abedi M, Chiong R, Noman N, Zhang R (2020) A multi-population, multi-objective memetic algorithm for energy-efficient job-shop scheduling with deteriorating machines. Expert Syst Appl 157:113348","journal-title":"Expert Syst Appl"},{"issue":"5","key":"450_CR2","doi-asserted-by":"crossref","first-page":"3101","DOI":"10.1109\/TCYB.2022.3151855","volume":"53","author":"Y An","year":"2022","unstructured":"An Y, Chen X, Gao K, Li Y, Zhang L (2022) Multiobjective flexible job-shop rescheduling with new job insertion and machine preventive maintenance. IEEE Trans Cybern 53(5):3101\u20133113","journal-title":"IEEE Trans Cybern"},{"key":"450_CR3","volume":"212","author":"Y An","year":"2023","unstructured":"An Y, Chen X, Gao K, Zhang L, Li Y, Zhao Z (2023) A hybrid multi-objective evolutionary algorithm for solving an adaptive flexible job-shop rescheduling problem with real-time order acceptance and condition-based preventive maintenance. Expert Syst Appl 212:118711","journal-title":"Expert Syst Appl"},{"issue":"3","key":"450_CR4","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s12293-022-00372-x","volume":"14","author":"T Azad","year":"2022","unstructured":"Azad T, Rahman HF, Chakrabortty RK, Ryan MJ (2022) Optimization of integrated production scheduling and vehicle routing problem with batch delivery to multiple customers in supply chain. Memetic Comput 14(3):355\u2013376","journal-title":"Memetic Comput"},{"issue":"2","key":"450_CR5","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","volume":"7","author":"PA Bosman","year":"2003","unstructured":"Bosman PA, Thierens D (2003) The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):174\u2013188","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"450_CR6","doi-asserted-by":"crossref","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(3):157\u2013183","journal-title":"Ann Oper Res"},{"issue":"3","key":"450_CR7","doi-asserted-by":"crossref","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(3):495\u2013498","journal-title":"Oper Res"},{"key":"450_CR8","volume":"83","author":"S Cao","year":"2023","unstructured":"Cao S, Li R, Gong W, Lu C (2023) Inverse model and adaptive neighborhood search based cooperative optimizer for energy-efficient distributed flexible job shop scheduling. Swarm Evol Comput 83:101419","journal-title":"Swarm Evol Comput"},{"key":"450_CR9","doi-asserted-by":"crossref","first-page":"811","DOI":"10.1007\/s00500-008-0357-1","volume":"13","author":"A Caponio","year":"2009","unstructured":"Caponio A, Neri F, Tirronen V (2009) Super-fit control adaptation in memetic differential evolution frameworks. Soft Comput 13:811\u2013831","journal-title":"Soft Comput"},{"key":"450_CR10","doi-asserted-by":"crossref","unstructured":"Caraffini F, Iacca G, Neri F, Picinali L, Mininno E (2013) A cma-es super-fit scheme for the re-sampled inheritance search. In: 2013 IEEE congress on evolutionary computation, pp 1123\u20131130. IEEE","DOI":"10.1109\/CEC.2013.6557692"},{"issue":"1","key":"450_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"TE Cheng","year":"2004","unstructured":"Cheng TE, Ding Q, Lin BM (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152(1):1\u201313","journal-title":"Eur J Oper Res"},{"issue":"2","key":"450_CR12","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","volume":"314","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Ding J, Shen L, Tamssaouet K (2024) The flexible job shop scheduling problem: a review. Eur J Oper Res 314(2):409\u2013432","journal-title":"Eur J Oper Res"},{"key":"450_CR13","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281\u2013306","journal-title":"Ann Oper Res"},{"key":"450_CR14","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","volume":"70","author":"S Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","unstructured":"Dauz\u00e8re-P\u00e9r\u00e8s S, Paulli J (1997) An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search. Ann Oper Res 70:281\u2013306","journal-title":"Ann Oper Res"},{"issue":"2","key":"450_CR15","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182\u2013197","journal-title":"IEEE Trans Evol Comput"},{"key":"450_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.jmsy.2023.01.004","volume":"67","author":"C Destouet","year":"2023","unstructured":"Destouet C, Tlahig H, Bettayeb B, Mazari B (2023) Flexible job shop scheduling problem under industry 5.0: a survey on human reintegration, environmental consideration and resilience improvement. J Manuf Syst 67:155\u2013173","journal-title":"J Manuf Syst"},{"issue":"200","key":"450_CR17","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1080\/01621459.1937.10503522","volume":"32","author":"M Friedman","year":"1937","unstructured":"Friedman M (1937) The use of ranks to avoid the assumption of normality implicit in the analysis of variance. J Am Stat Assoc 32(200):675\u2013701","journal-title":"J Am Stat Assoc"},{"key":"450_CR18","doi-asserted-by":"crossref","unstructured":"Frolov M, Tanchenko S, Ohluzdina L (2024) Parameter estimation of the Weibull distribution in modeling the reliability of technical objects","DOI":"10.21272\/jes.2024.11(1).a1"},{"key":"450_CR19","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1016\/j.asoc.2017.12.009","volume":"68","author":"Y Fu","year":"2018","unstructured":"Fu Y, Ding J, Wang H, Wang J (2018) Two-objective stochastic flow-shop scheduling with deteriorating and learning effect in industry 4.0-based manufacturing system. Appl Soft Comput 68:847\u2013855","journal-title":"Appl Soft Comput"},{"issue":"4","key":"450_CR20","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","volume":"6","author":"K Gao","year":"2019","unstructured":"Gao K, Cao Z, Zhang L, Chen Z, Han Y, Pan Q (2019) A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems. IEEE\/CAA J Autom Sin 6(4):904\u2013916","journal-title":"IEEE\/CAA J Autom Sin"},{"issue":"1","key":"450_CR21","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/j.ejor.2008.12.014","volume":"200","author":"S Gawiejnowicz","year":"2010","unstructured":"Gawiejnowicz S, Kononov A (2010) Complexity and approximability of scheduling resumable proportionally deteriorating jobs. Eur J Oper Res 200(1):305\u2013308","journal-title":"Eur J Oper Res"},{"key":"450_CR22","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jmsy.2021.09.018","volume":"61","author":"M Ghaleb","year":"2021","unstructured":"Ghaleb M, Taghipour S, Zolfagharinia H (2021) Real-time integrated production-scheduling and maintenance-planning in a flexible job shop with machine deterioration and condition-based maintenance. J Manuf Syst 61:423\u2013449","journal-title":"J Manuf Syst"},{"key":"450_CR23","doi-asserted-by":"crossref","unstructured":"Grelier C, Goudet O, Hao J.K (2024) A memetic algorithm with adaptive operator selection for graph coloring. In: European conference on evolutionary computation in combinatorial optimization (part of EvoStar), pp 65\u201380","DOI":"10.1007\/978-3-031-57712-3_5"},{"issue":"4","key":"450_CR24","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"JN Gupta","year":"1988","unstructured":"Gupta JN, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Indus Eng 14(4):387\u2013393","journal-title":"Comput Indus Eng"},{"issue":"6","key":"450_CR25","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1016\/j.omega.2003.08.003","volume":"31","author":"Y Hsu","year":"2003","unstructured":"Hsu Y, Lin BM (2003) Minimization of maximum lateness under linear deterioration. Omega 31(6):459\u2013469","journal-title":"Omega"},{"key":"450_CR26","volume":"213","author":"W Hu","year":"2021","unstructured":"Hu W, Yang Z, Chen C, Wu Y, Xie Q (2021) A Weibull-based recurrent regression model for repairable systems considering double effects of operation and maintenance: A case study of machine tools. Reliab Eng Syst Saf 213:107669","journal-title":"Reliab Eng Syst Saf"},{"key":"450_CR27","doi-asserted-by":"crossref","first-page":"1190977","DOI":"10.3389\/fnbot.2023.1190977","volume":"17","author":"C Hua","year":"2023","unstructured":"Hua C, Cao X, Liao B, Li S (2023) Advances on intelligent algorithms for scientific computing: an overview. Front Neurorobot 17:1190977","journal-title":"Front Neurorobot"},{"key":"450_CR28","doi-asserted-by":"crossref","unstructured":"Iacca G, Mallipeddi R, Mininno E, Neri F, Suganthan P.N (2011) Super-fit and population size reduction in compact differential evolution. In: 2011 IEEE Workshop on Memetic Computing (MC), pp 1\u20138. IEEE","DOI":"10.1109\/MC.2011.5953633"},{"key":"450_CR29","volume":"189","author":"Z Jia","year":"2024","unstructured":"Jia Z, Jia Y, Liu C, Xu G, Li K (2024) A self-learning multi-population evolutionary algorithm for flexible job shop scheduling under time-of-use pricing. Comput Ind Eng 189:110004","journal-title":"Comput Ind Eng"},{"key":"450_CR30","doi-asserted-by":"crossref","first-page":"43153","DOI":"10.1109\/ACCESS.2019.2908200","volume":"7","author":"T Jiang","year":"2019","unstructured":"Jiang T, Zhang C, Sun QM (2019) Green job shop scheduling problem with discrete whale optimization algorithm. IEEE Access 7:43153\u201343166","journal-title":"IEEE Access"},{"key":"450_CR31","doi-asserted-by":"crossref","unstructured":"Jin C, Bai R, Zhou Y, Chen X, Tan L (2024) Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming. Memetic Comput","DOI":"10.21203\/rs.3.rs-4449908\/v1"},{"issue":"2","key":"450_CR32","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1016\/j.ejor.2021.07.023","volume":"298","author":"H Kim","year":"2022","unstructured":"Kim H, Kim BI (2022) Optimal sequence for single server scheduling incorporating a rate-modifying activity under job-dependent linear deterioration. Eur J Oper Res 298(2):439\u2013450","journal-title":"Eur J Oper Res"},{"issue":"5","key":"450_CR33","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1002\/(SICI)1520-6750(199808)45:5<511::AID-NAV5>3.0.CO;2-6","volume":"45","author":"W Kubiak","year":"1998","unstructured":"Kubiak W, van de Velde S (1998) Scheduling deteriorating jobs to minimize makespan. Naval Res Logist 45(5):511\u2013523","journal-title":"Naval Res Logist"},{"issue":"2","key":"450_CR34","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10845-020-01588-9","volume":"32","author":"L Li","year":"2021","unstructured":"Li L, Wang Y, Lin KY (2021) Preventive maintenance scheduling optimization based on opportunistic production-maintenance synchronization. J Intell Manuf 32(2):545\u2013558","journal-title":"J Intell Manuf"},{"key":"450_CR35","doi-asserted-by":"crossref","unstructured":"Li, M., Han X, Chu X, Liang Z (2024) Empirical comparison between MOEAs and local search on multi-objective combinatorial optimisation problems","DOI":"10.1145\/3638529.3654077"},{"key":"450_CR36","doi-asserted-by":"crossref","first-page":"478","DOI":"10.1016\/j.ins.2021.12.122","volume":"589","author":"M Li","year":"2022","unstructured":"Li M, Wang GG (2022) A review of green shop scheduling problem. Inf Sci 589:478\u2013496","journal-title":"Inf Sci"},{"issue":"2","key":"450_CR37","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1162\/evco_a_00269","volume":"28","author":"M Li","year":"2020","unstructured":"Li M, Yao X (2020) What weights work for you? Adapting weights for any pareto front shape in decomposition-based evolutionary multiobjective optimisation. Evol Comput 28(2):227\u2013253","journal-title":"Evol Comput"},{"issue":"3","key":"450_CR38","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1109\/TEVC.2022.3175832","volume":"27","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C, Wang L (2022) A learning-based memetic algorithm for energy-efficient flexible job-shop scheduling with type-2 fuzzy processing time. IEEE Trans Evol Comput 27(3):610\u2013620","journal-title":"IEEE Trans Evol Comput"},{"key":"450_CR39","doi-asserted-by":"crossref","unstructured":"Li, R., Gong W, Wang L, Lu C, Dong C (2023) Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling. IEEE Trans Syst Man Cybern Syst","DOI":"10.1109\/TSMC.2023.3305541"},{"issue":"12","key":"450_CR40","doi-asserted-by":"crossref","first-page":"8013","DOI":"10.1109\/TCYB.2023.3280175","volume":"53","author":"R Li","year":"2023","unstructured":"Li R, Gong W, Wang L, Lu C, Zhuang X (2023) Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling. IEEE Trans Cybern 53(12):8013\u20138023","journal-title":"IEEE Trans Cybern"},{"issue":"6","key":"450_CR41","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1080\/0305215X.2016.1227616","volume":"49","author":"SS Li","year":"2017","unstructured":"Li SS, Chen RX (2017) Common due date assignment and cumulative deterioration scheduling on a single machine. Eng Optim 49(6):976\u2013989","journal-title":"Eng Optim"},{"key":"450_CR42","doi-asserted-by":"crossref","unstructured":"Lin X, Chen Y, Xue J, Zhang B, Chen Y, Chen C (2024) Parallel machine scheduling with job family, release time, and mold availability constraints: model and two solution approaches. Memetic Comput, 1\u201317","DOI":"10.1007\/s12293-024-00421-7"},{"issue":"2","key":"450_CR43","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s12293-022-00364-x","volume":"14","author":"Q Liu","year":"2022","unstructured":"Liu Q, Li X, Gao L, Wang G (2022) A multiobjective memetic algorithm for integrated process planning and scheduling problem in distributed heterogeneous manufacturing systems. Memetic Comput 14(2):193\u2013209","journal-title":"Memetic Comput"},{"key":"450_CR44","doi-asserted-by":"crossref","unstructured":"Liu S, Li P, Wang J, Liu P (2024) Toward industry 5.0: Challenges and enablers of intelligent manufacturing technology implementation under the perspective of sustainability. Heliyon","DOI":"10.2139\/ssrn.4701314"},{"key":"450_CR45","volume":"235","author":"C Luo","year":"2024","unstructured":"Luo C, Gong W, Lu C (2024) Knowledge-driven two-stage memetic algorithm for energy-efficient flexible job shop scheduling with machine breakdowns. Expert Syst Appl 235:121149","journal-title":"Expert Syst Appl"},{"key":"450_CR46","volume":"85","author":"C Luo","year":"2024","unstructured":"Luo C, Gong W, Ming F, Lu C (2024) A q-learning memetic algorithm for energy-efficient heterogeneous distributed assembly permutation flowshop scheduling considering priorities. Swarm Evol Comput 85:101497","journal-title":"Swarm Evol Comput"},{"issue":"10","key":"450_CR47","doi-asserted-by":"crossref","first-page":"6222","DOI":"10.1109\/TSMC.2022.3143657","volume":"52","author":"F Ming","year":"2022","unstructured":"Ming F, Gong W, Wang L (2022) A two-stage evolutionary algorithm with balanced convergence and diversity for many-objective optimization. IEEE Trans Syst Man Cybern Syst 52(10):6222\u20136234","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"6","key":"450_CR48","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1287\/mnsc.42.6.797","volume":"42","author":"E Nowicki","year":"1996","unstructured":"Nowicki E, Smutnicki C (1996) A fast taboo search algorithm for the job shop problem. Manage Sci 42(6):797\u2013813","journal-title":"Manage Sci"},{"issue":"8","key":"450_CR49","doi-asserted-by":"crossref","first-page":"5295","DOI":"10.1109\/TSMC.2021.3120702","volume":"52","author":"Z Pan","year":"2021","unstructured":"Pan Z, Lei D, Wang L (2021) A bi-population evolutionary algorithm with feedback for energy-efficient fuzzy flexible job shop scheduling. IEEE Trans Syst Man Cybern Syst 52(8):5295\u2013307","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"1","key":"450_CR50","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s10479-019-03160-y","volume":"294","author":"J Pei","year":"2020","unstructured":"Pei J, Wei J, Liao B, Liu X, Pardalos PM (2020) Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent. Ann Oper Res 294(1):191\u2013223","journal-title":"Ann Oper Res"},{"issue":"3","key":"450_CR51","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s12293-024-00419-1","volume":"16","author":"Y Peng","year":"2024","unstructured":"Peng Y, Chen G, Zhang M, Xue B (2024) Proximal evolutionary strategy: improving deep reinforcement learning through evolutionary policy optimization. Memetic Comput 16(3):445\u2013466","journal-title":"Memetic Comput"},{"issue":"2","key":"450_CR52","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s12293-021-00329-6","volume":"13","author":"H Qin","year":"2021","unstructured":"Qin H, Li T, Teng Y, Wang K (2021) Integrated production and distribution scheduling in distributed hybrid flow shops. Memetic Comput 13(2):185\u2013202","journal-title":"Memetic Comput"},{"issue":"8","key":"450_CR53","doi-asserted-by":"crossref","first-page":"2051","DOI":"10.1016\/j.cor.2013.02.018","volume":"40","author":"AJ Ruiz-Torres","year":"2013","unstructured":"Ruiz-Torres AJ, Paletta G, P\u00e9rez E (2013) Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects. Comput Oper Res 40(8):2051\u20132061","journal-title":"Comput Oper Res"},{"key":"450_CR54","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-016-0497-6","volume":"20","author":"K Rustogi","year":"2017","unstructured":"Rustogi K, Strusevich VA (2017) Single machine scheduling with a generalized job-dependent cumulative effect. J Sched 20:583\u2013592","journal-title":"J Sched"},{"issue":"9","key":"450_CR55","doi-asserted-by":"crossref","first-page":"5533","DOI":"10.1109\/TCYB.2022.3158334","volume":"53","author":"J Su","year":"2022","unstructured":"Su J, Huang H, Li G, Li X, Hao Z (2022) Self-organizing neural scheduler for the flexible job shop problem with periodic maintenance and mandatory outsourcing constraints. IEEE Trans Cybern 53(9):5533\u20135544","journal-title":"IEEE Trans Cybern"},{"key":"450_CR56","doi-asserted-by":"crossref","unstructured":"Sun Y, Tang S, Dou Z, Wang T (2024) How environment and technology affect the regional manufacturing industry development. Heliyon","DOI":"10.1016\/j.heliyon.2024.e35321"},{"key":"450_CR57","doi-asserted-by":"crossref","unstructured":"Van\u00a0Nostrand RC (2002) Design of experiments using the Taguchi approach: 16 steps to product and process improvement","DOI":"10.1198\/004017002320256440"},{"key":"450_CR58","doi-asserted-by":"crossref","unstructured":"Wang W, Wei Z, Huang T, Gao X, Gao W (2024) A distributed individuals based multimodal multi-objective optimization differential evolution algorithm. Memetic Comput 1\u201313","DOI":"10.1007\/s12293-024-00413-7"},{"key":"450_CR59","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/s00170-010-2642-2","volume":"51","author":"X Wang","year":"2010","unstructured":"Wang X, Gao L, Zhang C, Shao X (2010) A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. Int J Adv Manuf Technol 51:757\u2013767","journal-title":"Int J Adv Manuf Technol"},{"key":"450_CR60","volume":"269","author":"Y Wang","year":"2024","unstructured":"Wang Y, Xia T, Xu Y, Ding Y, Zheng M, Pan E, Xi L (2024) Joint optimization of flexible job shop scheduling and preventive maintenance under high-frequency production switching. Int J Prod Econ 269:109163","journal-title":"Int J Prod Econ"},{"issue":"1","key":"450_CR61","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","volume":"10","author":"L While","year":"2006","unstructured":"While L, Hingston P, Barone L, Huband S (2006) A faster algorithm for calculating hypervolume. IEEE Trans Evol Comput 10(1):29\u201338","journal-title":"IEEE Trans Evol Comput"},{"key":"450_CR62","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1016\/j.cie.2019.06.048","volume":"135","author":"X Wu","year":"2019","unstructured":"Wu X, Shen X, Li C (2019) The flexible job-shop scheduling problem considering deterioration effect and energy consumption simultaneously. Comput Ind Eng 135:1004\u20131024","journal-title":"Comput Ind Eng"},{"issue":"7","key":"450_CR63","doi-asserted-by":"crossref","first-page":"2147","DOI":"10.1080\/00207543.2022.2060772","volume":"61","author":"J Xie","year":"2023","unstructured":"Xie J, Li X, Gao L, Gui L (2023) A new neighbourhood structure for job shop scheduling problems. Int J Prod Res 61(7):2147\u20132161","journal-title":"Int J Prod Res"},{"key":"450_CR64","first-page":"137","volume":"18","author":"H Xu","year":"2018","unstructured":"Xu H, Li R, Zeng L, Li K, Pan C (2018) Energy-efficient scheduling with reliability guarantee in embedded real-time systems. Sustain Comput Inf Syst 18:137\u2013148","journal-title":"Sustain Comput Inf Syst"},{"key":"450_CR65","doi-asserted-by":"crossref","unstructured":"Yao Y, Li X, Gao L (2024) A DQN-based memetic algorithm for energy-efficient job shop scheduling problem with integrated limited AGVs. Swarm Evol Comput 87:101544","DOI":"10.1016\/j.swevo.2024.101544"},{"issue":"1","key":"450_CR66","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TASE.2020.2978890","volume":"18","author":"H Ye","year":"2020","unstructured":"Ye H, Wang X, Liu K (2020) Adaptive preventive maintenance for flow shop scheduling with resumable processing. IEEE Trans Autom Sci Eng 18(1):106\u2013113","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"450_CR67","first-page":"15","volume":"13","author":"L Yin","year":"2017","unstructured":"Yin L, Li X, Gao L, Lu C, Zhang Z (2017) A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem. Sustain Comput Inf Syst 13:15\u201330","journal-title":"Sustain Comput Inf Syst"},{"key":"450_CR68","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.asoc.2017.04.060","volume":"58","author":"M Zandieh","year":"2017","unstructured":"Zandieh M, Khatami A, Rahmati SHA (2017) Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm. Appl Soft Comput 58:449\u2013464","journal-title":"Appl Soft Comput"},{"key":"450_CR69","doi-asserted-by":"crossref","unstructured":"Zhan H, Zhang Y, Huang J, Song Y, Xing L, Wu J, Gao Z (2024) A reinforcement learning-based evolutionary algorithm for the unmanned aerial vehicles maritime search and rescue path planning problem considering multiple rescue centers. Memetic Comput, 1\u201314","DOI":"10.1007\/s12293-024-00420-8"},{"issue":"4","key":"450_CR70","first-page":"1","volume":"15","author":"Q Zhang","year":"2021","unstructured":"Zhang Q, Jiao R, Zeng S, Zeng Z (2021) Balancing exploration and exploitation with decomposition-based dynamic multi-objective evolutionary algorithm. Int J Cognitive Inf Nat Intell 15(4):1\u201323","journal-title":"Int J Cognitive Inf Nat Intell"},{"issue":"6","key":"450_CR71","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Li H (2007) Moea\/d: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"},{"key":"450_CR72","doi-asserted-by":"crossref","unstructured":"Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: Empirical results. Evol Comput 8(2):173\u2013195","DOI":"10.1162\/106365600568202"},{"key":"450_CR73","unstructured":"Zitzler E, Laumanns M, Thiele L (2001) Spea2: Improving the strength pareto evolutionary algorithm. TIK report\u00a0103"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00450-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12293-025-00450-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-025-00450-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:30:47Z","timestamp":1750930247000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12293-025-00450-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,28]]},"references-count":73,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["450"],"URL":"https:\/\/doi.org\/10.1007\/s12293-025-00450-w","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,28]]},"assertion":[{"value":"29 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 March 2025","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 that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"14"}}