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 |
Issue Date: | Jun-2005 | 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. | Keywords: | On-line algorithms Semi-on-line algorithms Bin stretching Multiprocessor scheduling Approximation algorithms |
Publisher: | Elsevier | Journal: | Theoretical computer science | 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 | Size | Format | |
|---|---|---|---|---|
| semisch1.pdf | Pre-published version | 166.86 kB | Adobe PDF | View/Open |
Access
View full-text via PolyU eLinks 
Page views
120
Last Week
0
0
Last month
Citations as of Apr 21, 2024
Downloads
138
Citations as of Apr 21, 2024
SCOPUSTM
Citations
43
Last Week
0
0
Last month
1
1
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
37
Last Week
0
0
Last month
1
1
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.