Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/632
Title: Semi-on-line multiprocessor scheduling with given total processing time
Authors: Cheng, TCE 
Kellerer, H
Kotov, V
Keywords: On-line algorithms
Semi-on-line algorithms
Bin stretching
Multiprocessor scheduling
Approximation algorithms
Issue Date: Jun-2005
Publisher: Elsevier B.V.
Source: Theoretical computer science, June 2005, v. 337, no. 1-3, p. 134-146 How to cite?
Journal: Theoretical computer science 
Abstract: We are given a set of identical machines and a sequence of jobs, the sum of whose weights is known in advance. The jobs are to be assigned on-line to one of the machines and the objective is to minimize the makespan. An algorithm with performance ratio 1.6 and a lower bound of 1.5 is presented. These results improve on the recent results by Azar and Regev, who proposed an algorithm with performance ratio 1.625 for the less general problem that the optimal makespan is known in advance.
URI: http://hdl.handle.net/10397/632
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.11.018
Rights: Theoretical Computer Science © 2005 Elsevier B.V. The journal web site is located at http://www.sciencedirect.com.
Appears in Collections:Journal/Magazine Article

Files in This Item:
File Description SizeFormat 
semisch1.pdfPre-published version166.86 kBAdobe PDFView/Open
Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

21
Last Week
0
Last month
1
Citations as of Jun 4, 2016

WEB OF SCIENCETM
Citations

19
Last Week
0
Last month
1
Citations as of Nov 29, 2016

Page view(s)

326
Last Week
0
Last month
Checked on Dec 4, 2016

Download(s)

819
Checked on Dec 4, 2016

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.