Citation
Semi On-Line Scheduling on Two Uniform Processors. In proceedings of the 3rd Multidisciplinary International Conference on Scheduling : Theory and Applications (MISTA 2007), 28 -31 August 2007, Paris, France, pages 51-58, 2007.
Paper
Abstract
In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, depending on the value of the speed s of the fast processor (the speed of the slow processor is normalized to 1). The algorithms presented for s >= SQRT(3), are optiomal, as well as fro s=1 and for (1+SQRT(17))/4 <= s <= (1+SQRT(3))/2.
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-051-058-P, author = {E. Angelelli and M. Grazia Speranza and Z. Tuza},
title = {Semi On-Line Scheduling on Two Uniform Processors},
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 = {51--58},
note = {Paper},
abstract = {In this paper we consider the problem of semi on-line scheduling on two uniform processors, in the case where the total sum of the tasks is known in advance. Tasks arrive one at a time and have to be assigned to one of the two processors before the next one arrives. The assignment cannot be changed later. The objective is the minimization of the makespan. We derive lower bounds and algorithms, depending on the value of the speed s of the fast processor (the speed of the slow processor is normalized to 1). The algorithms presented for s >= SQRT(3), are optiomal, as well as fro s=1 and for (1+SQRT(17))/4 <= s <= (1+SQRT(3))/2.},
owner = {Faizah Hamdan},
timestamp = {2012.05.21},
webpdf = {2007-051-058-P.pdf} }