Preemptive on-line scheduling for two uniform processors

Authors
Wen, JJ Du, DL
Citation
Jj. Wen et Dl. Du, Preemptive on-line scheduling for two uniform processors, OPER RES L, 23(3-5), 1998, pp. 113-116
Citations number
5
Categorie Soggetti
Engineering Mathematics
Journal title
OPERATIONS RESEARCH LETTERS
ISSN journal
01676377 → ACNP
Volume
23
Issue
3-5
Year of publication
1998
Pages
113 - 116
Database
ISI
SICI code
0167-6377(199810/12)23:3-5<113:POSFTU>2.0.ZU;2-2
Abstract
This paper considers the problem of preemptive on-line scheduling for two u niform processors in which one of the processors has speed 1 and the other has speed s greater than or equal to 1. The objective is to minimize the ma kespan. A best possible algorithm with competitive ratio of(1 + s)(2)/(1 s + s(2)) is proposed for this problem. (C) 1998 Elsevier Science B.V. All rights reserved.