{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T07:01:09Z","timestamp":1777705269640,"version":"3.51.4"},"reference-count":50,"publisher":"SAGE Publications","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IFS"],"published-print":{"date-parts":[[2021,3,2]]},"abstract":"<jats:p>Assembly flow shop scheduling problem with DPm\u00a0\u2192\u00a01 layout has important applications in various manufacturing systems and has been extensively considered in single factory; however, this problem with fuzzy processing time is seldom studied in multiple factories. In this paper, fuzzy distributed assembly flow shop scheduling problem (FDAFSP) is considered, in which each factory has DPm\u00a0\u2192\u00a01 layout, and an imperialist competitive algorithm with empire cooperation (ECICA) is developed to minimize fuzzy makespan. In ECICA, an adaptive empire cooperation between the strongest empire and the weakest empire is implemented by exchanging computing resources and search ability, historical evolution data are used and a new imperialist competition is adopted. Numerical experiments are conducted on various instances and ECICA is compared with the existing methods to test its performance. Computational results demonstrate that ECICA has promising advantages on solving FDAFSP.<\/jats:p>","DOI":"10.3233\/jifs-201391","type":"journal-article","created":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T20:13:07Z","timestamp":1606248787000},"page":"4545-4561","source":"Crossref","is-referenced-by-count":19,"title":["A novel imperialist competitive algorithm for fuzzy distributed assembly flow shop scheduling"],"prefix":"10.1177","volume":"40","author":[{"given":"Ming","family":"Li","sequence":"first","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bin","family":"Su","sequence":"additional","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"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-201391_ref1","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the 3-machine assembly-type flow shop scheduling problem","volume":"39","author":"Lee","year":"1993","journal-title":"Management Science"},{"issue":"2","key":"10.3233\/JIFS-201391_ref2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1080\/07408179908969812","article-title":"Scheduling the fabrication and assembly of components in a two-machine flowshop","volume":"31","author":"Cheng","year":"1999","journal-title":"IIE Transactions"},{"key":"10.3233\/JIFS-201391_ref3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.ejor.2018.04.033","article-title":"Deterministic assembly scheduling problems: a review and classification of current-type scheduling models and solution procedures","volume":"273","author":"Framinan","year":"2019","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"10.3233\/JIFS-201391_ref4","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1080\/00207543.2015.1035815","article-title":"Minimising makespan in the two-stage assembly hybrid flow shop scheduling using artificial immune systems","volume":"54","author":"Komaki","year":"2016","journal-title":"International Journal of Production Research"},{"issue":"2","key":"10.3233\/JIFS-201391_ref5","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1287\/opre.43.2.346","article-title":"The two-stage assembly scheduling problem: complexity and approximation","volume":"43","author":"Potts","year":"1995","journal-title":"Operations Research"},{"key":"10.3233\/JIFS-201391_ref6","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1016\/S0377-2217(96)00312-8","article-title":"A branch-and-bound algorithm for the two-stage assembly","volume":"103","author":"Hariri","year":"1997","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.3233\/JIFS-201391_ref7","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0305-0548(01)00098-3","article-title":"A branch and bound algorithm to minimize the total weighted flowtime for the twostage assembly scheduling problem","volume":"30","author":"Tozkapan","year":"2003","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-201391_ref8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/j.swevo.2018.01.012","article-title":"A two-stage threemachine assembly flow shop scheduling with learning consideration to minimize the flowtime by six hybrids of particle swarm optimization","volume":"41","author":"Wu","year":"2018","journal-title":"Swarm and Evolutionary Computation"},{"issue":"5","key":"10.3233\/JIFS-201391_ref9","doi-asserted-by":"crossref","first-page":"1398","DOI":"10.1080\/00207543.2018.1489156","article-title":"Hybrid branch and bound algorithms for the two-stage assembly scheduling problem with seperated setup times","volume":"57","author":"Luo","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"22","key":"10.3233\/JIFS-201391_ref10","doi-asserted-by":"crossref","first-page":"4713","DOI":"10.1080\/00207540600621029","article-title":"Evolutionary heuristics and an algorithm for the two-stage assembly scheduling problem to minimize makespan with setup times","volume":"44","author":"Allahverdi","year":"2006","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref11","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/j.ijpe.2009.03.012","article-title":"Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint","volume":"119","author":"Sung","year":"2009","journal-title":"International Journal of Prodcution Economics"},{"key":"10.3233\/JIFS-201391_ref12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/j.cor.2017.07.012","article-title":"The 2-stage assembly flowhop scheduling problem with total completion time: efficient constructive heuristic and metaheuristic","volume":"88","author":"Framinan","year":"2017","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-201391_ref13","doi-asserted-by":"crossref","first-page":"106223","DOI":"10.1016\/j.cie.2019.106223","article-title":"New efficient constructive heuristics for the twostage multi-machine assembly scheduling problem","volume":"140","author":"Talens","year":"2020","journal-title":"Computers and Industrial Eningeering"},{"issue":"19","key":"10.3233\/JIFS-201391_ref14","doi-asserted-by":"crossref","first-page":"9617","DOI":"10.1007\/s00500-018-3525-y","article-title":"Dominance rule and opposition-based particle swarm optimization for two-stage assembly scheduling with time cumulated learning effect","volume":"23","author":"Wang","year":"2019","journal-title":"Soft Computing"},{"issue":"11","key":"10.3233\/JIFS-201391_ref15","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 flowshop problem","volume":"49","author":"Shokrollahpour","year":"2011","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref16","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/j.cor.2013.10.008","article-title":"Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs","volume":"44","author":"Navaei","year":"2014","journal-title":"Computers and Operations Research"},{"key":"10.3233\/JIFS-201391_ref17","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.engappai.2017.05.004","article-title":"The two stage assembly flow-shop scheduling problem with batching and de livery","volume":"63","author":"Kazemi","year":"2017","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"10","key":"10.3233\/JIFS-201391_ref18","doi-asserted-by":"crossref","first-page":"2926","DOI":"10.1080\/00207543.2018.1550269","article-title":"Flow shop scheduling problems with assembly operations: a review and new trends","volume":"57","author":"Komaki","year":"2019","journal-title":"International Journal of Production Research"},{"issue":"14","key":"10.3233\/JIFS-201391_ref19","doi-asserted-by":"crossref","first-page":"10515","DOI":"10.1007\/s00500-019-04561-8","article-title":"A two-stage three-machine assembly scheduling problem with a truncation position-based learning effect","volume":"24","author":"Azzouz","year":"2019","journal-title":"Soft Computing"},{"issue":"6","key":"10.3233\/JIFS-201391_ref20","first-page":"2275","article-title":"Three meta-heuristics to solve the no-wait two-stage assembly flowshop scheduling problem","volume":"20","author":"Mozdgir","year":"2013","journal-title":"Scientia Iranica"},{"key":"10.3233\/JIFS-201391_ref21","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10845-013-0775-5","article-title":"The two stage assembly flowshop scheduling problem to minimize total tardiness","volume":"26","author":"Allahverdi","year":"2015","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.3233\/JIFS-201391_ref22","doi-asserted-by":"crossref","first-page":"7796","DOI":"10.1016\/j.apm.2016.03.037","article-title":"Two-stage assembly scheduling problem for minimizing total tardiness with setup times","volume":"40","author":"Allahverdi","year":"2016","journal-title":"Applied Mathematical Modelling"},{"key":"10.3233\/JIFS-201391_ref23","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.cie.2016.12.030","article-title":"Two-stage assembly scheduling problem for processing products with dynamic componentsizes and a setup time","volume":"104","author":"Jung","year":"2017","journal-title":"Computers and Industrial Engineering"},{"key":"10.3233\/JIFS-201391_ref24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/j.cie.2018.09.035","article-title":"Bi-level genetic algorithms for a two-stage assembly flow-shop scheduling with batch delivery system","volume":"126","author":"Basir","year":"2018","journal-title":"Computers and Industrial Engineering"},{"issue":"9","key":"10.3233\/JIFS-201391_ref25","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1080\/00207543.2014.884290","article-title":"Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time","volume":"52","author":"Xiong","year":"2014","journal-title":"International Journal of Production Research"},{"issue":"12","key":"10.3233\/JIFS-201391_ref26","doi-asserted-by":"crossref","first-page":"3561","DOI":"10.1080\/00207543.2015.1084063","article-title":"A competitive memetic algorithm for the distributed two-stage assembly flow-shop scheduling problem","volume":"54","author":"Deng","year":"2016","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref27","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/j.ijpe.2015.07.027","article-title":"Heuristic and metaheuristics for the distributed assembly permutaiton flowshop scheduling problem with sequence dependent setup times","volume":"169","author":"Hatami","year":"2015","journal-title":"Interational Journal of Production Economics"},{"key":"10.3233\/JIFS-201391_ref28","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.cie.2016.05.005","article-title":"An effective hybrid biogeography-based optimization algorithm for the distributed assembly permutation flow-shop scheduling problem","volume":"97","author":"Lin","year":"2016","journal-title":"Computers and Industrial Engineering"},{"issue":"1","key":"10.3233\/JIFS-201391_ref29","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1109\/TSMC.2015.2416127","article-title":"An estimation of distribution algorithm-based memetic algorithm for the distributed assembly permutation flow-shop scheduling problem","volume":"46","author":"Wang","year":"2016","journal-title":"IEEE Transactions on Systems, Man and Cybernetics: Systems"},{"issue":"9","key":"10.3233\/JIFS-201391_ref30","doi-asserted-by":"crossref","first-page":"3226","DOI":"10.1080\/00207543.2017.1401241","article-title":"Scheduling distributed flowshops with flexible assembly and set-up time to minimise makespan","volume":"56","author":"Zhang","year":"2018","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref31","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/j.swevo.2018.12.001","article-title":"Effective invasive weed optimization algorithms for distributed assembly permutation flowshop problem with total flowtime criterion","volume":"44","author":"Sang","year":"2019","journal-title":"Swarm and Evolutionary Computation"},{"key":"10.3233\/JIFS-201391_ref32","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.swevo.2017.04.007","article-title":"A backtracting search hyperheuristic for the distributed assembly flow-shop scheduling problem","volume":"36","author":"Lin","year":"2017","journal-title":"Swarm and Evolutionary Computation"},{"issue":"2","key":"10.3233\/JIFS-201391_ref33","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":"2019","journal-title":"IEEE Systems Journal"},{"issue":"3","key":"10.3233\/JIFS-201391_ref34","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1111\/itor.12719","article-title":"A biased-randomized iterated local search for the distributed assembly permutation flow-shop problem","volume":"27","author":"Ferone","year":"2020","journal-title":"Intrnational Transactions in Operational Research"},{"key":"10.3233\/JIFS-201391_ref35","doi-asserted-by":"crossref","first-page":"105492","DOI":"10.1016\/j.asoc.2019.105492","article-title":"Effective constructive heuristics and meta-heuristics for the distributed assembly permutation flowshop scheduling problem","volume":"81","author":"Pan","year":"2019","journal-title":"Applied Soft Computing"},{"issue":"1","key":"10.3233\/JIFS-201391_ref36","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0360-8352(02)00078-5","article-title":"Integrated process planning and scheduling with minimizing total tardiness in multi-plants supply chain","volume":"43","author":"Moon","year":"2002","journal-title":"Computers and Industrial Engineering"},{"issue":"1-2","key":"10.3233\/JIFS-201391_ref37","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 Manufacturing Technology"},{"issue":"1","key":"10.3233\/JIFS-201391_ref38","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1016\/j.ijpe.2012.11.005","article-title":"Chemical-reaction optimization for solving fuzzy job-shop scheduling problem with flexible maintenance activities","volume":"145","author":"Li","year":"2013","journal-title":"International Journal of Production Economics"},{"issue":"12","key":"10.3233\/JIFS-201391_ref39","doi-asserted-by":"crossref","first-page":"3593","DOI":"10.1080\/00207543.2012.754549","article-title":"A hybrid artificial bee colony algorithm for the fuzzy flexible job-shop scheduling problem","volume":"51","author":"Wang","year":"2013","journal-title":"International Journal of Production Research"},{"issue":"6","key":"10.3233\/JIFS-201391_ref40","doi-asserted-by":"crossref","first-page":"1639","DOI":"10.1080\/00207543.2011.575412","article-title":"Swarm-based neighbourhood search algorithm for fuzzy flexible job shop scheduling","volume":"50","author":"Lei","year":"2012","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref41","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1016\/j.jclepro.2016.12.044","article-title":"Minimizing energy consumption and tardiness penalty for fuzzy flow shop scheduling with state-dependent setup time","volume":"147","author":"Liu","year":"2017","journal-title":"Journal of Cleaner Production"},{"key":"10.3233\/JIFS-201391_ref42","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.engappai.2018.10.008","article-title":"Backtracking search based hyper-heuristic for the flexible job-shop scheduling problem with fuzzy processing time","volume":"77","author":"Lin","year":"2019","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"10.3233\/JIFS-201391_ref43","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/j.cie.2018.11.046","article-title":"A hybrid multi-verse optimization for the fuzzy flexible job-shop scheduling problem","volume":"127","author":"Lin","year":"2019","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"10.3233\/JIFS-201391_ref44","doi-asserted-by":"crossref","first-page":"3189","DOI":"10.3233\/JIFS-191175","article-title":"Fuzzy distributed two-stage hybrid flow shop scheduling problem with setup time: collaborative variable search","volume":"38","author":"Cai","year":"2020","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"10.3233\/JIFS-201391_ref45","doi-asserted-by":"crossref","first-page":"105536","DOI":"10.1016\/j.knosys.2020.105536","article-title":"A cooperative coevolution algorithm for multi-objective fuzzy distributed hybrid flow shop","volume":"194","author":"Zheng","year":"2020","journal-title":"Knowledge-Based Systems"},{"key":"10.3233\/JIFS-201391_ref47","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"},{"issue":"3","key":"10.3233\/JIFS-201391_ref48","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1109\/TCYB.2018.2796119","article-title":"A two-phase meta-heuristic for multi-objective flexible job shop scheduling problem with total energy consumption threshold","volume":"49","author":"Lei","year":"2019","journal-title":"IEEE Transactions on Cybernetics"},{"issue":"2","key":"10.3233\/JIFS-201391_ref49","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/00207543.2019.1598596","article-title":"An imperialist competitive algorithm with memory for distributed unrelated parallel machines scheduling","volume":"58","author":"Lei","year":"2020","journal-title":"International Journal of Production Research"},{"key":"10.3233\/JIFS-201391_ref50","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 and Evolutionary Computation"},{"issue":"11","key":"10.3233\/JIFS-201391_ref51","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"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-201391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:43:22Z","timestamp":1777455802000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-201391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,2]]},"references-count":50,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.3233\/jifs-201391","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,2]]}}}