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 transforming good quality solutions into POSs with good robustness properties. Here, we investigate the possibility of producing POSs with better robustness and stability properties through more extended search in the space of Chaining Form POSs. We define two heuristics which make use of a structural property of chaining form POSs to bias chaining decisions. Experimental results on a resource-constrained project scheduling benchmark confirm the effectiveness of our approach.
Generating Robust Partial Order Schedules
Springer, Berlin , Germania
Lecture notes in computer science 3258 (2004): 496–511.
info:cnr-pdr/source/autori:Policella, N., Oddi, A., Smith, S.F. and Cesta, A./titolo:Generating Robust Partial Order Schedules/doi:/rivista:Lecture notes in computer science/anno:2004/pagina_da:496/pagina_a:511/intervallo_pagine:496–511/volume:3258