Abstract
Assembly flow shop scheduling problem with DPm → 1 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 → 1 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
