{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T07:59:37Z","timestamp":1777276777100,"version":"3.51.4"},"reference-count":69,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100002338","name":"Ministry of Education of the People&apos;s Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002338","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013139","name":"Humanities and Social Science Fund of Ministry of Education of the People&apos;s Republic of China","doi-asserted-by":"publisher","award":["19YJAZH047"],"award-info":[{"award-number":["19YJAZH047"]}],"id":[{"id":"10.13039\/501100013139","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Applied Soft Computing"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.asoc.2026.115056","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T14:08:55Z","timestamp":1773756535000},"page":"115056","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["A population diffusion algorithm for energy-efficient distributed flexible job shop scheduling problem"],"prefix":"10.1016","volume":"195","author":[{"given":"Lexing","family":"Chen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0796-1077","authenticated-orcid":false,"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9868-8103","authenticated-orcid":false,"given":"Donglin","family":"Zhu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1546-8015","authenticated-orcid":false,"given":"Taiyong","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"10","key":"10.1016\/j.asoc.2026.115056_bib0005","doi-asserted-by":"crossref","first-page":"3202","DOI":"10.1016\/j.cor.2007.02.014","article-title":"A genetic algorithm for the flexible job-shop scheduling problem","volume":"35","author":"Pezzella","year":"2008","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0010","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TSMCC.2002.1009117","article-title":"Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems","volume":"32","author":"Kacem","year":"2002","journal-title":"IEEE Trans. Syst. Man Cybern. C Appl. Rev."},{"issue":"4","key":"10.1016\/j.asoc.2026.115056_bib0015","doi-asserted-by":"crossref","first-page":"1309","DOI":"10.1016\/j.cie.2008.07.021","article-title":"An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem","volume":"56","author":"Zhang","year":"2009","journal-title":"Comput. Ind. Eng."},{"issue":"5","key":"10.1016\/j.asoc.2026.115056_bib0020","doi-asserted-by":"crossref","first-page":"1944","DOI":"10.1109\/TCYB.2018.2817240","article-title":"Flexible job-shop rescheduling for new job insertion by using discrete jaya algorithm","volume":"49","author":"Gao","year":"2018","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2026.115056_bib0025","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/j.rcim.2019.04.006","article-title":"Multi-objective optimization for energy-efficient flexible job shop scheduling problem with transportation constraints","volume":"59","author":"Dai","year":"2019","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0030","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/j.ejor.2009.01.008","article-title":"An improved genetic algorithm for the distributed and flexible job-shop scheduling problem","volume":"200","author":"De Giovanni","year":"2010","journal-title":"Eur. J. Oper. Res."},{"issue":"12","key":"10.1016\/j.asoc.2026.115056_bib0035","doi-asserted-by":"crossref","first-page":"8013","DOI":"10.1109\/TCYB.2023.3280175","article-title":"Surprisingly popular-based adaptive memetic algorithm for energy-efficient distributed flexible job shop scheduling","volume":"53","author":"Li","year":"2023","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2026.115056_bib0040","article-title":"Co-evolution with deep reinforcement learning for energy-aware distributed heterogeneous flexible job shop scheduling","author":"Li","year":"2023","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.asoc.2026.115056_bib0045","series-title":"Evolutionary Computation in Combinatorial Optimization: 5th European Conference, EvoCOP 2005","first-page":"246","article-title":"A new hybrid ga\/sa algorithm for the job shop scheduling problem","author":"Zhang","year":"2005"},{"key":"10.1016\/j.asoc.2026.115056_bib0050","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1007\/s00170-013-5510-z","article-title":"A heuristic algorithm for solving flexible job shop scheduling problem","volume":"71","author":"Ziaee","year":"2014","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.asoc.2026.115056_bib0055","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/s10845-014-0872-0","article-title":"A Newton-based heuristic algorithm for multi-objective flexible job-shop scheduling problem","volume":"27","author":"P\u00e9rez","year":"2016","journal-title":"J. Intell. Manuf."},{"key":"10.1016\/j.asoc.2026.115056_bib0060","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1023\/B:JIMS.0000010078.30713.e9","article-title":"Tardiness minimization in a flexible job shop: a tabu search approach","volume":"15","author":"Scrich","year":"2004","journal-title":"J. Intell. Manuf."},{"issue":"11","key":"10.1016\/j.asoc.2026.115056_bib0065","doi-asserted-by":"crossref","first-page":"3027","DOI":"10.1080\/00207540600988105","article-title":"A filtered-beam-search-based heuristic algorithm for flexible job-shop scheduling problem","volume":"46","author":"Shi-Jin","year":"2008","journal-title":"Int. J. Prod. Res."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0070","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1016\/j.ejor.2023.05.017","article-title":"The flexible job shop scheduling problem: a review","volume":"314","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"2024","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115056_bib0075","article-title":"Bi-population balancing multi-objective algorithm for fuzzy flexible job shop with energy and transportation","author":"Li","year":"2023","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"key":"10.1016\/j.asoc.2026.115056_bib0080","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1016\/j.asoc.2016.07.004","article-title":"Robust multiobjective optimisation for fuzzy job shop problems","volume":"56","author":"Palacios","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0085","doi-asserted-by":"crossref","first-page":"745","DOI":"10.1007\/s10479-010-0751-9","article-title":"A memetic algorithm based on a nsgaii scheme for the flexible job-shop scheduling problem","volume":"181","author":"Frutos","year":"2010","journal-title":"Ann. Oper. Res."},{"issue":"6","key":"10.1016\/j.asoc.2026.115056_bib0090","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1080\/0951192X.2016.1187301","article-title":"An improved moea\/d for multi-objective job shop scheduling problem","volume":"30","author":"Zhao","year":"2017","journal-title":"Int. J. Comput. Integr. Manuf."},{"key":"10.1016\/j.asoc.2026.115056_bib0095","article-title":"Multi-objective optimization based on decomposition for flexible job shop scheduling under time-of-use electricity prices","volume":"204","author":"Wang","year":"2020","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.asoc.2026.115056_bib0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2022.117380","article-title":"A reinforcement learning based rmoea\/d for bi-objective fuzzy flexible job shop scheduling","volume":"203","author":"Li","year":"2022","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115056_bib0105","article-title":"A decomposition-based evolutionary algorithm with clustering and hierarchical estimation for multi-objective fuzzy flexible jobshop scheduling","author":"Zhang","year":"2024","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"10.1016\/j.asoc.2026.115056_bib0110","doi-asserted-by":"crossref","first-page":"3563","DOI":"10.1016\/j.eswa.2010.08.145","article-title":"An effective genetic algorithm for the flexible job-shop scheduling problem","volume":"38","author":"Zhang","year":"2011","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115056_bib0115","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2021.105431","article-title":"A hybrid genetic-particle swarm algorithm based on multilevel neighbourhood structure for flexible job shop scheduling problem","volume":"135","author":"Liu","year":"2021","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0120","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2015.02.052","article-title":"Scatter search with path relinking for the flexible job shop scheduling problem","volume":"245","author":"Gonz\u00e1lez","year":"2015","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0125","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1109\/TSM.2017.2758380","article-title":"Hybrid particle swarm optimization combined with genetic operators for flexible job-shop scheduling under uncertain processing time for semiconductor manufacturing","volume":"31","author":"Jamrus","year":"2017","journal-title":"IEEE Trans. Semicond. Manuf."},{"issue":"8","key":"10.1016\/j.asoc.2026.115056_bib0130","doi-asserted-by":"crossref","first-page":"5295","DOI":"10.1109\/TSMC.2021.3120702","article-title":"A bi-population evolutionary algorithm with feedback for energy-efficient fuzzy flexible job shop scheduling","volume":"52","author":"Pan","year":"2021","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.asoc.2026.115056_bib0135","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2022.101139","article-title":"Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time","volume":"74","author":"Li","year":"2022","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0140","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1016\/j.jclepro.2018.11.021","article-title":"MILP models for energy-aware flexible job shop scheduling problem","volume":"210","author":"Meng","year":"2019","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115056_bib0145","doi-asserted-by":"crossref","DOI":"10.1016\/j.jclepro.2020.120009","article-title":"An optimization method for energy-conscious production in flexible machining job shops with dynamic job arrivals and machine breakdowns","volume":"254","author":"Li","year":"2020","journal-title":"J. Clean. Prod."},{"key":"10.1016\/j.asoc.2026.115056_bib0150","article-title":"A q-learning based multi-objective memetic algorithm for dual-resource-constrained energy-saving distributed flexible job shop scheduling with applications in aerospace manufacturing","author":"Wang","year":"2025","journal-title":"Appl. Soft Comput."},{"issue":"10","key":"10.1016\/j.asoc.2026.115056_bib0155","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ifacol.2022.09.386","article-title":"The role of environmental factors in the flexible job-shop scheduling problem: a literature review","volume":"55","author":"Hassanchokami","year":"2022","journal-title":"IFAC-PapersOnLine"},{"key":"10.1016\/j.asoc.2026.115056_bib0160","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.jmsy.2023.09.002","article-title":"A hybrid genetic tabu search algorithm for distributed flexible job shop scheduling problems","volume":"71","author":"Xie","year":"2023","journal-title":"J. Manuf. Syst."},{"key":"10.1016\/j.asoc.2026.115056_bib0165","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102075","article-title":"Multi-objective optimization for distributed flexible job shop scheduling problem with job priority","volume":"98","author":"He","year":"2025","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0170","series-title":"2025 6th International Conference on Mechatronics Technology and Intelligent Manufacturing (ICMTIM)","first-page":"476","article-title":"Advances and challenges in distributed flexible manufacturing-shop scheduling: a comprehensive review","author":"Qiu","year":"2025"},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0175","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multiobjective genetic algorithm: nsga-ii","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.asoc.2026.115056_bib0180","doi-asserted-by":"crossref","first-page":"3101","DOI":"10.1109\/TCYB.2022.3151855","article-title":"Multiobjective flexible job-shop rescheduling with new job insertion and machine preventive maintenance","volume":"53","author":"An","year":"2022","journal-title":"IEEE Trans. Cybern."},{"issue":"4","key":"10.1016\/j.asoc.2026.115056_bib0185","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1109\/TEVC.2013.2281535","article-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, Part I: Solving Problems with Box Constraints","volume":"18","author":"Deb","year":"2013","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"6","key":"10.1016\/j.asoc.2026.115056_bib0190","doi-asserted-by":"crossref","first-page":"5051","DOI":"10.1109\/TCYB.2020.3026571","article-title":"A knowledge-based two-population optimization algorithm for distributed energy-efficient parallel machines scheduling","volume":"52","author":"Pan","year":"2020","journal-title":"IEEE Trans. Cybern."},{"issue":"19","key":"10.1016\/j.asoc.2026.115056_bib0195","doi-asserted-by":"crossref","first-page":"5867","DOI":"10.1080\/00207543.2020.1794075","article-title":"Adaptive scheduling for assembly job shop with uncertain assembly times based on dual q-learning","volume":"59","author":"Wang","year":"2021","journal-title":"Int. J. Prod. Res."},{"key":"10.1016\/j.asoc.2026.115056_bib0200","article-title":"A co-evolution algorithm with dueling reinforcement learning mechanism for the energy-aware distributed heterogeneous flexible flow-shop scheduling problem","author":"Zhao","year":"2024","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"key":"10.1016\/j.asoc.2026.115056_bib0205","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.112787","article-title":"Dynamic scheduling for multi-objective flexible job shop via deep reinforcement learning","volume":"171","author":"Yuan","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0210","article-title":"Multi-agent cooperative multi-network group framework for energy-efficient distributed fuzzy flexible job shop scheduling problem","author":"Zhang","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0215","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.110658","article-title":"A reinforcement learning-artificial bee colony algorithm for flexible job-shop scheduling problem with lot streaming","volume":"146","author":"Li","year":"2023","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0220","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2023.121050","article-title":"A q-learning-based hyper-heuristic evolutionary algorithm for the distributed flexible job-shop scheduling problem with crane transportation","volume":"234","author":"Zhang","year":"2023","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115056_bib0225","article-title":"A reward-shaping dueling distributed multi-agent deep reinforcement learning framework for dynamic flexible job shop scheduling with random job arrivals","author":"Zhang","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.asoc.2026.115056_bib0230","article-title":"A hierarchical collaborative multi-agent deep reinforcement learning framework for distributed flexible job shop scheduling problems considering energy efficiency and dynamic disruption in iiots","author":"Zhang","year":"2025","journal-title":"Appl. Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0235","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1109\/TEVC.2018.2866854","article-title":"A strengthened dominance relation considering convergence and diversity for evolutionary many-objective optimization","volume":"23","author":"Tian","year":"2018","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0240","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1109\/TEVC.2015.2457245","article-title":"Generalization of pareto-optimality for many-objective evolutionary optimization","volume":"20","author":"Zhu","year":"2015","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"8","key":"10.1016\/j.asoc.2026.115056_bib0245","doi-asserted-by":"crossref","first-page":"7776","DOI":"10.1109\/TCYB.2021.3051078","article-title":"A new many-objective evolutionary algorithm based on generalized pareto dominance","volume":"52","author":"Zhu","year":"2021","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0250","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1109\/TCYB.2018.2872803","article-title":"Evolutionary many-objective optimization based on adversarial decomposition","volume":"50","author":"Wu","year":"2018","journal-title":"IEEE Trans. Cybern."},{"issue":"11","key":"10.1016\/j.asoc.2026.115056_bib0255","doi-asserted-by":"crossref","first-page":"5585","DOI":"10.1109\/TCYB.2020.2988896","article-title":"Solving many-objective optimization problems by a pareto-based evolutionary algorithm with preprocessing and a penalty mechanism","volume":"51","author":"Liu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"issue":"5","key":"10.1016\/j.asoc.2026.115056_bib0260","doi-asserted-by":"crossref","first-page":"3495","DOI":"10.1109\/TCYB.2020.3008697","article-title":"A fuzzy decomposition-based multi\/many-objective evolutionary algorithm","volume":"52","author":"Liu","year":"2020","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.asoc.2026.115056_bib0265","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.eswa.2019.05.032","article-title":"A new dominance-relation metric balancing convergence and diversity in multi-and many-objective optimization","volume":"134","author":"Bao","year":"2019","journal-title":"Expert Syst. Appl."},{"issue":"9","key":"10.1016\/j.asoc.2026.115056_bib0270","doi-asserted-by":"crossref","first-page":"4553","DOI":"10.1109\/TCYB.2019.2960302","article-title":"An indicator-based many-objective evolutionary algorithm with boundary protection","volume":"51","author":"Liang","year":"2020","journal-title":"IEEE Trans. Cybern."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0275","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TEVC.2020.2999100","article-title":"Investigating the properties of indicators and an evolutionary many-objective algorithm using promising regions","volume":"25","author":"Yuan","year":"2020","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.asoc.2026.115056_bib0280","first-page":"408","article-title":"Investigating the effect of imbalance between convergence and diversity in evolutionary multiobjective algorithms","volume":"21","author":"Liu","year":"2016","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0285","doi-asserted-by":"crossref","first-page":"191191","DOI":"10.1109\/ACCESS.2020.3032548","article-title":"MILP modeling and optimization of energy-efficient distributed flexible job shop scheduling problem","volume":"8","author":"Meng","year":"2020","journal-title":"Ieee Access"},{"key":"10.1016\/j.asoc.2026.115056_bib0290","doi-asserted-by":"crossref","DOI":"10.1016\/j.cie.2020.106347","article-title":"Mixed-integer linear programming and constraint programming formulations for solving distributed flexible job shop scheduling problem","volume":"142","author":"Meng","year":"2020","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"10.1016\/j.asoc.2026.115056_bib0295","doi-asserted-by":"crossref","first-page":"904","DOI":"10.1109\/JAS.2019.1911540","article-title":"A review on swarm intelligence and evolutionary algorithms for solving flexible job shop scheduling problems","volume":"6","author":"Gao","year":"2019","journal-title":"IEEE\/CAA J. Autom. Sin."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0300","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1287\/mnsc.44.2.262","article-title":"Guided local search with shifting bottleneck for job shop scheduling","volume":"44","author":"Balas","year":"1998","journal-title":"Manag. Sci."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0305","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1002\/(SICI)1099-1425(200001\/02)3:1<3::AID-JOS32>3.0.CO;2-Y","article-title":"Effective neighbourhood functions for the flexible job shop problem","volume":"3","author":"Mastrolilli","year":"2000","journal-title":"J. Sched."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0310","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ins.2011.08.006","article-title":"Teaching\u2013learning-based optimization: an optimization method for continuous non-linear large scale problems","volume":"183","author":"Rao","year":"2012","journal-title":"Inf. Sci."},{"key":"10.1016\/j.asoc.2026.115056_bib0315","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101419","article-title":"Inverse model and adaptive neighborhood search based cooperative optimizer for energy-efficient distributed flexible job shop scheduling","volume":"83","author":"Cao","year":"2023","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.112780","article-title":"Multi-objective fitness landscape-based estimation of distribution algorithm for distributed heterogeneous flexible job shop scheduling problem","volume":"171","author":"Zhao","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.asoc.2026.115056_bib0325","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1018930406487","article-title":"An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search","volume":"70","author":"Dauz\u00e8re-P\u00e9r\u00e8s","year":"1997","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"10.1016\/j.asoc.2026.115056_bib0330","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02023073","article-title":"Routing and scheduling in a flexible job shop by Tabu Search","volume":"41","author":"Brandimarte","year":"1993","journal-title":"Ann. Oper. Res."},{"key":"10.1016\/j.asoc.2026.115056_bib0335","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s00500-008-0394-9","article-title":"Multi-objective self-adaptive differential evolution with elitist archive and crowding entropy-based diversity measure","volume":"14","author":"Wang","year":"2010","journal-title":"Soft Comput."},{"issue":"2","key":"10.1016\/j.asoc.2026.115056_bib0340","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","article-title":"Performance assessment of multiobjective optimizers: an analysis and review","volume":"7","author":"Zitzler","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"10.1016\/j.asoc.2026.115056_bib0345","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/TEVC.2005.851275","article-title":"A faster algorithm for calculating hypervolume","volume":"10","author":"While","year":"2006","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Applied Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626005041?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1568494626005041?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,14]],"date-time":"2026-04-14T19:13:48Z","timestamp":1776194028000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1568494626005041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":69,"alternative-id":["S1568494626005041"],"URL":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115056","relation":{},"ISSN":["1568-4946"],"issn-type":[{"value":"1568-4946","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A population diffusion algorithm for energy-efficient distributed flexible job shop scheduling problem","name":"articletitle","label":"Article Title"},{"value":"Applied Soft Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.asoc.2026.115056","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115056"}}