Preemptive on-line scheduling for two uniform processors

CSpace

	Preemptive on-line scheduling for two uniform processors
	Wen, JJ; Du, DL
	1998-10-01
发表期刊	OPERATIONS RESEARCH LETTERS
ISSN	0167-6377
卷号	23 期号:3-5 页码:113-116
摘要	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.
关键词	on-line scheduling competitive ratio preemption uniform processors
语种	英语
WOS研究方向	Operations Research & Management Science
WOS类目	Operations Research & Management Science
WOS记录号	WOS:000079125600006
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13815
专题	中国科学院数学与系统科学研究院
通讯作者	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.