PolyU IR

PolyU Institutional Repository >
Logistics and Maritime Studies >
LMS Journal/Magazine Articles >

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, T. C. Edwin
Ng, Chi-to Daniel
Kotov, Vladimir
Subjects: Online algorithms
Competitive ratio
Multi-machine scheduling
Uniform machines
Issue Date: 16-Aug-2006
Publisher: Elsevier
Citation: 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.
Description: 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.
Type: Journal/Magazine Article
URI: http://hdl.handle.net/10397/474
ISSN: 00200190
Appears in Collections:LMS Journal/Magazine Articles

Files in This Item:

File Description SizeFormat
on-line_uniform9.pdfPre-published version157.55 kBAdobe PDFView/Open
Locate publisher version via PolyU eLinks

Facebook Facebook del.icio.us del.icio.us LinkedIn LinkedIn

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.


© Pao Yue-kong Library, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Powered by DSpace (Version 1.5.2)  © MIT and HP
Feedback | Privacy Policy Statement | Copyright & Restrictions - Feedback