minimizing makespan with release times on identical parallel batching machines
文献类型：期刊论文
| 作者 | Li SG ; Li GJ ; Zhang SQ |
| 刊名 | DISCRETE APPLIED MATHEMATICS
 |
| 出版日期 | 2005 |
| 卷号 | 148期号:1页码:127-134 |
| 关键词 | polynomial time approximation scheme identical parallel hatching machines scheduling makespan |
| ISSN号 | 0166-218X |
| 学科主题 | Mathematics, Applied |
| 收录类别 | SCI ; ACM ; SCIENCEDIRECT ; EI |
| 语种 | 英语 |
| 公开日期 | 2011-07-28 |
| 附注 | We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B (B < n) jobs as a batch simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. The objective is to minimize the maximum completion time (makespan). We present a polynomial time approximation scheme (PTAS) for this problem. (c) 2004 Elsevier B.V. All rights reserved. |
| 源URL | [http://124.16.136.157/handle/311060/12474]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Li SG,Li GJ,Zhang SQ. minimizing makespan with release times on identical parallel batching machines[J]. DISCRETE APPLIED MATHEMATICS,2005,148(1):127-134. |
| APA | Li SG,Li GJ,&Zhang SQ.(2005).minimizing makespan with release times on identical parallel batching machines.DISCRETE APPLIED MATHEMATICS,148(1),127-134. |
| MLA | Li SG,et al."minimizing makespan with release times on identical parallel batching machines".DISCRETE APPLIED MATHEMATICS 148.1(2005):127-134. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。