In previous work, we have defined a two-step procedure called Solve-and-Robustify for generating flexible, partial order schedules. This partitioned problem solving approach first find a viable solution and then generalize it to enhance robustness properties has been shown to provide an effective basis for generating flexible, robust schedules while simultaneously achieving good quality with respect to optimization objectives. This paper extends prior analysis of this paradigm, by investigating the effects of using different start solutions as a baseline to generate partial order schedules. Two approaches are compared: the first constructs partial order schedules from a single fixed-time schedule, obtained by first performing an extended makespan optimization search phase; the second considers the search for fixed-time schedules and flexible schedules in a more integrated fashion, and constructs partial order schedules from a number of different fixed-time starting solutions. The paper experimentally shows how the characteristics of the fixed-time solutions may lower the robustness of the final partial order schedules and discusses the reasons for such behavior.
Schedule Robustness through Broader Solve and Robustify Search for Partial Order Schedules
Springer, Berlin , Germania
Lecture notes in computer science 3673 (2005): 160–172. doi:10.1007/11558590_16
info:cnr-pdr/source/autori:Policella, N., Cesta, A., Oddi, A. and Smith, S.F/titolo:Schedule Robustness through Broader Solve and Robustify Search for Partial Order Schedules/doi:10.1007/11558590_16/rivista:Lecture notes in computer science/anno:2005/pagi