{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T19:37:01Z","timestamp":1769715421876,"version":"3.49.0"},"reference-count":37,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2023,7,2]]},"abstract":"<jats:p>In this study, an energy-efficient distributed flow shop scheduling (DFSS) problem with total tardiness minimisation and machine-sequence dependent setup times is addressed. A mixed integer linear programming (MILP) model is proposed for the problem. A variant of the NSGA II algorithm is suggested for the solution of large scale problems. The proposed algorithm is compared with the state-of-the-art NSGA II, SPEA II, and multiobjective iterated local search algorithm. The computational results show that the proposed algorithm is efficient and effective for the problem. This is the first study to propose a heuristic algorithm for the distributed flow shop scheduling problem with total tardiness minimisation, speed scaling and setups.<\/jats:p>","DOI":"10.3233\/jifs-224199","type":"journal-article","created":{"date-parts":[[2023,5,9]],"date-time":"2023-05-09T17:50:43Z","timestamp":1683654643000},"page":"1209-1222","source":"Crossref","is-referenced-by-count":7,"title":["A variant of the NSGA II for the speed scaling distributed flow shop scheduling problem with total tardiness minimisation"],"prefix":"10.1177","volume":"45","author":[{"given":"Gulcin","family":"Bektur","sequence":"first","affiliation":[{"name":"Deparment of Industrial Engineering, Iskenderun Technical University, Iskenderun, Hatay, Turkey"}]}],"member":"179","reference":[{"issue":"2","key":"10.3233\/JIFS-224199_ref1","doi-asserted-by":"crossref","first-page":"3951","DOI":"10.3233\/JIFS-202963","article-title":"A memetic algorithm for energy-efficient distributed re- entrant hybrid flow shop scheduling problem","volume":"41","author":"Kaifeng","year":"2021","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"10.3233\/JIFS-224199_ref2","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":"Computers and Operations Research"},{"key":"10.3233\/JIFS-224199_ref3","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"},{"key":"10.3233\/JIFS-224199_ref4","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":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-224199_ref5","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":"Fernandez-Viagas","year":"2018","journal-title":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-224199_ref6","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 Systems with Applications"},{"key":"10.3233\/JIFS-224199_ref7","doi-asserted-by":"crossref","first-page":"105204","DOI":"10.1016\/j.cor.2020.105204","article-title":"Just-in-time scheduling for a distributed concrete precast flow shop system","volume":"129","author":"Xiong","year":"2021","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-224199_ref8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/j.knosys.2017.09.026","article-title":"Optimization of makespan for the distributed no-wait flow shop scheduling problem with iterated greedy algorithms","volume":"137","author":"Shao","year":"2017","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-224199_ref9","doi-asserted-by":"crossref","first-page":"100742","DOI":"10.1016\/j.swevo.2020.100742","article-title":"An effective iterated greedy method for the distributed permutation flowshop scheduling problem with sequence-dependent setup times","volume":"59","author":"Huang","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref10","doi-asserted-by":"crossref","first-page":"104016","DOI":"10.1016\/j.engappai.2020.104016","article-title":"Effective constructive heuristics and discrete bee colony optimization for distributed flowshop with setup times","volume":"97","author":"Huang","year":"2021","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/JIFS-224199_ref11","doi-asserted-by":"crossref","first-page":"106629","DOI":"10.1016\/j.asoc.2020.106629","article-title":"An effective iterated greedy algorithm for the distributed permutation flowshop scheduling with due Windows","volume":"96","author":"Jing","year":"2020","journal-title":"Applied Soft Computing Journal"},{"key":"10.3233\/JIFS-224199_ref12","doi-asserted-by":"crossref","first-page":"100874","DOI":"10.1016\/j.swevo.2021.100874","article-title":"An adaptive iterated greedy algorithm for distributed mixed no-idle permutation flowshop scheduling problems","volume":"63","author":"Li","year":"2021","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref13","doi-asserted-by":"crossref","first-page":"115339","DOI":"10.1016\/j.eswa.2021.115339","article-title":"Multi-objective distributed reentrant permutation flow shop scheduling with sequence-dependent setup time","volume":"183","author":"Rifai","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-224199_ref14","doi-asserted-by":"crossref","first-page":"115453","DOI":"10.1016\/j.eswa.2021.115453","article-title":"Multi-objective evalutionary algorithm based on multiple neighborhoods local search for multi-objective distributed hybrid flow shop scheduling problem","volume":"183","author":"Shao","year":"2021","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-224199_ref15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","article-title":"A compatitive memetic algorithm for multi-objective distributed permutation flow shop scheduling problem","volume":"32","author":"Deng","year":"2017","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"10.3233\/JIFS-224199_ref16","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1109\/TEM.2016.2645790","article-title":"Multiobjective discrete artificial bee colony algorithm for multiobjective permutation flow shop scheduling problem with sequence dependent setup times","volume":"64","author":"Li","year":"2017","journal-title":"IEEE Transactions on Engineering Management"},{"issue":"12","key":"10.3233\/JIFS-224199_ref17","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 Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"5","key":"10.3233\/JIFS-224199_ref18","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 Transactions on Systems, Man, and Cybernetics: Systems"},{"issue":"6","key":"10.3233\/JIFS-224199_ref19","doi-asserted-by":"crossref","first-page":"1756","DOI":"10.1080\/00207543.2018.1504251","article-title":"An improved multi-objective evolutionary algorithm based on decomposition for energy efficient permutation flow shop scheduling problem with sequence-dependent setup time","volume":"57","author":"Jiang","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"3","key":"10.3233\/JIFS-224199_ref20","first-page":"235","article-title":"A multi-objective whale swarm algorithm for energy-efficient distributed permutation flow shop scheduling problem with sequence dependent setup times","volume":"52","author":"Wang","year":"2019","journal-title":"IFAC Conference Paper Archive"},{"key":"10.3233\/JIFS-224199_ref21","doi-asserted-by":"crossref","first-page":"100858","DOI":"10.1016\/j.swevo.2021.100858","article-title":"Energy-efficient distribute heterogeneous welding flowshop scheduling problem using a modified MOEA\/ D","volume":"62","author":"Wang","year":"2021","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref22","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 and Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref23","doi-asserted-by":"crossref","first-page":"100716","DOI":"10.1016\/j.swevo.2020.100716","article-title":"Energy-efficient distributed permutation flow shop scheduling problem using a multi-objective whale swarm algorithm","volume":"57","author":"Wang","year":"2020","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref24","doi-asserted-by":"crossref","first-page":"126121","DOI":"10.1016\/j.jclepro.2021.126121","article-title":"Energy-efficient scheduling for a permutation flow shop with variable transportation time using an improved discrete whale swarm optimization","volume":"293","author":"Xin","year":"2021","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-224199_ref25","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":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-224199_ref26","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1016\/j.jclepro.2018.02.004","article-title":"Efficient multi-objective optimization algorithm for hybrid flow shop scheduling problems with setup energy consumptions","volume":"181","author":"Li","year":"2018","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-224199_ref27","doi-asserted-by":"crossref","first-page":"105088","DOI":"10.1016\/j.cor.2020.105088","article-title":"Energy aware scheduling in flexible flow shops with hybrid particle swarm optimization","volume":"125","author":"Ding","year":"2021","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-224199_ref28","doi-asserted-by":"crossref","first-page":"106431","DOI":"10.1016\/j.cie.2020.106431","article-title":"An energy-efficient bi-objective no-wait permutation flowshop scheduling problem to minimize total tardiness and total energy consumption","volume":"145","author":"Y\u00fcksel","year":"2020","journal-title":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-224199_ref29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cie.2019.07.036","article-title":"A multiobjective evolutionary algorithm based on decomposition for hybrid flowshop green scheduling problem","volume":"136","author":"Zhang","year":"2019","journal-title":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-224199_ref30","doi-asserted-by":"crossref","first-page":"113279","DOI":"10.1016\/j.eswa.2020.113279","article-title":"An energy-efficient permutation flowshop scheduling problem","volume":"150","author":"\u00d6ztop","year":"2020","journal-title":"Expert Systems with Applications"},{"key":"10.3233\/JIFS-224199_ref31","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 Journal of Operational Research"},{"key":"10.3233\/JIFS-224199_ref32","doi-asserted-by":"crossref","first-page":"100233","DOI":"10.1016\/j.jii.2021.100233","article-title":"Sustainable distributed permutation flow-shop scheduling model based on a triple bottom line concept","volume":"24","author":"Fathollahi-Fard","year":"2021","journal-title":"Journal of Industrial Information Integration"},{"key":"10.3233\/JIFS-224199_ref33","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","article-title":"Effective implementation of the \u025b-constraint method in multi-objective mathematical programming problems","volume":"213","author":"Mavrotas","year":"2009","journal-title":"Applied Mathematics and Computation"},{"issue":"2","key":"10.3233\/JIFS-224199_ref34","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","article-title":"A fast and elitist multi-objective genetic algorithm: NSGA-II","volume":"6","author":"Deb","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"10.3233\/JIFS-224199_ref35","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/j.omega.2018.01.001","article-title":"A memetic differential evolution algorithm for energy-efficient parallel machine scheduling","volume":"82","author":"Wu","year":"2019","journal-title":"Omega"},{"key":"10.3233\/JIFS-224199_ref36","doi-asserted-by":"crossref","first-page":"102117","DOI":"10.1016\/j.omega.2019.102117","article-title":"Energy-efficient no-wait permutation flow shop scheduling by adaptive multi-objective variable neighborhood search","volume":"94","author":"Wu","year":"2020","journal-title":"Omega"},{"key":"10.3233\/JIFS-224199_ref38","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.asoc.2016.11.031","article-title":"An iterated local search for the multi-objective permutation flowshop scheduling problem with sequence-dependent setup times","volume":"52","author":"Xu","year":"2017","journal-title":"Applied Soft Computing"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-224199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T08:26:18Z","timestamp":1769675178000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-224199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,2]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-224199","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,7,2]]}}}