The exact bound of Lee's MLPT
文献类型：期刊论文
| 作者 | Lin, GH |
| 刊名 | DISCRETE APPLIED MATHEMATICS
 |
| 出版日期 | 1998-07-22 |
| 卷号 | 85期号:3页码:251-254 |
| 关键词 | MLPT initially worst-case performance ratio |
| ISSN号 | 0166-218X |
| 英文摘要 | Lee provided a modified version of LPT algorithm to deal with the problem Parallel Machines Scheduling with Nonsimultaneous Machine Available Times, and got an upper bound of 4/3 for its worst-case performance ratio. An open question is then proposed to obtain the exact value of this ratio, which is determined in this paper. The instance which achieves the ratio is also demonstrated. (C) 1998 Elsevier Science B.V. All rights reserved. |
| 语种 | 英语 |
| WOS记录号 | WOS:000074835200006 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/14015]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Lin, GH |
| 作者单位 | Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Lin, GH. The exact bound of Lee's MLPT[J]. DISCRETE APPLIED MATHEMATICS,1998,85(3):251-254. |
| APA | Lin, GH.(1998).The exact bound of Lee's MLPT.DISCRETE APPLIED MATHEMATICS,85(3),251-254. |
| MLA | Lin, GH."The exact bound of Lee's MLPT".DISCRETE APPLIED MATHEMATICS 85.3(1998):251-254. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。