Approximation schemes for scheduling a batching machine with nonidentical job size
文献类型：期刊论文
| 作者 | Zhang, Xianzhao1; Zhang, Yuzhong2; Cao, Zhigang3; Cai, Zengxia1 |
| 刊名 | JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY
 |
| 出版日期 | 2007-12-01 |
| 卷号 | 20期号:4页码:592-600 |
| 关键词 | approximation scheme batching machine size worst case ratio |
| ISSN号 | 1009-6124 |
| 英文摘要 | In this paper we study the problem of scheduling a batching machine with nonidentical job sizes. The jobs arrive simultaneously and have unit processing time. The goal is to minimize the total completion times. Having shown that the problem is NP-hard, we put forward three approximation schemes with worst case ratio 4, 2, and 3/2, respectively. |
| WOS研究方向 | Mathematics |
| 语种 | 英语 |
| WOS记录号 | WOS:000255240600014 |
| 出版者 | SPRINGER |
| 源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/5137]  |
| 专题 | 中国科学院数学与系统科学研究院 |
| 通讯作者 | Zhang, Xianzhao |
| 作者单位 | 1.Linyi Normal Univ, Dept Math, Linyi 276000, Peoples R China 2.Qufu Normal Univ, Coll Operat Res & Management, Rizhao 276826, Peoples R China 3.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Zhang, Xianzhao,Zhang, Yuzhong,Cao, Zhigang,et al. Approximation schemes for scheduling a batching machine with nonidentical job size[J]. JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,2007,20(4):592-600. |
| APA | Zhang, Xianzhao,Zhang, Yuzhong,Cao, Zhigang,&Cai, Zengxia.(2007).Approximation schemes for scheduling a batching machine with nonidentical job size.JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY,20(4),592-600. |
| MLA | Zhang, Xianzhao,et al."Approximation schemes for scheduling a batching machine with nonidentical job size".JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 20.4(2007):592-600. |
入库方式： OAI收割
来源：数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。