Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2017, Article ID 9628935, 13 pages
Research Article

Combining Extended Imperialist Competitive Algorithm with a Genetic Algorithm to Solve the Distributed Integration of Process Planning and Scheduling Problem

School of Information, Zhejiang University of Finance and Economics, No. 18 Xueyuan Street, Xiasha, Hangzhou 310018, China

Correspondence should be addressed to Shuai Zhang; moc.anis@419067sz

Received 30 April 2017; Accepted 1 November 2017; Published 20 November 2017

Academic Editor: Marco Mussetta

Copyright © 2017 Shuai Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Distributed integration of process planning and scheduling (DIPPS) extends traditional integrated process planning and scheduling (IPPS) by considering the distributed features of manufacturing. In this study, we first establish a mathematical model which contains all constraints for the DIPPS problem. Then, the imperialist competitive algorithm (ICA) is extended to effectively solve the DIPPS problem by improving country structure, assimilation strategy, and adding resistance procedure. Next, the genetic algorithm (GA) is adapted to maintain the robustness of the plan and schedule after machine breakdown. Finally, we perform a two-stage experiment to prove the effectiveness and efficiency of extended ICA and GA in solving DIPPS problem with machine breakdown.