2978 search results - page 196 / 596 » Operations Research |
134
Voted
CAV
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
139
Voted
ROBOCUP
1999
Springer
15 years 8 months ago
1999
Springer
In this paper we describe Big Red, the Cornell University Robot Soccer team. The success of our team at the 1999 competition can be mainly attributed to three points: 1) An integra...
128
Voted
ICLP
1997
Springer
15 years 7 months ago
1997
Springer
This paper presents a set of techniques that makes constraint programming a technique of choice for solving small (up to 30 nodes) traveling salesman problems. These techniques in...
117
Voted
KR
1989
Springer
15 years 7 months ago
1989
Springer
In this work we extend the work of Dean, Kaelbling, Kirman and Nicholson on planning under time constraints in stochastic domains to handle more complicated scheduling problems. I...
128
Voted
WSC
2007
15 years 6 months ago
2007
This presentation follows up the talk last year to WINFORMS (The Washington Institute for Operations Research and The Management Sciences) in which an approach developed for the a...