| Time |
Paper |
Notes |
| 8:35 - 9:00 |
P.J. Schwartz & M.E. Pollack
Two Approaches to Semi-Dynamic Disjunctive Temporal Problems |
Temporal
Planning |
| 9:00 - 9:25 |
N. Yorke-Smith & M. Tyson Exploiting the Structure of Hierarchical Plans in Temporal Constraint Propagation |
|
| 9:25 - 9:50 |
I. Refanidis Stratified Heuristic POCL Temporal Planning based on Planning Graphs and Constraint Programming |
|
| 9:50
- 10:30 |
J.
Blythe TBA |
Invited Talk |
| 10:30
- 11:00 |
COFFEE
BREAK |
|
| 11:00 - 11:30 |
N. Policella, A. Cesta, A. Oddi,
& S.F. Smith Schedule Robustness Through Solve-and-Robustify: Generating Flexible Schedules from Different Fixed-Time Solutions |
Scheduling
& Planning with Uncertainty |
| 11:30 - 12:00 |
E. Hebrard, B. Hnich, & T.
Walsh Improved Algorithm for Finding (a,b)-Super Solutions |
|
| 12:00 - 12:30 |
R. Morris, P. Morris, L. Khatib,
& N. Yorke-Smith Temporal Planning with Preferences and Probabilities |
|
| 12:30
- 2:00 |
LUNCH |
|
| 2:00 - 2:25 |
E. Marzal, E. Onaindia, & L.
Sebastia Scheduling a Plan in Time: A CSP Approach |
Planning |
| 2:25 - 2:50 |
T. Kichkaylo Constraint-Based Envelopes over Multiple Alternatives |
|
| 2:50
- 3:30 |
W.S.
Havens Hybrid Methods for Industrial Scheduling Applications |
Invited Talk |
| 3:30
- 4:00 |
COFFEE
BREAK |
|
| 4:00 - 4:25 |
C. Guettier & J.-F. Hermant Static Mapping of Hard Real-Time Applications Onto Multi-Processor Architectures Using Constraint Logic Programming |
Scheduling |
| 4:25 - 4:50 |
S. Fratini, A. Cesta, & A.
Oddi Extending a Scheduler with Causal Reasoning: A CSP Approach |
|
| 4:50 - 5:15 |
R. Bartak & O. Cepek Incremental Propagation Rules for Precedence Graph with Optional Activities and Time Windows |
|
| 5:15
- 5:30 |
Post-Mortem
and Feedback |