Artificial intelligence and operations research. challenges and opportunities in planning and scheduling

被引:16
作者
Gomes, CP [1 ]
机构
[1] Cornell Univ, Dept Comp Sci, Ithaca, NY 14853 USA
关键词
D O I
10.1017/S0269888900001090
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Both the artificial intelligence (AI) and the operations research (OR) communities are interested in developing techniques for solving hard combinatorial problems, in particular in the domain of planning and scheduling. AI approaches encompass a rich collection of knowledge representation formalisms for dealing with a wide variety of real-world problems. Some of the different techniques from AI and OR for planning and scheduling are discussed and compared, highlighting potential synergistic benefits from combining the techniques.
引用
收藏
页码:1 / 10
页数:10
相关论文
共 58 条
[1]  
Achlioptas D, 2000, P 17 NAT C ART INT A
[2]   A method for obtaining randomized algorithms with small tail probabilities [J].
Alt, H ;
Guibas, L ;
Mehlhorn, K ;
Karp, R ;
Wigderson, A .
ALGORITHMICA, 1996, 16 (4-5) :543-547
[3]  
[Anonymous], P AAAI 97
[4]  
[Anonymous], 1951, ACTIVITY ANAL PRODUC
[5]  
[Anonymous], 1996, LOGIC BASED 0 1 CONS
[6]   A LIFT-AND-PROJECT CUTTING PLANE ALGORITHM FOR MIXED 0-1 PROGRAMS [J].
BALAS, E ;
CERIA, S ;
CORNUEJOLS, G .
MATHEMATICAL PROGRAMMING, 1993, 58 (03) :295-324
[7]  
Barnhart C., 1994, MATH PROGRAMMING STA, P186
[8]   INTRODUCING GLOBAL CONSTRAINTS IN CHIP [J].
BELDICEANU, N ;
CONTEJEAN, E .
MATHEMATICAL AND COMPUTER MODELLING, 1994, 20 (12) :97-123
[9]  
Carlier J., 1990, Annals of Operations Research, V26, P269
[10]  
Caseau Y, 1997, LECT NOTES COMPUT SC, V1330, P17, DOI 10.1007/BFb0017427