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

被引：0

作者：

Zhang, J. Y. ^{[1
]}

Sun, J. G. ^{[1
]}

Yang, Q. Y. ^{[1
]}

机构：

[1] Jilin Univ, Coll Comp Sci & Technol, Changchun 130012, Peoples R China

来源：

COMPUTATIONAL METHODS, PTS 1 AND 2 | 2006年

基金：

美国国家科学基金会; 巴西圣保罗研究基金会;

关键词：

scheduling; constraint handling; logic; discrete optimization;

D O I：

10.1007/978-1-4020-3953-9_27

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

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.

引用

页码：1177 / +

页数：2