期刊
ANZIAM JOURNAL
卷 47, 期 -, 页码 265-275出版社
AUSTRALIAN MATHEMATICS PUBL ASSOC INC
DOI: 10.1017/S1446181100010026
关键词
-
This paper deals with n-job, 2-machine flowshop/mean flowtime scheduling problems working under a no-idle constraint, that is, when machines work continuously without idle intervals. A branch and bound technique has been developed to solve the problem.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据