摘要
In this paper, we focus on exact methods to solve the preemptive flexible job-shop scheduling problem with makespan minimisation objective function. Mathematical and constraint programming models enable the resolution of this problem for small instances. However, as an NP-hard problem, the cost of solving grows rapidly when considering larger instances. In this regard, we propose a logic-based Benders decomposition that relies on an efficient branch-and-bound procedure to solve the subproblem representing a pure (non-flexible) preemptive job-shop scheduling problem. Computational experiments are carried out and show the very good performance of our proposals.
学科与关键词
关键词
Flexible job-shop schedulingPreemptionBenders decompositionMixed-integer programmingConstraint programming
- 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 flexible job shop scheduling problem with sequence-dependent setup timesShen, Liji*; Dauzere-Peres, Stephane; Neufeld, Janis S.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 265(2): 503-516.被引 151
- Constraint programming and logic-based Benders decomposition for the integrated process planning and scheduling problemZhu, Xuedong; Son, Junbo; Zhang, Xi; Wu, Jianguo*OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2023, 117: 102823.被引 3
