An imperialist competitive algorithm for distributed assembly flowshop scheduling with Pm → 1 layout and transportation

Abstract

Distributed assembly flow shop scheduling problem (DAFSP) has been extensively considered; however, DAFSP with Pm → 1 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.