Preemptive on-line scheduling for two uniform processors
文献类型：期刊论文
| 作者 | Wen, JJ; Du, DL |
| 刊名 | OPERATIONS RESEARCH LETTERS
 |
| 出版日期 | 1998-10-01 |
| 卷号 | 23期号:3-5页码:113-116 |
| 关键词 | on-line scheduling competitive ratio preemption uniform processors |
| ISSN号 | 0167-6377 |
| 英文摘要 | This 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. |
| WOS研究方向 | Operations Research & Management Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000079125600006 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13814]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Wen, JJ |
| 作者单位 | Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。