|
|||||
|
|
Cyclic multiple-robot scheduling with time-window constraints using a critical path approach |
|
| Authors: | David Alcaide Chengbin Chu Vladimir Kats Eugene Levner Gerard Sierksma |
| Affiliation: | 1. Departamento de Estadística, Investigación Operativa y Computación, Avenida Astrofísico Francisco Sánchez, University of La Laguna, 38204 La Laguna, Tenerife, Spain;2. University of Technology, Troyes, France;3. Lam Research Corporation, Fremont, CA, USA;4. Holon Academic Institute of Technology, Holon, Israel;5. University of Groningen, Netherlands |
| Abstract: | An automated production system is considered in which several robots are used for transporting parts between workstations following a given route in a carousel mode. The problem is to maximize the throughput rate. Extending previous works treating scheduling problems for a single robot, we consider a more realistic case in which workstations are served by multiple robots. A graph model of the production process is developed, making it possible to apply PERT–CPM solution techniques. The problem is proved to be solvable in polynomial time. |
| Keywords: | Production&ndash transportation process Cyclic scheduling Robotic scheduling Parametric PERT&ndash CPM model Time windows Critical path |
| 本文献已被 ScienceDirect 等数据库收录！ | |