提示
李国君
-
45浏览
-
0点赞
-
0收藏
-
0分享
-
88下载
-
0评论
-
引用
期刊论文
Note Minimizing makespan with release times on identical parallel batching machines
Discrete Applied Mathematics 148(2005)127-134，-0001，（）：
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.
【免责声明】以下全部内容由[李国君]上传于[2009年03月06日 13时29分14秒]，版权归原创者所有。本文仅代表作者本人观点，与本网站无关。本网站对文中陈述、观点判断保持中立，不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考，并请自行承担全部责任。
本学者其他成果
同领域成果
