Citation
The Worst-case Analysis of the Carey-Johnson Algorithm for preemptive tasks on m processors. In proceedings of the 2nd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2005), 18 -21 July 2005, New York, USA, pages 453-470, 2005.
Paper
Abstract
The classical Garey-Johnson algorithm was originally developed for the maximum lateness problem with two parallel identical machines and partially ordered unit execution time tasks, but the main idea of the Garey-Johnson algorithm is applicable far beyond the confines of this particular problem. This paper analyzes the worst-case performance of a generalization of the Garey-Johnson algorithm for the problem with arbitrary number of machines and partially ordered tasks allowing preemptions. The presented performance guarantee is the best among all currently known for this problem.
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-453-470-P, author = {C. Hanen and Y. Zinder},
title = {The Worst-case Analysis of the Carey-Johnson Algorithm for preemptive tasks on m processors},
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 = {453--470},
note = {Paper},
abstract = {The classical Garey-Johnson algorithm was originally developed for the maximum lateness problem with two parallel identical machines and partially ordered unit execution time tasks, but the main idea of the Garey-Johnson algorithm is applicable far beyond the confines of this particular problem. This paper analyzes the worst-case performance of a generalization of the Garey-Johnson algorithm for the problem with arbitrary number of machines and partially ordered tasks allowing preemptions. The presented performance guarantee is the best among all currently known for this problem.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2005-453-470-P.pdf} }