Citation
Evaluating Online Scheduling Techniques in Uncertain Environments. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 471-479, 2007.
Paper
Abstract
Online scheduling (also known as dynamic scheduling) refers to the real-time coordination of operation processing while new operations are continuously arriving. The objective of this paper is the study of different online scheduling techniques in a dynamic, stochastic job shop scheduling environment. We present a quantitative study of the quality of dispatching and optimizing schedul- ing techniques under varying uncertainty and utilization. Therein, we also consider a regret-based algorithm adopted from Bent and Van Hentenryck [1] in a setting with stochastic processing times and analyze its performance. To date, results in such a dynamic setting are lacking, while it has been shown to outperform other heuristic optimization methods in online packet scheduling with processing times known a priori.
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{2007-471-479-P, author = {M. Thomas and H. Szczerbicka},
title = {Evaluating Online Scheduling Techniques in Uncertain Environments},
booktitle = {In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France},
year = {2007},
editor = {P. Baptiste and G. Kendall and A. Munier-Kordon and F. Sourd},
pages = {471--479},
note = {Paper},
abstract = {Online scheduling (also known as dynamic scheduling) refers to the real-time coordination of operation processing while new operations are continuously arriving. The objective of this paper is the study of different online scheduling techniques in a dynamic, stochastic job shop scheduling environment. We present a quantitative study of the quality of dispatching and optimizing schedul- ing techniques under varying uncertainty and utilization. Therein, we also consider a regret-based algorithm adopted from Bent and Van Hentenryck [1] in a setting with stochastic processing times and analyze its performance. To date, results in such a dynamic setting are lacking, while it has been shown to outperform other heuristic optimization methods in online packet scheduling with processing times known a priori.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-471-479-P.pdf} }