A Modified Genetic Algorithm With New Encoding and Decoding Methods for Integrated Process Planning and Scheduling Problem

Due to the complementarity of the process planning and shop scheduling, their integration can greatly facilitate the development of the intelligent manufacturing system. In the last decade, the integrated process planning and scheduling (IPPS) problem has become a research hotspot in the manufacturing system area. It is an NP-hard problem and is more complicated than the job shop scheduling problem. Although some progress has been obtained in the IPPS field, there are still many unsolved open problems. In this article, the novel integrated encoding and decoding methods are proposed by considering the OR-node of the process network graph. Moreover, a modified genetic algorithm (MGA) is designed based on the proposed coding methods. The process planning and the scheduling parts can be represented simultaneously in one individual. As for the precedence constraints between operations, the specifically designed operators are able to guarantee the feasibility of the operation sequence during the searching procedure. Then, the superiority of MGA is verified by updating nine new records on 37 well-known open problems, four of them reach their lower bounds. In addition, the proposed algorithm is also tested on a real-world case from a nonstandard equipment workshop in a Chinese machine tool company, which produces a common module of a packaging machine. The results show that the proposed MGA can solve the real-world case better than the comparative algorithms.

Automated summary

This article introduces the integration of process planning and shop scheduling, proposes a new encoding and decoding method, and designs an improved genetic algorithm to solve the integrated process planning and scheduling (IPPS) problem. The effectiveness of the proposed algorithm is validated through testing on practical cases in multiple domains.