TIGHTER BOUND FOR MULTIFIT SCHEDULING ON UNIFORM PROCESSORS
文献类型：期刊论文
| 作者 | CHEN, B |
| 刊名 | DISCRETE APPLIED MATHEMATICS
 |
| 出版日期 | 1991-05-15 |
| 卷号 | 31期号:3页码:227-260 |
| 关键词 | BIN PACKING MULTIPROCESSOR SCHEDULING HEURISTIC ALGORITHMS UNIFORM PROCESSORS WORST-CASE ANALYSIS PERFORMANCE RATIO |
| ISSN号 | 0166-218X |
| 英文摘要 | 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. |
| 语种 | 英语 |
| WOS记录号 | WOS:A1991FQ63600001 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/28442]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | 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. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。