{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T18:51:23Z","timestamp":1769712683273,"version":"3.49.0"},"reference-count":46,"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>Distributed assembly flow shop scheduling problem (DAFSP) has been extensively considered; however, DAFSP with Pm\u00a0\u2192\u00a01 layout, in which m parallel machines are at fabrication stage and one machine is at assembly stage, is seldom handled. In this study, DAFSP with the above layout and transportation time is studied and an imperialist competitive algorithm with cooperation and division (CDICA) is presented to minimize makespan. Feature of the problem is used and a heuristic is applied to produce initial solution. Adaptive assimilation and evolution are executed in the weakest empire and adaptive cooperation is implemented between the winning empire and the weakest empire in imperialist competition process. Empire division is performed when a given condition is met. Many experiments are conducted. The computational results demonstrate that new strategies are effective and CDICA is a very competitive in solving the considered DAFSP.<\/jats:p>","DOI":"10.3233\/jifs-223929","type":"journal-article","created":{"date-parts":[[2023,4,25]],"date-time":"2023-04-25T12:28:01Z","timestamp":1682425681000},"page":"269-284","source":"Crossref","is-referenced-by-count":2,"title":["An imperialist competitive algorithm for distributed assembly flowshop scheduling with Pm\u00a0\u2192\u00a01 layout and transportation"],"prefix":"10.1177","volume":"45","author":[{"given":"Deming","family":"Lei","sequence":"first","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}]},{"given":"Haoyang","family":"Du","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}]},{"given":"Hongtao","family":"Tang","sequence":"additional","affiliation":[{"name":"School of Automation, Wuhan University of Technology, Wuhan, China"}]}],"member":"179","reference":[{"key":"10.3233\/JIFS-223929_ref1","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.cor.2014.02.005","article-title":"Minimizing thetotal completion time in a distributed two stage assembly systemwith setup times","volume":"47","author":"Xiong","year":"2014","journal-title":"Comput. Oper. Res"},{"issue":"9","key":"10.3233\/JIFS-223929_ref2","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1080\/00207543.2014.884290","article-title":"Meta-heuristics for the distributedtwo-stage assembly scheduling problem with bi-criteria of makespanand mean completion time","volume":"52","author":"Xiong","year":"2014","journal-title":"Int. J. Prod. Res"},{"issue":"12","key":"10.3233\/JIFS-223929_ref3","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":"Int. J. Prod. Res"},{"key":"10.3233\/JIFS-223929_ref4","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.cie.2018.09.007","article-title":"Memetic social spider optimization algorithm for scheduling two-stage assembly flowshop in adistributed environment","volume":"125","author":"Zhang","year":"2018","journal-title":"Comput. Ind. Eng"},{"issue":"23","key":"10.3233\/JIFS-223929_ref5","doi-asserted-by":"crossref","first-page":"7232","DOI":"10.1080\/00207543.2020.1836422","article-title":"Cooperated teaching-learning-based optimisation for distributed two-stage assembly flow shop scheduling","volume":"59","author":"Lei","year":"2021","journal-title":"Int. J. Prod. Res"},{"issue":"3","key":"10.3233\/JIFS-223929_ref6","doi-asserted-by":"crossref","first-page":"4545","DOI":"10.3233\/JIFS-201391","article-title":"A novel imperialist competitive algorithm for fuzzy distributed assembly flow shop scheduling","volume":"40","author":"Li","year":"2021","journal-title":"J. Intell. Fuzzy Syst"},{"issue":"2022","key":"10.3233\/JIFS-223929_ref8","first-page":"1568","article-title":"An adaptive artificial bee colonywith reinforcement learning for distributed three-stage assembly schduling with maintenance","volume":"117","author":"Wang","year":"2022","journal-title":"Appl. Soft Comput"},{"key":"10.3233\/JIFS-223929_ref9","doi-asserted-by":"crossref","first-page":"4647","DOI":"10.1007\/s10489-020-01809-x","article-title":"Effective constructive heuristicand metaheuristic for the distributed assembly blocking flow-shop scheduling problem","volume":"50","author":"Shao","year":"2020","journal-title":"Appl. Int"},{"key":"10.3233\/JIFS-223929_ref10","doi-asserted-by":"crossref","first-page":"107750","DOI":"10.1016\/j.asoc.2021.107750","article-title":"An optimal block knowledge driven backtracking search algorithm for distributed assembly No-wait flow shop scheduling problem","volume":"112","author":"Zhao","year":"2021","journal-title":"Appl. Soft Comput"},{"key":"10.3233\/JIFS-223929_ref11","doi-asserted-by":"crossref","first-page":"3226","DOI":"10.1080\/00207543.2017.1401241","article-title":"Scheduling distributed flowshops withflexible assembly and set-up time to minimise makespan","volume":"56","author":"Zhang","year":"2018","journal-title":"Int. J.Prod. Res"},{"issue":"6","key":"10.3233\/JIFS-223929_ref12","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/0951192X.2015.1099074","article-title":"Graph colouring-based algorithm to parallel jobsscheduling on parallel factories","volume":"29","author":"Behnamian","year":"2016","journal-title":"Int. J. Comput. Integ. M"},{"issue":"2","key":"10.3233\/JIFS-223929_ref13","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":"Int. J. Prod. Res"},{"key":"10.3233\/JIFS-223929_ref14","doi-asserted-by":"crossref","first-page":"0360","DOI":"10.1016\/j.cie.2020.106320","article-title":"An artificial bee colony with division for distributed unrelated parallel machine scheduling with preventive maintenance","volume":"141","author":"Lei","year":"2020","journal-title":"Comput. Ind. Eng"},{"key":"10.3233\/JIFS-223929_ref15","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.swevo.2016.06.002","article-title":"A competitive memetic algorithm formulti-objective distributed permutation flow shop scheduling problem","volume":"32","author":"Deng","year":"2017","journal-title":"Swarm Evol. Comput"},{"issue":"1","key":"10.3233\/JIFS-223929_ref16","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.asoc.2015.11.034","article-title":"Multi-objective adaptive large neighborhood search for distributed reentrant permutation flowshop scheduling","volume":"40","author":"Rifai","year":"2016","journal-title":"Appl. Soft Comput"},{"issue":"2022","key":"10.3233\/JIFS-223929_ref17","first-page":"0360","article-title":"Animproved iterated greedy algorithm for distributed robotic flowshopscheduling with order constraints","volume":"164","author":"Li","year":"2022","journal-title":"Comput. Ind. Eng"},{"issue":"2","key":"10.3233\/JIFS-223929_ref19","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":"Geng","year":"2021","journal-title":"J.Intell. Fuzzy Syst"},{"issue":"2","key":"10.3233\/JIFS-223929_ref20","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/j.cie.2016.07.027","article-title":"Minimizing makespan for solving the distributed no-wait flowshop scheduling problem","volume":"99","author":"Lin","year":"2016","journal-title":"Comput. Ind.Eng"},{"issue":"6","key":"10.3233\/JIFS-223929_ref21","doi-asserted-by":"crossref","first-page":"2425","DOI":"10.1109\/TCYB.2019.2943606","article-title":"Hybrid artificial bee colony algorithm for a parallel batching distributed flow-shop problem with deteriorating jobs","volume":"50","author":"Li","year":"2020","journal-title":"IEEETrans. Cyber"},{"key":"10.3233\/JIFS-223929_ref22","doi-asserted-by":"crossref","first-page":"214209","DOI":"10.1109\/ACCESS.2020.3041369","article-title":"Fuzzy distributed hybrid flow shop scheduling problem with heterogeneous factory and unrelated parallel machine: a shuffled frog leaping algorithm with collaboration of multiple search strategies","volume":"8","author":"Wang","year":"2020","journal-title":"IEEE Access"},{"issue":"3","key":"10.3233\/JIFS-223929_ref23","doi-asserted-by":"crossref","first-page":"1368","DOI":"10.1111\/itor.12719","article-title":"Abiased-randomized iterated local search for the distributed assembly permutation flow-shop problem","volume":"27","author":"Ferone","year":"2020","journal-title":"Int. T. Oper. Res"},{"key":"10.3233\/JIFS-223929_ref24","doi-asserted-by":"crossref","first-page":"96115","DOI":"10.1109\/ACCESS.2020.2996305","article-title":"Memetic algorithm with meta-lamarckian learning and simplex search for distributed flexible assembly permutation flowshop scheduling problem","volume":"8","author":"Zhang","year":"2020","journal-title":"IEEE Access"},{"issue":"2","key":"10.3233\/JIFS-223929_ref25","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 hybridflow shop","volume":"65","author":"Lei","year":"2018","journal-title":"IEEE Trans. Eng. Manage"},{"issue":"5","key":"10.3233\/JIFS-223929_ref27","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1007\/s10489-018-1343-7","article-title":"A novel dynamic assignment rule for the distributed job shop scheduling problem using a hybridant-based algorithm","volume":"49","author":"Chaouch","year":"2019","journal-title":"Appl. Intell"},{"issue":"5","key":"10.3233\/JIFS-223929_ref29","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1007\/s10489-018-1343-7","article-title":"A novel dynamic assignment rule for the distributed job shop scheduling problemusing a hybrid ant-based algorithm","volume":"49","author":"Chaouch","year":"2019","journal-title":"Appl. Intell"},{"key":"10.3233\/JIFS-223929_ref30","doi-asserted-by":"crossref","first-page":"107349","DOI":"10.1016\/j.asoc.2021.107349","article-title":"A discrete spotted hyena optimizer for solvingdistributed job shop scheduling problems","volume":"106","author":"Sahman","year":"2021","journal-title":"Appl. Soft Comput"},{"key":"10.3233\/JIFS-223929_ref31","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1287\/mnsc.39.5.616","article-title":"Minimizing the makespan in the3-machine assembly-type flow shop scheduling problem","volume":"39","author":"Lee","year":"1993","journal-title":"Manage.Sci"},{"issue":"2","key":"10.3233\/JIFS-223929_ref32","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 Trans"},{"key":"10.3233\/JIFS-223929_ref33","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":"Euro. J. Oper. Res."},{"issue":"10","key":"10.3233\/JIFS-223929_ref34","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":"Int. J. Prod. Res."},{"issue":"2014","key":"10.3233\/JIFS-223929_ref35","doi-asserted-by":"crossref","first-page":"1078","DOI":"10.1016\/j.asoc.2014.08.024","article-title":"A survery on the imperialist competitive algorithm metaheuristic in engineering domain and directions for future research","volume":"24","author":"Hosseini","year":"2014","journal-title":"Appl. Soft Comput"},{"key":"10.3233\/JIFS-223929_ref36","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 Evol. Comput"},{"issue":"3","key":"10.3233\/JIFS-223929_ref37","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 totalenergy consumption threshold","volume":"49","author":"Lei","year":"2019","journal-title":"IEEE Trans. Cyber"},{"key":"10.3233\/JIFS-223929_ref38","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 inflexibe job shop","volume":"7","author":"Li","year":"2019","journal-title":"IEEE Access"},{"key":"10.3233\/JIFS-223929_ref39","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":"Int. J. Prod. Res"},{"key":"10.3233\/JIFS-223929_ref40","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":"Appl. Math. Model"},{"key":"10.3233\/JIFS-223929_ref41","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-stageassembly flow shop problem","volume":"52","author":"Seidgar","year":"2014","journal-title":"Int. J. Prod. Res"},{"issue":"4","key":"10.3233\/JIFS-223929_ref42","doi-asserted-by":"crossref","first-page":"647","DOI":"10.1016\/j.jmsy.2014.06.002","article-title":"A model and imperialist competitivealgorithm for hybrid flow shops with sublots and setup times","volume":"33","author":"Naderi","year":"2014","journal-title":"J. Manuf. Syst"},{"key":"10.3233\/JIFS-223929_ref43","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 modelsand a hybrid imperialist competitive algorithm","volume":"41","author":"Karimi","year":"2017","journal-title":"Appl. Math.Model"},{"issue":"2017","key":"10.3233\/JIFS-223929_ref44","first-page":"449","article-title":"Flexible job shopscheduling under condition-based maintenance: improved version of imperialist competitive algorithm","volume":"58","author":"Zandieh","journal-title":"Appl. Soft Comput"},{"issue":"5","key":"10.3233\/JIFS-223929_ref45","doi-asserted-by":"crossref","first-page":"944","DOI":"10.1108\/AA-10-2018-0165","article-title":"Robustscheduling 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 Autom"},{"issue":"2","key":"10.3233\/JIFS-223929_ref46","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":"Int. J. Prod. Res"},{"issue":"6","key":"10.3233\/JIFS-223929_ref47","doi-asserted-by":"crossref","first-page":"12125","DOI":"10.3233\/JIFS-210198","article-title":"Two-phase imperialist competitive algorithm for energy-efficient flexible job shop scheduling,5","volume":"40","author":"Guo","year":"2021","journal-title":"J.Intell. Fuzzy Syst"},{"issue":"3","key":"10.3233\/JIFS-223929_ref48","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1080\/00207543.2018.1481301","article-title":"Integrated multi-factory productionand distributed scheduling applying vehicle routing approach","volume":"57","author":"Marandi","year":"2019","journal-title":"Int. J. Prod. Res"},{"issue":"1","key":"10.3233\/JIFS-223929_ref49","first-page":"1","article-title":"A new imperialist competitive algorithm for multiobjective low carbon parallel machines scheduling","volume":"2018","author":"Pan","year":"2018","journal-title":"Math. Probl. Eng"},{"issue":"1","key":"10.3233\/JIFS-223929_ref50","doi-asserted-by":"crossref","first-page":"2199","DOI":"10.1007\/s40747-020-00193-w","article-title":"Discrete imperialist competitive algorithm for the resource-constrained hybrid flow shop problem with energy consumption","volume":"7","author":"Tao","year":"2021","journal-title":"Complex Intell. Syst"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/JIFS-223929","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,29]],"date-time":"2026-01-29T06:54:27Z","timestamp":1769669667000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/JIFS-223929"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,2]]},"references-count":46,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/jifs-223929","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]]}}}