{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T12:45:32Z","timestamp":1775738732237,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62076225"],"award-info":[{"award-number":["62076225"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Complex Intell. Syst."],"published-print":{"date-parts":[[2023,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Distributed manufacturing is the mainstream model to accelerate production. However, the heterogeneous production environment makes engineer hard to find the optimal scheduling. This work investigates the energy-efficient distributed heterogeneous permutation flow scheduling problem with flexible machine speed (DHPFSP-FMS) with minimizing makespan and energy consumption simultaneously. In DHPFSP-FMS, the local search misleads the population falling into local optima which reduces the convergence and diversity. To solve this problem, a bi-roles co-evolutionary algorithm is proposed which contains the following improvements: First, the global search and local search is divided into two swarms producer and consumer to balance computation. Second, three heuristic rules are designed to get a high-quality initialization population. Next, five problem-based local search strategies are designed to accelerate converging. Then, an efficient energy-saving strategy is presented to save energy. Finally, to verify the performance of the proposed algorithm, 22 instances are generated based on the Taillard benchmark, and a number of numerical experiments are adopted. The experiment results state that our algorithm is superior to the state-of-arts and more efficient for DHPFSP-FMS.<\/jats:p>","DOI":"10.1007\/s40747-023-00984-x","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T07:21:06Z","timestamp":1676618466000},"page":"4805-4816","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["BRCE: bi-roles co-evolution for energy-efficient distributed heterogeneous permutation flow shop scheduling with flexible machine speed"],"prefix":"10.1007","volume":"9","author":[{"given":"Kuihua","family":"Huang","sequence":"first","affiliation":[]},{"given":"Rui","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1610-6865","authenticated-orcid":false,"given":"Wenyin","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Heng","family":"Wei","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,15]]},"reference":[{"issue":"5","key":"984_CR1","doi-asserted-by":"crossref","first-page":"625","DOI":"10.26599\/TST.2021.9010009","volume":"26","author":"Y Fu","year":"2021","unstructured":"Fu Y, Hou Y, Wang Z, Wu X, Gao K, Wang L (2021) Distributed scheduling problems in intelligent manufacturing systems: a survey. Tsinghua Sci Technol 26(5):625\u2013645","journal-title":"Tsinghua Sci Technol"},{"key":"984_CR2","doi-asserted-by":"crossref","unstructured":"Li R, Gong W, Wang L, Lu C, Jiang S (2022) Two-stage knowledge-driven evolutionary algorithm for distributed green flexible job shop scheduling with type-2 fuzzy processing time. Swarm and Evol Comput 101139","DOI":"10.1016\/j.swevo.2022.101139"},{"issue":"1","key":"984_CR3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s40747-021-00354-5","volume":"8","author":"F Zhao","year":"2022","unstructured":"Zhao F, Hu X, Wang L, Li Z (2022) A memetic discrete differential evolution algorithm for the distributed permutation flow shop scheduling problem. Complex Intell Syst 8(1):141\u2013161","journal-title":"Complex Intell Syst"},{"issue":"3","key":"984_CR4","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1007\/s40747-020-00205-9","volume":"7","author":"Y Li","year":"2021","unstructured":"Li Y, Wang C, Gao L, Song Y, Li X (2021) An improved simulated annealing algorithm based on residual network for permutation flow shop scheduling. Complex Intell Syst 7(3):1173\u20131183","journal-title":"Complex Intell Syst"},{"key":"984_CR5","doi-asserted-by":"crossref","first-page":"108,126","DOI":"10.1016\/j.cie.2022.108126","volume":"168","author":"JJ Wang","year":"2022","unstructured":"Wang JJ, Wang L (2022) A cooperative memetic algorithm with feedback for the energy-aware distributed flow-shops with flexible assembly scheduling. Comput Ind Eng 168:108,126","journal-title":"Comput Ind Eng"},{"issue":"3","key":"984_CR6","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","volume":"16","author":"W Shao","year":"2019","unstructured":"Shao W, Pi D, Shao Z (2019) A pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time. IEEE Trans Autom Sci Eng 16(3):1344\u20131360","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"984_CR7","doi-asserted-by":"crossref","unstructured":"Zhao F, Ma R, Wang L (2021) A self-learning discrete jaya algorithm for multiobjective energy-efficient distributed no-idle flow-shop scheduling problem in heterogeneous factory system. IEEE Trans Cybern 1\u201312","DOI":"10.1109\/TCYB.2021.3086181"},{"key":"984_CR8","doi-asserted-by":"crossref","first-page":"102,277","DOI":"10.1016\/j.rcim.2021.102277","volume":"74","author":"C Lu","year":"2022","unstructured":"Lu C, Huang Y, Meng L, Gao L, Zhang B, Zhou J (2022) A pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers. Robot Comput Integr Manuf 74:102,277","journal-title":"Robot Comput Integr Manuf"},{"key":"984_CR9","doi-asserted-by":"crossref","first-page":"108471","DOI":"10.1016\/j.knosys.2022.108471","volume":"243","author":"F Zhao","year":"2022","unstructured":"Zhao F, Shao D, Wang L, Xu T, Zhu N (2022) Jonrinaldi, An effective water wave optimization algorithm with problem-specific knowledge for the distributed assembly blocking flow-shop scheduling problem. Knowl-Based Syst 243:108471","journal-title":"Knowl-Based Syst"},{"key":"984_CR10","unstructured":"Pan Y, Gao K, Li Z, Wu N (2022) Solving biobjective distributed flow-shop scheduling problems with lot-streaming using an improved jaya algorithm. IEEE Trans Cybern 1\u201311"},{"key":"984_CR11","unstructured":"Lu C, Gao L, Yi J, Li X (2020) Energy-efficient scheduling of distributed flow shop with heterogeneous factories: a real-world case from automobile industry in China. IEEE Trans Ind Inform 1\u20131"},{"key":"984_CR12","doi-asserted-by":"crossref","unstructured":"Lu C, Zhang B, Gao L, Yi J, Mou J (2021) A knowledge-based multiobjective memetic algorithm for green job shop scheduling with variable machining speeds. IEEE Syst J 1\u201312","DOI":"10.1109\/JSYST.2021.3076481"},{"key":"984_CR13","doi-asserted-by":"crossref","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 1\u20131","DOI":"10.1109\/TCYB.2023.3280175"},{"issue":"5","key":"984_CR14","doi-asserted-by":"crossref","first-page":"2235","DOI":"10.1007\/s40747-021-00400-2","volume":"7","author":"J Cai","year":"2021","unstructured":"Cai J, Lei D (2021) A cooperated shuffled frog-leaping algorithm for distributed energy-efficient hybrid flow shop scheduling with fuzzy processing time. Complex Intell Syst 7(5):2235\u20132253","journal-title":"Complex Intell Syst"},{"issue":"2","key":"984_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s40747-019-00122-6","volume":"6","author":"K Gao","year":"2020","unstructured":"Gao K, Huang Y, Sadollah A, Wang L (2020) A review of energy-efficient scheduling in intelligent production systems. Complex Intell Syst 6(2):237\u2013249","journal-title":"Complex Intell Syst"},{"key":"984_CR16","unstructured":"Li H, Gao K, Duan PY, Li JQ, Zhang L (2022) An improved artificial bee colony algorithm with $$q$$ -learning for solving permutation flow-shop scheduling problems. IEEE Trans Syst Man Cybern Syst 1\u201310"},{"issue":"5","key":"984_CR17","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","volume":"50","author":"JJ Wang","year":"2020","unstructured":"Wang JJ, Wang L (2020) A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop. IEEE Trans Syst Man Cybern Syst 50(5):1805\u20131819","journal-title":"IEEE Trans Syst Man Cybern Syst"},{"issue":"3","key":"984_CR18","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TEVC.2018.2868770","volume":"23","author":"X Ma","year":"2019","unstructured":"Ma X, Li X, Zhang Q, Tang K, Liang Z, Xie W, Zhu Z (2019) A survey on cooperative co-evolutionary algorithms. IEEE Trans Evol Comput 23(3):421\u2013441","journal-title":"IEEE Trans Evol Comput"},{"key":"984_CR19","doi-asserted-by":"crossref","first-page":"108099","DOI":"10.1016\/j.cie.2022.108099","volume":"168","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C (2022) Self-adaptive multi-objective evolutionary algorithm for flexible job shop scheduling with fuzzy processing time. Comput Ind Eng 168:108099","journal-title":"Comput Ind Eng"},{"issue":"4","key":"984_CR20","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","volume":"37","author":"B Naderi","year":"2010","unstructured":"Naderi B, Ruiz R (2010) The distributed permutation flowshop scheduling problem. Comput Oper Res 37(4):754\u2013768","journal-title":"Comput Oper Res"},{"issue":"1","key":"984_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0305-0483(83)90088-9","volume":"11","author":"M Nawaz","year":"1983","unstructured":"Nawaz M, Enscore EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem. Omega 11(1):91\u201395","journal-title":"Omega"},{"key":"984_CR22","doi-asserted-by":"crossref","first-page":"100716","DOI":"10.1016\/j.swevo.2020.100716","volume":"57","author":"G Wang","year":"2020","unstructured":"Wang G, Gao L, Li X, Li P, Tasgetiren MF (2020) Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm. Swarm Evol Comput 57:100716","journal-title":"Swarm Evol Comput"},{"key":"984_CR23","doi-asserted-by":"crossref","first-page":"100747","DOI":"10.1016\/j.swevo.2020.100747","volume":"59","author":"Z Shao","year":"2020","unstructured":"Shao Z, Shao W, Pi D (2020) Effective heuristics and metaheuristics for the distributed fuzzy blocking flow-shop scheduling problem. Swarm Evol Comput 59:100747","journal-title":"Swarm Evol Comput"},{"key":"984_CR24","doi-asserted-by":"crossref","first-page":"105006","DOI":"10.1016\/j.cor.2020.105006","volume":"123","author":"A Hamzaday\u0131","year":"2020","unstructured":"Hamzaday\u0131 A (2020) An effective benders decomposition algorithm for solving the distributed permutation flowshop scheduling problem. Comput Oper Res 123:105006","journal-title":"Comput Oper Res"},{"key":"984_CR25","doi-asserted-by":"crossref","first-page":"106629","DOI":"10.1016\/j.asoc.2020.106629","volume":"96","author":"XL Jing","year":"2020","unstructured":"Jing XL, Pan QK, Gao L, Wang YL (2020) An effective iterated greedy algorithm for the distributed permutation flowshop scheduling with due windows. Appl Soft Comput 96:106629","journal-title":"Appl Soft Comput"},{"key":"984_CR26","doi-asserted-by":"crossref","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","volume":"59","author":"JP Huang","year":"2020","unstructured":"Huang JP, Pan QK, Gao L (2020) An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times. Swarm Evol Comput 59:100742","journal-title":"Swarm Evol Comput"},{"key":"984_CR27","doi-asserted-by":"crossref","first-page":"115339","DOI":"10.1016\/j.eswa.2021.115339","volume":"183","author":"AP Rifai","year":"2021","unstructured":"Rifai AP, Mara STW, Sudiarso A (2021) Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time. Expert Syst Appl 183:115339","journal-title":"Expert Syst Appl"},{"key":"984_CR28","doi-asserted-by":"crossref","first-page":"113678","DOI":"10.1016\/j.eswa.2020.113678","volume":"160","author":"F Zhao","year":"2020","unstructured":"Zhao F, Zhao L, Wang L, Song H (2020) An ensemble discrete differential evolution for the distributed blocking flowshop scheduling with minimizing makespan criterion. Expert Syst Appl 160:113678","journal-title":"Expert Syst Appl"},{"key":"984_CR29","first-page":"100233","volume":"24","author":"AM Fathollahi-Fard","year":"2021","unstructured":"Fathollahi-Fard AM, Woodward L, Akhrif O (2021) Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept. J Ind Inf Integr 24:100233","journal-title":"J Ind Inf Integr"},{"key":"984_CR30","doi-asserted-by":"crossref","first-page":"106959","DOI":"10.1016\/j.knosys.2021.106959","volume":"221","author":"Z Shao","year":"2021","unstructured":"Shao Z, Shao W, Pi D (2021) Effective constructive heuristic and iterated greedy algorithm for distributed mixed blocking permutation flow-shop scheduling problem. Knowl Based Syst 221:106959","journal-title":"Knowl Based Syst"},{"key":"984_CR31","doi-asserted-by":"crossref","first-page":"100,874","DOI":"10.1016\/j.swevo.2021.100874","volume":"63","author":"YZ Li","year":"2021","unstructured":"Li YZ, Pan QK, Li JQ, Gao L, Tasgetiren MF (2021) An adaptive iterated greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems. Swarm Evol Comput 63:100,874","journal-title":"Swarm Evol Comput"},{"key":"984_CR32","doi-asserted-by":"crossref","first-page":"104375","DOI":"10.1016\/j.engappai.2021.104375","volume":"104","author":"S Chen","year":"2021","unstructured":"Chen S, Pan QK, Gao L, Sang HY (2021) A population-based iterated greedy algorithm to minimize total flowtime for the distributed blocking flowshop scheduling problem. Eng Appl Artif Intell 104:104375","journal-title":"Eng Appl Artif Intell"},{"key":"984_CR33","doi-asserted-by":"crossref","first-page":"100785","DOI":"10.1016\/j.swevo.2020.100785","volume":"60","author":"ZQ Zhang","year":"2021","unstructured":"Zhang ZQ, Qian B, Hu R, Jin HP, Wang L (2021) A matrix-cube-based estimation of distribution algorithm for the distributed assembly permutation flow-shop scheduling problem. Swarm Evol Comput 60:100785","journal-title":"Swarm Evol Comput"},{"key":"984_CR34","doi-asserted-by":"crossref","first-page":"100807","DOI":"10.1016\/j.swevo.2020.100807","volume":"60","author":"HB Song","year":"2021","unstructured":"Song HB, Lin J (2021) A genetic programming hyper-heuristic for the distributed assembly permutation flow-shop scheduling problem with sequence dependent setup times. Swarm Evol Comput 60:100807","journal-title":"Swarm Evol Comput"},{"key":"984_CR35","doi-asserted-by":"crossref","unstructured":"Zeng QG, Li JG, Li RH, Huang TH, Han YY, Sang HY (2022) Improved nsga-ii for energy-efficient distributed no-wait flow-shop with sequence-dependent setup time. Complex Intell Syst","DOI":"10.1007\/s40747-022-00830-6"},{"key":"984_CR36","doi-asserted-by":"crossref","first-page":"108413","DOI":"10.1016\/j.knosys.2022.108413","volume":"242","author":"JY Mao","year":"2022","unstructured":"Mao JY, Pan QK, Miao ZH, Gao L, Chen S (2022) A hash map-based memetic algorithm for the distributed permutation flowshop scheduling problem with preventive maintenance to minimize total flowtime. Knowl Based Syst 242:108413","journal-title":"Knowl Based Syst"},{"key":"984_CR37","doi-asserted-by":"crossref","first-page":"107247","DOI":"10.1016\/j.asoc.2021.107247","volume":"105","author":"XL Jing","year":"2021","unstructured":"Jing XL, Pan QK, Gao L (2021) Local search-based metaheuristics for the robust distributed permutation flowshop problem. Appl Soft Comput 105:107247","journal-title":"Appl Soft Comput"},{"key":"984_CR38","doi-asserted-by":"crossref","first-page":"107526","DOI":"10.1016\/j.asoc.2021.107526","volume":"109","author":"YZ Li","year":"2021","unstructured":"Li YZ, Pan QK, Gao KZ, Tasgetiren MF, Zhang B, Li JQ (2021) A green scheduling algorithm for the distributed flowshop problem. Appl Soft Comput 109:107526","journal-title":"Appl Soft Comput"},{"key":"984_CR39","doi-asserted-by":"crossref","first-page":"132551","DOI":"10.1016\/j.jclepro.2022.132551","volume":"365","author":"S Schulz","year":"2022","unstructured":"Schulz S, Sch\u00f6nheit M, Neufeld JS (2022) Multi-objective carbon-efficient scheduling in distributed permutation flow shops under consideration of transportation efforts. J Clean Prod 365:132551","journal-title":"J Clean Prod"},{"key":"984_CR40","doi-asserted-by":"crossref","first-page":"117269","DOI":"10.1016\/j.eswa.2022.117269","volume":"202","author":"Y Yang","year":"2022","unstructured":"Yang Y, Li X (2022) A knowledge-driven constructive heuristic algorithm for the distributed assembly blocking flow shop scheduling problem. Expert Syst Appl 202:117269","journal-title":"Expert Syst Appl"},{"key":"984_CR41","doi-asserted-by":"crossref","first-page":"116921","DOI":"10.1016\/j.eswa.2022.116921","volume":"198","author":"N Zhu","year":"2022","unstructured":"Zhu N, Zhao F, Wang L, Ding R, Xu T (2022) Jonrinaldi, A discrete learning fruit fly algorithm based on knowledge for the distributed no-wait flow shop scheduling with due windows. Expert Syst Appl 198:116921","journal-title":"Expert Syst Appl"},{"key":"984_CR42","doi-asserted-by":"crossref","unstructured":"Miyata HH, Nagano MS (2022) An iterated greedy algorithm for distributed blocking flow shop with setup times and maintenance operations to minimize makespan. Comput Ind Eng 171:108366","DOI":"10.1016\/j.cie.2022.108366"},{"issue":"6","key":"984_CR43","doi-asserted-by":"crossref","first-page":"2425","DOI":"10.1109\/TCYB.2019.2943606","volume":"50","author":"JQ Li","year":"2020","unstructured":"Li JQ, Song MX, Wang L, Duan PY, Han YY, Sang HY, Pan QK (2020) Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs. IEEE Trans Cybern 50(6):2425\u20132439","journal-title":"IEEE Trans Cybern"},{"key":"984_CR44","doi-asserted-by":"crossref","unstructured":"Pan Y, Gao K, Li Z, Wu N (2022) Improved meta-heuristics for solving distributed lot-streaming permutation flow shop scheduling problems. IEEE Trans Autom Sci Eng 1\u201311","DOI":"10.1109\/TASE.2022.3151648"},{"key":"984_CR45","unstructured":"He X, Pan QK, Gao L, Wang L, Suganthan PN (2021) A greedy cooperative co-evolution ary algorithm with problem-specific knowledge for multi-objective flowshop group scheduling problems. IEEE Trans Evol Comput 1\u20131"},{"key":"984_CR46","doi-asserted-by":"crossref","unstructured":"Chen J, Wang L, He X, Huang D (2019) In: 2019 IEEE congress on evolutionary computation (CEC), pp 411\u2013418","DOI":"10.1109\/CEC.2019.8790051"},{"key":"984_CR47","doi-asserted-by":"crossref","first-page":"109138","DOI":"10.1016\/j.asoc.2022.109138","volume":"125","author":"W Shao","year":"2022","unstructured":"Shao W, Shao Z, Pi D (2022) Multi-local search-based general variable neighborhood search for distributed flow shop scheduling in heterogeneous multi-factories. Appl Soft Comput 125:109138","journal-title":"Appl Soft Comput"},{"key":"984_CR48","doi-asserted-by":"crossref","first-page":"106946","DOI":"10.1016\/j.asoc.2020.106946","volume":"100","author":"H Li","year":"2021","unstructured":"Li H, Li X, Gao L (2021) A discrete artificial bee colony algorithm for the distributed heterogeneous no-wait flowshop scheduling problem. Appl Soft Comput 100:106946","journal-title":"Appl Soft Comput"},{"key":"984_CR49","doi-asserted-by":"crossref","first-page":"100803","DOI":"10.1016\/j.swevo.2020.100803","volume":"60","author":"C Lu","year":"2021","unstructured":"Lu C, Gao L, Gong W, Hu C, Yan X, Li X (2021) Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm. Swarm Evol Comput 60:100803","journal-title":"Swarm Evol Comput"},{"key":"984_CR50","doi-asserted-by":"crossref","first-page":"100804","DOI":"10.1016\/j.swevo.2020.100804","volume":"60","author":"T Meng","year":"2021","unstructured":"Meng T, Pan QK (2021) A distributed heterogeneous permutation flowshop scheduling problem with lot-streaming and carryover sequence-dependent setup time. Swarm Evol Comput 60:100804","journal-title":"Swarm Evol Comput"},{"issue":"2","key":"984_CR51","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":"984_CR52","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.ins.2022.04.053","volume":"602","author":"F Wang","year":"2022","unstructured":"Wang F, Wang X, Sun S (2022) A reinforcement learning level-based particle swarm optimization algorithm for large-scale optimization. Inf Sci 602:298\u2013312","journal-title":"Inf Sci"},{"key":"984_CR53","doi-asserted-by":"crossref","first-page":"117,380","DOI":"10.1016\/j.eswa.2022.117380","volume":"203","author":"R Li","year":"2022","unstructured":"Li R, Gong W, Lu C (2022) A reinforcement learning based rmoea\/d for bi-objective fuzzy flexible job shop scheduling. Expert Syst Appl 203:117,380","journal-title":"Expert Syst Appl"},{"issue":"2","key":"984_CR54","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1016\/0377-2217(93)90182-M","volume":"64","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64(2):278\u2013285","journal-title":"Eur J Oper Res"},{"issue":"1","key":"984_CR55","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"},{"issue":"3","key":"984_CR56","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1198\/004017002320256440","volume":"44","author":"RC Van Nostrand","year":"2002","unstructured":"Van Nostrand RC (2002) Design of experiments using the Taguchi approach: 16 steps to product and process improvement. Technometrics 44(3):289\u2013289","journal-title":"Technometrics"},{"issue":"6","key":"984_CR57","doi-asserted-by":"crossref","first-page":"712","DOI":"10.1109\/TEVC.2007.892759","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang Q, Hui L (2007) Moea\/d: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans Evol Comput 11(6):712\u2013731","journal-title":"IEEE Trans Evol Comput"}],"container-title":["Complex &amp; Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00984-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40747-023-00984-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40747-023-00984-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,14]],"date-time":"2024-10-14T12:54:00Z","timestamp":1728910440000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40747-023-00984-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":57,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,10]]}},"alternative-id":["984"],"URL":"https:\/\/doi.org\/10.1007\/s40747-023-00984-x","relation":{},"ISSN":["2199-4536","2198-6053"],"issn-type":[{"value":"2199-4536","type":"print"},{"value":"2198-6053","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"20 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}