Citation
A Comparison of Combinatorial Optimization and Dispatch Rules for Online Scheduling. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 353-361, 2005.
Paper
Abstract
Online, or dynamic, scheduling refers to when the tasks to perform are not known prior to the execution of the schedule but rather are continually revealed during the execution process. The real-time aspect of online scheduling potentially changes the preferred properties of the scheduling algorithm. In particular, the time required to generate a schedule becomes a more important factor, while the quality of the schedules produced becomes less important. The relative importance of these two properties, schedule creation time and schedule quality, differs greatly depending on the characteristics of the scheduling problem. Here, we describe an empirical investigation of how the tradeoff between them varies with the scheduling problem. We do this by comparing the performance of an optimizing scheduler, which creates better schedules, and a dispatch-rule scheduler, which provides faster turnaround, on a set of different online scheduling problems. Our experiments identify some key factors in determining which type of scheduler is better: (i) the predictability with which schedules are executed and (ii) the time scale with which the scheduling problem changes as compared to the time required to optimize a schedule.
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{2005-353-361-P, author = {D. Montana},
title = {A Comparison of Combinatorial Optimization and Dispatch Rules for Online Scheduling},
booktitle = {In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA},
year = {2005},
editor = {G. Kendall and L. Lei and M. Pinedo},
pages = {353--361},
note = {Paper},
abstract = {Online, or dynamic, scheduling refers to when the tasks to perform are not known prior to the execution of the schedule but rather are continually revealed during the execution process. The real-time aspect of online scheduling potentially changes the preferred properties of the scheduling algorithm. In particular, the time required to generate a schedule becomes a more important factor, while the quality of the schedules produced becomes less important. The relative importance of these two properties, schedule creation time and schedule quality, differs greatly depending on the characteristics of the scheduling problem. Here, we describe an empirical investigation of how the tradeoff between them varies with the scheduling problem. We do this by comparing the performance of an optimizing scheduler, which creates better schedules, and a dispatch-rule scheduler, which provides faster turnaround, on a set of different online scheduling problems. Our experiments identify some key factors in determining which type of scheduler is better: (i) the predictability with which schedules are executed and (ii) the time scale with which the scheduling problem changes as compared to the time required to optimize a schedule.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-353-361-P.pdf} }