Please use this identifier to cite or link to this item:
Title: Semi-on-line multiprocessor scheduling with given total processing time
Authors: Cheng, T. C. Edwin
Kellerer, Hans
Kotov, Vladimir
Subjects: 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.
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.
Rights: Theoretical Computer Science © 2005 Elsevier B.V. The journal web site is located at
Type: Journal/Magazine Article
DOI: 10.1016/j.tcs.2004.11.018
ISSN: 0304-3975
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:
File Description SizeFormat 
semisch1.pdfPre-published version166.86 kBAdobe PDFView/Open

All items in the PolyU Institutional Repository are protected by copyright, with all rights reserved, unless otherwise indicated. No item in the PolyU IR may be reproduced for commercial or resale purposes.