摘要
The integrated process planning and scheduling (IPPS) problem is of critical importance in achieving de-sirable performance for complex manufacturing systems. The IPPS problem is often categorized into two types, i.e., Type-I and Type-II, depending on how the process plan is represented. In recent years, sev-eral approaches have been proposed to solve the IPPS problem in the literature. However, due to the complexity of the problem, optimal solutions of some benchmark datasets still cannot be obtained in a reasonable time, and few of them can be used to simultaneously address both types of IPPS problem. To this end, this study constructs a constraint programming (CP) model considering both types of IPPS prob-lem, and proposes two basic logic-based Benders decomposition (LBBD) algorithms: one for each type of IPPS problem. In order to ensure computational efficiency, an enhanced LBBD algorithm is designed for both types of IPPS problem with three effective enhancement strategies. The performance of proposed methods is rigorously evaluated and compared with the existing approaches in the literature based on thirteen datasets. The results show that our methods significantly outperform these approaches. & COPY; 2022 Elsevier Ltd.
学科与关键词
- Decomposition algorithms for the integrated process planning and scheduling problemBarzanji, Ramin; Naderi, Bahman*; Begen, Mehmet A.OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2020, 93: 102025.被引 43
- Solving the integrated process planning and scheduling problem using an enhanced constraint programming-based approachShi, Ganquan; Yang, Zhouwang*; Xu, Yang; Quan, YuchenInternational Journal of Production Research, 2022, 60(18): 5505-5522.被引 4
- A graph-based constraint programming approach for the integrated process planning and scheduling problemZhang, Luping*; Yu, Chunxia; Wong, T. N.COMPUTERS & OPERATIONS RESEARCH, 2021, 131: 105282.被引 10
