Citation
The Strength of Priority Algorithms. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 531-537, 2007.
Paper
Abstract
The paper is concerned with scheduling problems with partially ordered unit execution time tasks and parallel identical machines. For the algorithms, constituting a broad class of algorithms for the maximum lateness problem, the paper introduces the notion of a strength, which characterizes the algorithm’s worst-case performance. Using this formal framework, a positive answer is given to the question of the existence of a strongest algorithm, i.e. an algorithm with the best worst-case performance. The idea of this algorithm can be generalized to the maximum lateness problem with release times. The paper shows that this idea in combination with the idea of the Garey- Johnson algorithm leads to an exact algorithm for the maximum cost problem with release times and partially ordered unit execution time tasks.
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-531-537-P, author = {Y. Zinder},
title = {The Strength of Priority Algorithms},
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 = {531--537},
note = {Paper},
abstract = {The paper is concerned with scheduling problems with partially ordered unit execution time tasks and parallel identical machines. For the algorithms, constituting a broad class of algorithms for the maximum lateness problem, the paper introduces the notion of a strength, which characterizes the algorithm’s worst-case performance. Using this formal framework, a positive answer is given to the question of the existence of a strongest algorithm, i.e. an algorithm with the best worst-case performance. The idea of this algorithm can be generalized to the maximum lateness problem with release times. The paper shows that this idea in combination with the idea of the Garey- Johnson algorithm leads to an exact algorithm for the maximum cost problem with release times and partially ordered unit execution time tasks.},
owner = {user},
timestamp = {2012.05.22},
webpdf = {2007-531-537-P.pdf} }