Citation
Robustness of Partial Order Schedules: Understanding the Chaining algorithm. In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic, pages 457-472, 2015.
Paper
Abstract
If a schedule is executed under conditions that are uncertain at the time the schedule is constructed, then a ?exible schedule is more useful than a ?xed-time schedule. A ?exible schedule can absorb unforeseen events that arise during execution, by incorporating a variety of ?xed-time schedules. We say a schedule is robust if it admits the realized execution as one of these schedules. Various methods have been proposed that give ?exibility to schedules for the resource-constrained project scheduling problem. We focus on schedules that have the form of a partially ordered set of the project activities (a ‘partial order schedule’). A partial order schedule is ?exible because it incorporates all the ?xed-time schedules that are consistent with the partial order. In this paper we study the ‘chaining’ algorithm for constructing partial order schedules. In particular, we use empirical methods to try to understand how chaining heuristics a?ect the robustness of the resulting schedules, which we estimate using simulations. We propose an explanatory model, and test its implications in controlled experiments. Our experimental results con?rm some but not all of our predictions, and so motivate us to elaborate our model.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2015-457-472-P, author = {D. Wilmer and T. Klos},
title = {Robustness of Partial Order Schedules: Understanding the Chaining algorithm},
booktitle = {In proceedings of the 7th Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2015), 25 - 28 Aug 2015, Prague, Czech Republic},
year = {2015},
editor = {Z. Hanzalek and G. Kendall and B. McCollum and P. Sucha},
pages = {457--472},
note = {Paper},
abstract = { If a schedule is executed under conditions that are uncertain at the time the schedule is constructed, then a ?exible schedule is more useful than a ?xed-time schedule. A ?exible schedule can absorb unforeseen events that arise during execution, by incorporating a variety of ?xed-time schedules. We say a schedule is robust if it admits the realized execution as one of these schedules. Various methods have been proposed that give ?exibility to schedules for the resource-constrained project scheduling problem. We focus on schedules that have the form of a partially ordered set of the project activities (a ‘partial order schedule’). A partial order schedule is ?exible because it incorporates all the ?xed-time schedules that are consistent with the partial order. In this paper we study the ‘chaining’ algorithm for constructing partial order schedules. In particular, we use empirical methods to try to understand how chaining heuristics a?ect the robustness of the resulting schedules, which we estimate using simulations. We propose an explanatory model, and test its implications in controlled experiments. Our experimental results con?rm some but not all of our predictions, and so motivate us to elaborate our model.},
owner = {Graham},
timestamp = {2017.01.16},
webpdf = {2015-457-472-P.pdf} }