A faster polynomial algorithm for 2-cyclic robotic scheduling
A faster polynomial algorithm for 2-cyclic robotic scheduling
复制标题
DOI：
10.1007/s10951-006-8501-1
复制
发表时间：
2006-10
影响因子：
2
通讯作者：
C. Chu
中科院分区：
文献类型：
--
作者：
C. Chu
本文研究了无等待机器人流水车间中两个循环的相同零件调度问题，其中每个循环中只有两个零件进入生产线，两个零件离开生产线。这个问题以前被证明是多项式可解的O（N8logN）时间，其中N是在生产线的坦克的数量。本文提出了一种改进的算法，降低了复杂度O（N5logN）。
This paper addresses the 2-cyclic identical part scheduling in a no-wait robotic flowshop where exactly two parts enter and two parts leave the production line during each cycle. This problem was previously proved to be polynomially solvable inO(N8logN) time, whereNis the number of tanks in the production line. This paper proposes an improved algorithm with reduced complexityO(N5logN).