Sciweavers

Share
IPL
2006

A new algorithm for online uniform-machine scheduling to minimize the makespan

10 years 4 months ago
A new algorithm for online uniform-machine scheduling to minimize the makespan
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 wellknown list scheduling (LS) algorithm has a worst-case bound of 3m-1 m+1 [1]. An algorithm with a better competitive ratio was proposed in [3]. 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.
T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2006
Where IPL
Authors T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
Comments (0)
books