Scheduling in dual gripper robotic cells for productivity gains
Suresh Sethi, Jeff Sidney, Chelliah Sriskandarajah
- 发表年份
- 2001
- 引用次数
- 91
摘要
We consider single part-type problems. Since all parts produced are identical, it is sufficient to determine the sequence of moves performed by the robot. The processing constraints define the cell to be a flowshop. The objective is the minimization of the steady-state cycle time to produce a part, or equivalently the maximization of the throughput rate. We study the problem of scheduling robot moves in dual gripper robot cells functioning in a bufferless environment. We develop an analytical framework for studying dual gripper robotic cells and examine the cycle time advantage of using a dual gripper rather than a single gripper robot. It is shown that an m-machine dual gripper robot cell can have at most double the productivity of its single gripper counterpart. We also propose a practical heuristic algorithm to compare productivity for given cell data. Computational testing of the algorithm on realistic problem instances is also described.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002