中国科技论文在线

期刊论文

已为您找到该学者7条结果成果回收站

排序

上传时间

2009年03月06日

【期刊论文】Note Minimizing makespan with release times on identical parallel batching machines

李国君， Shuguang Lia， *， Guojun Lib， c，， Shaoqiang Zhangd

Discrete Applied Mathematics 148(2005)127-134，-0001，（）：

-1年11月30日

摘要

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.

Polynomial time approximation scheme， Identical parallel batching machines， Scheduling， Makespan