-
51浏览
-
0点赞
-
0收藏
-
0分享
-
83下载
-
0评论
-
引用
期刊论文
Minimizing makespan on a single batching machine with release times andnon-id entical job sizes
Operations Research Letters 33(2005)157-164,-0001,():
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+ε, where ε>0 can be made arbitrarily small
【免责声明】以下全部内容由[李国君]上传于[2009年03月06日 13时28分54秒],版权归原创者所有。本文仅代表作者本人观点,与本网站无关。本网站对文中陈述、观点判断保持中立,不对所包含内容的准确性、可靠性或完整性提供任何明示或暗示的保证。请读者仅作参考,并请自行承担全部责任。
本学者其他成果
同领域成果