minimizing makespan on a single batching machine with release times and non-identical job sizes
文献类型：期刊论文
| 作者 | Li SG ; Li GJ ; Wang XL ; Liu QM |
| 刊名 | OPERATIONS RESEARCH LETTERS
 |
| 出版日期 | 2005 |
| 卷号 | 33期号:2页码:157-164 |
| 关键词 | approximation algorithms scheduling batch processing makespan release times |
| ISSN号 | 0167-6377 |
| 学科主题 | Operations Research & Management Science |
| 收录类别 | SCI ; SCIENCEDIRECT ; EI |
| 语种 | 英语 |
| 公开日期 | 2011-07-28 |
| 附注 | We consider the problem of scheduling jobs with release times and non-identical job sizes on a single batching machine; our objective is to minimize makespan. We present an approximation algorithm with worst-case ratio 2 + epsilon, where epsilon > 0 can be made arbitrarily small. (C) 2004 Elsevier B.V. All rights reserved. |
| 源URL | [http://124.16.136.157/handle/311060/12476]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Li SG,Li GJ,Wang XL,et al. minimizing makespan on a single batching machine with release times and non-identical job sizes[J]. OPERATIONS RESEARCH LETTERS,2005,33(2):157-164. |
| APA | Li SG,Li GJ,Wang XL,&Liu QM.(2005).minimizing makespan on a single batching machine with release times and non-identical job sizes.OPERATIONS RESEARCH LETTERS,33(2),157-164. |
| MLA | Li SG,et al."minimizing makespan on a single batching machine with release times and non-identical job sizes".OPERATIONS RESEARCH LETTERS 33.2(2005):157-164. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。