Generating Robust Partial Order Schedules

11 years 5 months ago
Generating Robust Partial Order Schedules
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. Whereas a fixed-times schedule is brittle in the face of unpredictable execution dynamics and can quickly become invalidated, a POS retains temporal flexibility whenever problem constraints allow it and can often absorb unexpected deviation from predictive assumptions. We focus specifically on procedures for generating Chaining Form POSs, wherein activities competing for the same resources are linked into precedence chains. One interesting property of a Chaining Form POS is that it is “makespan preserving” with respect to its originating fixed-times schedule. Thus, issues of maximizing schedule quality and maximizing schedule robustness can be addressed sequentially in a two-step scheduling procedure. Using this approach, a simple chaining algorithm was recently shown to provide an effective basis for...
Nicola Policella, Angelo Oddi, Stephen F. Smith, A
Added 01 Jul 2010
Updated 01 Jul 2010
Type Conference
Year 2004
Where CP
Authors Nicola Policella, Angelo Oddi, Stephen F. Smith, Amedeo Cesta
Comments (0)