期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2006
卷号：6
期号：2A
页码：237-237~241
出版社：International Journal of Computer Science and Network Security
摘要：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.
关键词：Scheduling, Logic, Branch and Bound, Constraint Programming
