A Logic-based Branch and Bound Algorithm for Resource Constrained Scheduling Problem
Juyang Zhang, Jigui Sun, Qingyun Yang · 2006
Resource-constrained scheduling problem is one kind of typical real-life discrete optimization problems, which is one of the strongest application areas of constraint programming. We design a new logic-based method for solving the resource-constrained scheduling problem. In this paper, we propose a way of describing those constraints with the discrete-variable logic formula. Based on this model, a logic-based branch and bound algorithm is designed for solving the discrete variables ’ domain. Comparisons with other constraint handling approaches and related literature clearly show that our approach can describe the constraints in the high level and solve the resource-constrained scheduling problem in the logic framework. Key words: