Logic-based constraint handling in PF resource-constrained scheduling problems

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. In the constraint programming toolkit 'Mingyue', which embed constraints in the object-oriented language C++, we design a new logic-based method for handling the constraints in 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 resolution algorithm is designed for filtering 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.