Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times
文献类型：期刊论文
| 作者 | Lin, GH; Yao, EY; He, Y |
| 刊名 | OPERATIONS RESEARCH LETTERS
 |
| 出版日期 | 1998-03-01 |
| 卷号 | 22期号:2-3页码:75-81 |
| 关键词 | multiprocessor scheduling approximation matching LPT |
| ISSN号 | 0167-6377 |
| 英文摘要 | We consider a generalized version of the classical parallel machine scheduling problem, in which the m machines are available at time a(j) greater than or equal to 0, j = 1, 2, ..., m. The objective function is to maximize the minimum machine completion time. Using the conventional weighting function technique, previously, a lower bound of 5/8 has been shown for the worst-case performance ratio of the famous Longest Processing Timing (LPT) approximation. In this paper, we develop a new method, called matching, and show that the worst-case performance ratio of LPT is exactly (2m - 1)/(3m - 2). We also give an instance to indicate the tightness of this ratio. (C) 1998 Elsevier Science B.V. All rights reserved. |
| WOS研究方向 | Operations Research & Management Science |
| 语种 | 英语 |
| WOS记录号 | WOS:000076602300004 |
| 出版者 | ELSEVIER SCIENCE BV |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/13697]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Lin, GH |
| 作者单位 | 1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 2.Zhejiang Univ, Dept Appl Math, Hangzhou 310027, Peoples R China |
| 推荐引用方式 GB/T 7714 | Lin, GH,Yao, EY,He, Y. Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times[J]. OPERATIONS RESEARCH LETTERS,1998,22(2-3):75-81. |
| APA | Lin, GH,Yao, EY,&He, Y.(1998).Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times.OPERATIONS RESEARCH LETTERS,22(2-3),75-81. |
| MLA | Lin, GH,et al."Parallel machine scheduling to maximize the minimum load with nonsimultaneous machine available times".OPERATIONS RESEARCH LETTERS 22.2-3(1998):75-81. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。