{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T10:07:40Z","timestamp":1769854060199,"version":"3.49.0"},"reference-count":48,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["51805495"],"award-info":[{"award-number":["51805495"]}],"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":["52175490"],"award-info":[{"award-number":["52175490"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012226","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","award":["CUGGC03"],"award-info":[{"award-number":["CUGGC03"]}],"id":[{"id":"10.13039\/501100012226","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Robotics and Computer-Integrated Manufacturing"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1016\/j.rcim.2021.102277","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T08:27:16Z","timestamp":1635409636000},"page":"102277","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":116,"special_numbering":"C","title":["A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers"],"prefix":"10.1016","volume":"74","author":[{"given":"Chao","family":"Lu","sequence":"first","affiliation":[]},{"given":"Yuanxiang","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Leilei","family":"Meng","sequence":"additional","affiliation":[]},{"given":"Liang","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Biao","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jiajun","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.rcim.2021.102277_b1","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.cor.2009.06.019","article-title":"The distributed permutation flowshop scheduling problem","volume":"37","author":"Naderi","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.rcim.2021.102277_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2021.100858","article-title":"Energy-efficient distributed heterogeneous welding flow shop scheduling problem using a modified MOEA\/D","volume":"62","author":"Wang","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.rcim.2021.102277_b3","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/j.eswa.2017.09.032","article-title":"Minimizing makespan for the distributed hybrid flowshop scheduling problem with multiprocessor tasks","volume":"92","author":"Ying","year":"2018","journal-title":"Expert Syst. Appl."},{"issue":"10","key":"10.1016\/j.rcim.2021.102277_b4","doi-asserted-by":"crossref","first-page":"6687","DOI":"10.1109\/TII.2020.3043734","article-title":"Energy-efficient scheduling of distributed flow shop with heterogeneous factories: A real-world case from automobile industry in China","volume":"17","author":"Lu","year":"2021","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10.1016\/j.rcim.2021.102277_b5","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.cie.2017.07.020","article-title":"A novel chemical reaction optimization for the distributed permutation flowshop scheduling problem with makespan criterion","volume":"111","author":"Bargaoui","year":"2017","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"10.1016\/j.rcim.2021.102277_b6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/j.ijpe.2013.05.004","article-title":"An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem","volume":"145","author":"yao Wang","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.rcim.2021.102277_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2019.104894","article-title":"A distributed permutation flowshop scheduling problem with the customer order constraint","volume":"184","author":"Meng","year":"2019","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.rcim.2021.102277_b8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.eswa.2019.01.062","article-title":"Effective heuristics and metaheuristics to minimize total flowtime for the distributed permutation flowshop problem","volume":"124","author":"Pan","year":"2019","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.rcim.2021.102277_b9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/j.omega.2018.03.004","article-title":"Iterated Greedy methods for the distributed permutation flowshop scheduling problem","volume":"83","author":"Ruiz","year":"2019","journal-title":"Omega-Int. J. Manage. Sci."},{"key":"10.1016\/j.rcim.2021.102277_b10","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1016\/j.cie.2018.03.014","article-title":"The distributed permutation flow shop to minimise the total flowtime","volume":"118","author":"Fernandezviagas","year":"2018","journal-title":"Comput. Ind. Eng."},{"issue":"16","key":"10.1016\/j.rcim.2021.102277_b11","doi-asserted-by":"crossref","first-page":"5029","DOI":"10.1080\/00207543.2013.790571","article-title":"Minimising makespan in distributed permutation flowshops using a modified iterated greedy algorithm","volume":"51","author":"Lin","year":"2013","journal-title":"Int. J. Prod. Res."},{"issue":"4","key":"10.1016\/j.rcim.2021.102277_b12","first-page":"497","article-title":"A hybrid genetic algorithm for the distributed permutation flowshop scheduling problem","volume":"4","author":"Gao","year":"2011","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"10.1016\/j.rcim.2021.102277_b13","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/j.jclepro.2019.04.046","article-title":"Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint","volume":"226","author":"Fu","year":"2019","journal-title":"J. Cleaner Prod."},{"key":"10.1016\/j.rcim.2021.102277_b14","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2020.105527","article-title":"Modeling and multi-neighborhood iterated greedy algorithm for distributed hybrid flow shop scheduling problem","author":"Shao","year":"2020","journal-title":"Knowl. Based Syst."},{"key":"10.1016\/j.rcim.2021.102277_b15","doi-asserted-by":"crossref","first-page":"103540","DOI":"10.1016\/j.engappai.2020.103540","article-title":"Dynamic shuffled frog-leaping algorithm for distributed hybrid flow shop scheduling with multiprocessor tasks","volume":"90","author":"Cai","year":"2020","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"9","key":"10.1016\/j.rcim.2021.102277_b16","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1080\/0305215X.2019.1674295","article-title":"Solving distributed two-stage hybrid flowshop scheduling using a shuffled frog-leaping algorithm with memeplex grouping","volume":"52","author":"Lei","year":"2020","journal-title":"Eng. Optim."},{"key":"10.1016\/j.rcim.2021.102277_b17","series-title":"IEEE Conference on Automation Science and Engineering","first-page":"350","article-title":"An iterated greedy algorithm for distributed hybrid flowshop scheduling problem with total tardiness minimization","author":"Wang","year":"2019"},{"key":"10.1016\/j.rcim.2021.102277_b18","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","article-title":"A backtracking search hyper-heuristic for the distributed assembly flow-shop scheduling problem","volume":"36","author":"Lin","year":"2017","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"10.1016\/j.rcim.2021.102277_b19","doi-asserted-by":"crossref","first-page":"1344","DOI":"10.1109\/TASE.2018.2886303","article-title":"A Pareto-based estimation of distribution algorithm for solving multiobjective distributed no-wait flow-shop scheduling problem with sequence-dependent setup time","volume":"16","author":"Shao","year":"2019","journal-title":"IEEE Trans. Autom. Sci. Eng."},{"issue":"2","key":"10.1016\/j.rcim.2021.102277_b20","doi-asserted-by":"crossref","first-page":"1945","DOI":"10.1109\/JSYST.2018.2825337","article-title":"Local search methods for a distributed assembly no-idle flow shop scheduling problem","volume":"13","author":"Shao","year":"2018","journal-title":"IEEE Syst. J."},{"key":"10.1016\/j.rcim.2021.102277_b21","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.asoc.2014.11.022","article-title":"Minimizing makespan for flow shop scheduling problem with intermediate buffers by using hybrid approach of artificial immune system","volume":"28","author":"Abdollahpour","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.rcim.2021.102277_b22","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1016\/j.ins.2014.10.009","article-title":"Solving the large-scale hybrid flow shop scheduling problem with limited buffers by a hybrid artificial bee colony algorithm","volume":"316","author":"Li","year":"2015","journal-title":"Inform. Sci."},{"issue":"5","key":"10.1016\/j.rcim.2021.102277_b23","doi-asserted-by":"crossref","first-page":"1805","DOI":"10.1109\/TSMC.2017.2788879","article-title":"A knowledge-based cooperative algorithm for energy-efficient scheduling of distributed flow-shop","volume":"50","author":"Wang","year":"2020","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.rcim.2021.102277_b24","doi-asserted-by":"crossref","first-page":"102081","DOI":"10.1016\/j.rcim.2020.102081","article-title":"A discrete whale swarm algorithm for hybrid flow-shop scheduling problem with limited buffers","volume":"68","author":"Zhang","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.rcim.2021.102277_b25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.cor.2019.04.002","article-title":"Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion","volume":"108","author":"Zhang","year":"2019","journal-title":"Comput. Oper. Res."},{"key":"10.1016\/j.rcim.2021.102277_b26","doi-asserted-by":"crossref","first-page":"100803","DOI":"10.1016\/j.swevo.2020.100803","article-title":"Sustainable scheduling of distributed permutation flow-shop with non-identical factory using a knowledge-based multi-objective memetic optimization algorithm","volume":"60","author":"Lu","year":"2021","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.rcim.2021.102277_b27","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/j.jclepro.2017.01.011","article-title":"Energy-efficient permutation flow shop scheduling problem using a hybrid multi-objective backtracking search algorithm","volume":"144","author":"Lu","year":"2017","journal-title":"J. Cleaner Prod."},{"issue":"12","key":"10.1016\/j.rcim.2021.102277_b28","doi-asserted-by":"crossref","first-page":"5400","DOI":"10.1109\/TII.2018.2843441","article-title":"An effective multiobjective algorithm for energy-efficient scheduling in a real-life welding shop","volume":"14","author":"Li","year":"2018","journal-title":"IEEE Trans. Ind. Inf."},{"key":"10.1016\/j.rcim.2021.102277_b29","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.asoc.2018.11.043","article-title":"A multi-objective cellular grey wolf optimizer for hybrid flowshop scheduling problem considering noise pollution","volume":"75","author":"Lu","year":"2019","journal-title":"Appl. Soft Comput."},{"issue":"12","key":"10.1016\/j.rcim.2021.102277_b30","doi-asserted-by":"crossref","first-page":"4984","DOI":"10.1109\/TSMC.2019.2916088","article-title":"A three-stage multiobjective approach based on decomposition for an energy-efficient hybrid flow shop scheduling problem","volume":"50","author":"Zhang","year":"2020","journal-title":"IEEE Trans. Syst. Man Cybern.: Syst."},{"key":"10.1016\/j.rcim.2021.102277_b31","article-title":"A two-stage cooperative evolutionary algorithm with problem-specific knowledge for energy-efficient scheduling of no-wait flow-shop problem","volume":"PP","author":"Zhao","year":"2020","journal-title":"IEEE Trans. Cybern."},{"issue":"3","key":"10.1016\/j.rcim.2021.102277_b32","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1109\/TCYB.2018.2796119","article-title":"A two-phase meta-heuristic for multiobjective flexible job shop scheduling problem with total energy consumption threshold","volume":"49","author":"Lei","year":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.rcim.2021.102277_b33","first-page":"1","article-title":"A knowledge-based multiobjective memetic algorithm for green job shop scheduling with variable machining speeds","author":"Lu","year":"2021","journal-title":"IEEE Syst. J."},{"issue":"18\u201319","key":"10.1016\/j.rcim.2021.102277_b34","doi-asserted-by":"crossref","first-page":"4247","DOI":"10.1080\/00207540701450013","article-title":"Operational methods for minimization of energy consumption of manufacturing equipment","volume":"45","author":"Mouzon","year":"2007","journal-title":"Int. J. Prod. Res."},{"issue":"5","key":"10.1016\/j.rcim.2021.102277_b35","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1016\/j.rcim.2013.04.001","article-title":"Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm","volume":"29","author":"Dai","year":"2013","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"2","key":"10.1016\/j.rcim.2021.102277_b36","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ijpe.2013.01.028","article-title":"Hybrid flow shop scheduling considering machine electricity consumption cost","volume":"146","author":"Luo","year":"2013","journal-title":"Int. J. Prod. Econ."},{"key":"10.1016\/j.rcim.2021.102277_b37","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":"Min","year":"2019","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"10.1016\/j.rcim.2021.102277_b38","doi-asserted-by":"crossref","first-page":"102141","DOI":"10.1016\/j.rcim.2021.102141","article-title":"Research on intelligent workshop resource scheduling method based on improved NSGA-II algorithm","volume":"71","author":"Yuan","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"issue":"5","key":"10.1016\/j.rcim.2021.102277_b39","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":"2019","journal-title":"IEEE Trans. Cybern."},{"key":"10.1016\/j.rcim.2021.102277_b40","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.eswa.2018.04.012","article-title":"Grey wolf optimizer with cellular topological structure","volume":"107","author":"Lu","year":"2018","journal-title":"Expert Syst. Appl."},{"issue":"2","key":"10.1016\/j.rcim.2021.102277_b41","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":"3","key":"10.1016\/j.rcim.2021.102277_b42","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/322203.322213","article-title":"Flowshop scheduling with limited temporary storage","volume":"27","author":"Papadimitriou","year":"1980","journal-title":"J. Acm"},{"key":"10.1016\/j.rcim.2021.102277_b43","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.jclepro.2018.06.137","article-title":"A multi-objective approach to welding shop scheduling for makespan, noise pollution and energy consumption","volume":"196","author":"Lu","year":"2018","journal-title":"J. Cleaner Prod."},{"issue":"1","key":"10.1016\/j.rcim.2021.102277_b44","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1109\/TCYB.2017.2771213","article-title":"Evolutionary multiobjective blocking lot-streaming flow shop scheduling with machine breakdowns","volume":"49","author":"Han","year":"2019","journal-title":"IEEE Trans. Cybern."},{"issue":"2","key":"10.1016\/j.rcim.2021.102277_b45","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1162\/106365600568202","article-title":"Comparison of multiobjective evolutionary algorithms: Empirical results","volume":"8","author":"Zitzler","year":"2000","journal-title":"Evol. Comput."},{"issue":"4","key":"10.1016\/j.rcim.2021.102277_b46","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","article-title":"Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach","volume":"3","author":"Zitzler","year":"1999","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"2","key":"10.1016\/j.rcim.2021.102277_b47","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TEVC.2008.925798","article-title":"Multiobjective optimization problems with complicated Pareto sets, MOEA\/D and NSGA-II","volume":"13","author":"Li","year":"2008","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"10.1016\/j.rcim.2021.102277_b48","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1016\/j.ejor.2015.05.019","article-title":"Carbon-efficient scheduling of flow shops by multi-objective optimization","volume":"248","author":"Ding","year":"2016","journal-title":"European J. Oper. Res."}],"container-title":["Robotics and Computer-Integrated Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0736584521001575?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0736584521001575?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T16:58:19Z","timestamp":1760029099000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0736584521001575"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":48,"alternative-id":["S0736584521001575"],"URL":"https:\/\/doi.org\/10.1016\/j.rcim.2021.102277","relation":{},"ISSN":["0736-5845"],"issn-type":[{"value":"0736-5845","type":"print"}],"subject":[],"published":{"date-parts":[[2022,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Pareto-based collaborative multi-objective optimization algorithm for energy-efficient scheduling of distributed permutation flow-shop with limited buffers","name":"articletitle","label":"Article Title"},{"value":"Robotics and Computer-Integrated Manufacturing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.rcim.2021.102277","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2021 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}],"article-number":"102277"}}