Cyclic scheduling of a robotic flexible cell with load lock and swap

In this paper, we study the problem of robotic cell scheduling with m machines with flexibility, load lock and swap assumptions. The robotic cell repetitively produces parts of identical types. We determine the cycle time of all 1-unit cycles in this type of robotic cell and present two new lower bounds for robot move cycles with load lock and swap, either there is flexibility or inflexibility. We also provide a new robot move cycle and prove that it dominates all classical robot move cycles considered in the existing literature of m-machine robotic cells.