{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:53:50Z","timestamp":1777704830263,"version":"3.51.4"},"reference-count":39,"publisher":"SAGE Publications","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,6,21]]},"abstract":"<jats:p>Energy-efficient flexible job shop scheduling problems (EFJSP) have been investigated fully; however, energy-related objectives often have lower importance than other ones in many real-life situations and this case is hardly considered in the previous works. In this study, EFJSP with sequence-dependent setup times (SDST) is considered, in which total tardiness and makespan are given higher importance than total energy consumption. A two-phase imperialist competitive algorithm (TPICA) is proposed. The importance difference among objectives is implemented by treating all objectives equally in the first phase and making energy consumption not to exceed a diminishing threshold in the second phase. A dynamical differentiating assimilation and a novel imperialist competition with the enforced search are implemented. Extensive experiments are conducted and the computational results show that TPICA is very competitive for EFJSP with SDST.<\/jats:p>","DOI":"10.3233\/jifs-210198","type":"journal-article","created":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T04:51:16Z","timestamp":1620190276000},"page":"12125-12137","source":"Crossref","is-referenced-by-count":7,"title":["Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling"],"prefix":"10.1177","volume":"40","author":[{"given":"Jiong","family":"Guo","sequence":"first","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deming","family":"Lei","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ming","family":"Li","sequence":"additional","affiliation":[{"name":"School of Economics and Management, Anhui Polytechnic University, Wuhu, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-210198_ref1","doi-asserted-by":"crossref","first-page":"552","DOI":"10.1016\/j.jclepro.2017.07.102","article-title":"A dynamic control approach for energy-efficient production scheduling on single machine under time-varying electricity pricing","volume":"165","author":"Lee","year":"2017","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref2","first-page":"172","article-title":"Energy-efficient bi-objective single-machine scheduling with power-down mechanism","volume":"85","author":"Che","year":"2017","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-210198_ref3","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/j.jclepro.2018.05.056","article-title":"Bi-objective identical parallel machine scheduling to minimize total energy consumption and makespan","volume":"193","author":"Wang","year":"2018","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref4","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-210198_ref5","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":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref6","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-210198_ref7","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TEM.2017.2774281","article-title":"A novel teaching-learning-based optimization algorithm for energy-efficient scheduling in hybrid flow shop","volume":"65","author":"Lei","year":"2018","journal-title":"IEEE Transactions on Engineering Management"},{"key":"10.3233\/JIFS-210198_ref8","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.swevo.2019.05.006","article-title":"Two-level imperialist competitive algorithm for energy-efficient hybrid flow shop scheduling problem with relative importance of objectives","volume":"49","author":"Li","year":"2019","journal-title":"Swarm Evolutionary Computation"},{"key":"10.3233\/JIFS-210198_ref9","doi-asserted-by":"crossref","first-page":"77746","DOI":"10.1109\/ACCESS.2020.2990338","article-title":"Ant lion optimization: variants, hybrids, and applications","volume":"8","author":"Assiri","year":"2020","journal-title":"IEEE Access"},{"issue":"10","key":"10.3233\/JIFS-210198_ref11","doi-asserted-by":"crossref","first-page":"1821","DOI":"10.3390\/math8101821","article-title":"Binary whale optimization algorithm for dimensionality reduction","volume":"8","author":"Hussien","year":"2020","journal-title":"Mathe"},{"key":"10.3233\/JIFS-210198_ref12","doi-asserted-by":"crossref","first-page":"173548","DOI":"10.1109\/ACCESS.2020.3024108","article-title":"Crow search algorithm: theory, recent advances, and applications","volume":"8","author":"Hussien","year":"2020","journal-title":"IEEE Access"},{"key":"10.3233\/JIFS-210198_ref14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.3390\/a13120345","article-title":"Nature-inspired optimization algorithms for text document clustering\u0105\u0142a comprehensive analysis","volume":"(13)","author":"Abualigah","year":"2020","journal-title":"Algorithms"},{"key":"10.3233\/JIFS-210198_ref15","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/j.jclepro.2014.10.006","article-title":"An energy-responsive optimization method for machine tool selection and operation sequence in flexible machining job shops","volume":"87","author":"He","year":"2015","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref16","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.suscom.2016.11.002","article-title":"A novel mathematical model and multi-objective method for the low-carbon flexible job shop scheduling problem","volume":"13","author":"Yin","year":"2017","journal-title":"Sustainable Computing informatics and Systems"},{"key":"10.3233\/JIFS-210198_ref17","doi-asserted-by":"crossref","first-page":"3126","DOI":"10.1080\/00207543.2016.1262082","article-title":"A shuffled frog leaping algorithm for flexible job shop scheduling with the consideration of energy consumption","volume":"55","author":"Lei","year":"2017","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-210198_ref18","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.compchemeng.2017.05.004","article-title":"An energy-efficient multi-objective optimization for flexible job-shop scheduling problem","volume":"104","author":"Mokhtari","year":"2017","journal-title":"Computers and Chemical Engineering"},{"key":"10.3233\/JIFS-210198_ref19","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.jclepro.2017.09.037","article-title":"A hybrid fruit fly algorithm for solving flexible job-shop scheduling to reduce manufacturing manufacturing carbon footprint","volume":"68","author":"Liu","year":"2017","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref20","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.jclepro.2018.03.254","article-title":"A two-stage optimization method for energy-saving flexible job-shop scheduling based on energy dynamic characterization","volume":"188","author":"Wang","year":"2018","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-210198_ref21","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.resconrec.2016.12.001","article-title":"Minimizing total carbon footprint and total late work criterion in flexible job shop scheduling by using an improved multi-objective genetic algorithm","volume":"128","author":"Piroozfard","year":"2018","journal-title":"Resources Conservation and Recycling"},{"issue":"3","key":"10.3233\/JIFS-210198_ref22","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 Transactions on Cybernetics"},{"key":"10.3233\/JIFS-210198_ref23","doi-asserted-by":"crossref","first-page":"29553","DOI":"10.1109\/ACCESS.2019.2895348","article-title":"An imperialist competitive algorithm with the diversified operators for many-objective scheduling in flexibe job shop","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"10.3233\/JIFS-210198_ref24","doi-asserted-by":"crossref","first-page":"106863","DOI":"10.1016\/j.cie.2020.106863","article-title":"An effective backtracking search algorithm for multi-objective flexible job shop scheduling considering new job arrivals and energy consumption","volume":"149","author":"Caldeira","year":"2020","journal-title":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-210198_ref25","doi-asserted-by":"crossref","first-page":"44","DOI":"10.3390\/a13020044","article-title":"Modified migrating birds optimization for energy-aware flexible job shop scheduling problem","volume":"13","author":"Li","year":"2020","journal-title":"Algorithms"},{"key":"10.3233\/JIFS-210198_ref27","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1016\/j.amc.2015.03.059","article-title":"A neighborhood search function for flexible job shop scheduling with separable sequence-dependent setup times","volume":"260","author":"Abdelmaguid","year":"2015","journal-title":"Applied Mathematic and Computation"},{"key":"10.3233\/JIFS-210198_ref28","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ejor.2017.08.021","article-title":"Solving the flexible job shop scheduling problem with sequence-dependent setup times","volume":"265","author":"Shen","year":"2018","journal-title":"European Journal of Operational Research"},{"key":"10.3233\/JIFS-210198_ref29","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.procs.2017.08.023","article-title":"A self-adaptive hybrid algorithm for solving flexible job-shop problem with sequence dependent setup time","volume":"112","author":"Azzouz","year":"2017","journal-title":"Procedia Computer Science"},{"key":"10.3233\/JIFS-210198_ref30","doi-asserted-by":"crossref","first-page":"3087","DOI":"10.1080\/00207540903536155","article-title":"A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flow shop problem","volume":"49","author":"Shokrollahpour","year":"2011","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-210198_ref31","doi-asserted-by":"crossref","first-page":"9603","DOI":"10.1016\/j.apm.2013.05.002","article-title":"A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop","volume":"37","author":"Goldansaz","year":"2013","journal-title":"Applied Mathematical Modelling"},{"key":"10.3233\/JIFS-210198_ref32","doi-asserted-by":"crossref","first-page":"1240","DOI":"10.1080\/00207543.2013.848490","article-title":"An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem","volume":"52","author":"Seidgar","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"4","key":"10.3233\/JIFS-210198_ref33","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.jmsy.2014.06.002","article-title":"A model and imperialist competitive algorithm for hybrid flow shops with sublots and setup times","volume":"33","author":"Naderi","year":"2014","journal-title":"J Manuf Syst"},{"key":"10.3233\/JIFS-210198_ref34","doi-asserted-by":"crossref","first-page":"667","DOI":"10.1016\/j.apm.2016.09.022","article-title":"Scheduling flexible job-shops with transportation times: mathematical models and a hybrid imperialist competitive algorithm","volume":"41","author":"Karimi","year":"2017","journal-title":"Applied Mathematical Modelling"},{"key":"10.3233\/JIFS-210198_ref35","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/j.asoc.2017.04.060","article-title":"Flexible job shop scheduling under condition-based maintenance: improved version of imperialist competitive algorithm","volume":"58","author":"Zandieh","year":"2017","journal-title":"Applied Soft Computing"},{"issue":"5","key":"10.3233\/JIFS-210198_ref36","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1108\/AA-10-2018-0165","article-title":"Robust scheduling in two-stage assembly flow shop with random breakdowns: integrated meta-heuristic algorithms and simulation approach","volume":"39","author":"Tadayonirad","year":"2019","journal-title":"Assembly Automation"},{"issue":"2","key":"10.3233\/JIFS-210198_ref37","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/00207543.2019.1598596","article-title":"An imperialist competitive algorithm with memory for distributed parallel machines scheduling","volume":"58","author":"Lei","year":"2020","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-210198_ref38","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":"Annals of Operations Research"},{"key":"10.3233\/JIFS-210198_ref39","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":"Annals of Operations Research"},{"key":"10.3233\/JIFS-210198_ref42","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/s00170-007-0945-8","article-title":"Pareto archive particle swarm optimization for multi-objective fuzzy job shop scheduling problems","volume":"37","author":"Lei","year":"2008","journal-title":"International Journal of Advanced Manufacuring Technology"},{"key":"10.3233\/JIFS-210198_ref43","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/j.cor.2016.03.009","article-title":"A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithm","volume":"73","author":"Ahmadi","year":"2016","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.3233\/JIFS-210198_ref44","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1109\/TASE.2013.2274517","article-title":"Multiobjective flexible job shop scheduling using memetic algorithms","volume":"12","author":"Yuan","year":"2015","journal-title":"IEEE Transactions on Automation Science and Engineering"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-210198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:42:07Z","timestamp":1777455727000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-210198"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,21]]},"references-count":39,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.3233\/jifs-210198","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,21]]}}}