A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
A branch and bound algorithm for optimal cyclic scheduling in a robotic cell with processing time windows
复制标题
具有处理时间窗口的机器人单元中最优循环调度的分支定界算法
DOI:
10.1080/00207540903225205
复制
发表时间:
2010-11
影响因子:
9.2
通讯作者:
Naiding Yang
中科院分区:
文献类型:
--
作者:
Chengbin Chu;Pengyu Yan;Ada Che;Naiding Yang
A branch and bound algorithm is described for optimal cyclic scheduling in a robotic cell with processing time windows. The objective is to minimise the cycle time by determining the exact processing time on each machine which is limited within a time window. The problem is formulated as a set of prohibited intervals of the cycle time, which is usually applied in the robotic cyclic scheduling problem with fixed processing times. Since both bounds of these prohibited intervals are linear expressions of the processing times, we divide these prohibited intervals into a series of the subsets and transform the problem into enumerating the non-prohibited intervals of cycle time in each subset. This enumeration procedure is completed by an efficient branch and bound algorithm, which could find an optimal solution by enumerating partial non-prohibited intervals. Computational results on the benchmark instances and randomly generated test instances indicate that the algorithm is effective.
登录
查看更多内容
影响因子:
--
作者:
L. Phillips;P. S. Unger
通讯作者:
L. Phillips;P. S. Unger
DOI:
10.1109/70.660860
发表时间:
1998-02
期刊:
IEEE Trans. Robotics Autom.
影响因子:
--
作者:
Haoxun Chen;C. Chu;J. Proth
通讯作者:
Haoxun Chen;C. Chu;J. Proth
DOI:
10.1007/11925231_41
发表时间:
2006-11
期刊:
--
影响因子:
--
作者:
V. Kats;E. Levner
通讯作者:
V. Kats;E. Levner
DOI:
10.1007/bf00167800
发表时间:
1996
期刊:
International Journal of Flexible Manufacturing Systems
影响因子:
--
作者:
W. Ng
通讯作者:
W. Ng
影响因子:
2.7
作者:
A. Che;C. Chu
通讯作者:
A. Che;C. Chu