TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS

CSpace

	TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS
	CHEN, B
	1991-05-15
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	31 期号:3 页码:227-260
摘要	We examine one of the basic, well studied problem of scheduling theory, that of nonpreemptive assignment of independent tasks on m parallel processors with the objective of minimizing the makespan. Because this problem is NP-complete and apparently intractable in general, much effort has been directed toward devising fast algorithms which find near optimal schedules. Two well-known heuristic algorithms LPT (largest processing time first) and MULTIFIT, shortly MF, find schedules having makespans within 4/3, 13/11, respectively, of the minimum possible makespan, when the m parallel processors are identical. If they are uniform, then the best worst-case performance ratio bounds we know are 1.583, 1.40, respectively. In this paper we tighten the bound to 1.382 for MF algorithm for the uniform-processor system. On the basis of some of our general results and other investigations, we conjecture that the bound could be tightened further to 1.366.
关键词	BIN PACKING MULTIPROCESSOR SCHEDULING HEURISTIC ALGORITHMS UNIFORM PROCESSORS WORST-CASE ANALYSIS PERFORMANCE RATIO
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:A1991FQ63600001
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/28443
专题	中国科学院数学与系统科学研究院
通讯作者	CHEN, B
作者单位	CHINESE ACAD SCI,INST APPL MATH,BEIJING,PEOPLES R CHINA
推荐引用方式 GB/T 7714	CHEN, B. TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS[J]. DISCRETE APPLIED MATHEMATICS,1991,31(3):227-260.
APA	CHEN, B.(1991).TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS.DISCRETE APPLIED MATHEMATICS,31(3),227-260.
MLA	CHEN, B."TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS".DISCRETE APPLIED MATHEMATICS 31.3(1991):227-260.