CSpace
Preemptive on-line scheduling for two uniform processors
Wen, JJ; Du, DL
1998-10-01
Source PublicationOPERATIONS RESEARCH LETTERS
ISSN0167-6377
Volume23Issue:3-5Pages:113-116
AbstractThis paper considers the problem of preemptive on-line scheduling for two uniform 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 makespan. 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.
Keywordon-line scheduling competitive ratio preemption uniform processors
Language英语
WOS Research AreaOperations Research & Management Science
WOS SubjectOperations Research & Management Science
WOS IDWOS:000079125600006
PublisherELSEVIER SCIENCE BV
Citation statistics
Cited Times:37[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/13815
Collection中国科学院数学与系统科学研究院
AffiliationChinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Wen, JJ,Du, DL. Preemptive on-line scheduling for two uniform processors[J]. OPERATIONS RESEARCH LETTERS,1998,23(3-5):113-116.
APA Wen, JJ,&Du, DL.(1998).Preemptive on-line scheduling for two uniform processors.OPERATIONS RESEARCH LETTERS,23(3-5),113-116.
MLA Wen, JJ,et al."Preemptive on-line scheduling for two uniform processors".OPERATIONS RESEARCH LETTERS 23.3-5(1998):113-116.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Wen, JJ]'s Articles
[Du, DL]'s Articles
Baidu academic
Similar articles in Baidu academic
[Wen, JJ]'s Articles
[Du, DL]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Wen, JJ]'s Articles
[Du, DL]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.