|
|
|
||
Last update: BARTAK/MFF.CUNI.CZ (31.03.2008)
|
|
||
Last update: BARTAK/MFF.CUNI.CZ (31.03.2008)
The course gives an introduction to planning and scheduling. The students will learn the fundamental planning techniques including forward and backward planning, partial order planning and Graphplan. Planning with time and resources is also presented together with selected scheduling algorithms.
|
|
||
Last update: BARTAK/MFF.CUNI.CZ (31.03.2008)
Brucker, Peter. Scheduling algorithms. 2nd, rev. and enl. ed. Berlin : Springer, 1998. xii, 342 s.
Baptiste, Philippe - Le Pape, Claude - Nuijten, Wim. Constraint-based scheduling : applying constraint programming to scheduling problems. Boston : Kluwer Academic Publishers, 2001. xii, 198 s. International series in operations research & management science.
Ghallab, Malik - Nau, Dana - Traverso, Paolo. Automated Planning: Theory & Practice. San Francisco : Morgan Kaufmann, 2004. |
|
||
Last update: BARTAK/MFF.CUNI.CZ (31.03.2008)
lecture |
|
||
Last update: prof. RNDr. Roman Barták, Ph.D. (26.04.2007)
1. Introduction: definitions of planning and scheduling problems, examples, solving mechanisms (search, constraint satisfaction, SAT), representation of planning problems (set-theoretic, classical). 2. State-Space Planning (forward search, backward search, STRIPS), Plan-Space Planning (PSP, PoP), Neoclassical Planning (planning graph, Graphplan). 3. Planning as SAT, planning as a CSP, planning heuristics. 4. Planning with Time and Resources (temporal problems, planning with chronicles, resource allocation). 5. Scheduling problems: traditional scheduling problems, Graham’s classification, scheduling as constraint satisfaction, resource and precedence constraints, scheduling strategies. 6. Case studies. |