Please use this identifier to cite or link to this item:
http://hdl.handle.net/10397/474
Title: | A new algorithm for online uniform-machine scheduling to minimize the makespan | Authors: | Cheng, TCE Ng, CTD Kotov, V |
Issue Date: | 16-Aug-2006 | Source: | Information processing letters, Aug. 2006, v. 99, no. 3, p. 102-105 | Abstract: | We consider the online scheduling problem with m−1, m≥2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1≤s≤2, to minimize the makespan. The well-known list scheduling (LS) algorithm has a worst-case bound of (3m-1)/(m+1) [Y. Cho, S. Sahni, Bounds for list schedules on uniform processors, SIAM J. Comput. 9 (1980) 91-103]. An algorithm with a better competitive ratio was proposed in [R. Li, L. Shi, An on-line algorithm for some uniform processor scheduling, SIAM J. Comput. 27 (1998) 414-422]. It has a worst-case bound of 2.8795 for a big m and s=2. In this note we present a 2.45-competitive algorithm for m≥4 and any s, 1≤ s≤ 2. | Keywords: | Online algorithms Competitive ratio Multi-machine scheduling Uniform machines |
Publisher: | Elsevier | Journal: | Information processing letters | ISSN: | 0020-0190 | DOI: | 10.1016/j.ipl.2006.02.012 | Rights: | Information Processing Letters © 2006 Elsevier. 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 | |
---|---|---|---|---|
on-line_uniform9.pdf | Pre-published version | 157.55 kB | Adobe PDF | View/Open |
Page views
99
Last Week
2
2
Last month
Citations as of Apr 21, 2024
Downloads
206
Citations as of Apr 21, 2024
SCOPUSTM
Citations
11
Last Week
0
0
Last month
0
0
Citations as of Apr 19, 2024
WEB OF SCIENCETM
Citations
13
Last Week
0
0
Last month
0
0
Citations as of Apr 18, 2024
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.