Production management as a constraint satisfaction problem

被引:3
作者
Syrjänen, M [1 ]
机构
[1] Helsinki Univ Technol, Lab Informat Proc Sci, FIN-02015 HUT, Finland
关键词
production management; constraint satisfaction problems (CSPs); operation planning; activity-based scheduling;
D O I
10.1023/A:1008884118631
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Production management problems can be quite straightforwardly presented as constraint satisfaction problems, where values for some variables are searched for under a set of constraints. A combination of an operation and a resource is usually interpreted as the variable, and a time window is usually interpreted as the value to be searched for. This convention is challenged. A case is considered where the most appropriate interpretation treats the combination of a resource and a time window as the variable, and an operation as the value. A third possible interpretation is also briefly covered, where the combination of an operation and a time window is the variable, and the resource is the value.
引用
收藏
页码:515 / 522
页数:8
相关论文
共 17 条
[1]   AN OPTIMAL KAPPA-CONSISTENCY ALGORITHM [J].
COOPER, MC .
ARTIFICIAL INTELLIGENCE, 1989, 41 (01) :89-95
[2]   A SUFFICIENT CONDITION FOR BACKTRACK-FREE SEARCH [J].
FREUDER, EC .
JOURNAL OF THE ACM, 1982, 29 (01) :24-32
[3]   SYNTHESIZING CONSTRAINT EXPRESSIONS [J].
FREUDER, EC .
COMMUNICATIONS OF THE ACM, 1978, 21 (11) :958-966
[4]  
KENG N, 1989, P IJCAI 89 DETR MI, P998
[5]  
Keng N. P., 1988, EXPERT SYSTEMS INTEL, P57
[6]  
KUMAR V, 1992, AI MAG, V13, P32
[7]  
LASSILA O, 1990, P APMS 90 ESPC FINL, V2, P1
[8]   CONSISTENCY IN NETWORKS OF RELATIONS [J].
MACKWORTH, AK .
ARTIFICIAL INTELLIGENCE, 1977, 8 (01) :99-118
[9]   THE COMPLEXITY OF SOME POLYNOMIAL NETWORK CONSISTENCY ALGORITHMS FOR CONSTRAINT SATISFACTION PROBLEMS [J].
MACKWORTH, AK ;
FREUDER, EC .
ARTIFICIAL INTELLIGENCE, 1985, 25 (01) :65-74
[10]  
Meseguer P., 1989, AI Communications, V2, P3