We consider the problem of scheduling operations in bufferless robotic cells that produce identical parts. The objective is to find a cyclic sequence of robot moves that minimizes the long-run average time to produce a part or, equivalently, maximizes the throughput rate. The robot can be moved in simple cycles that produce one unit or, in more complicated cycles, that produce multiple units. Because one-unit cycles are the easiest to understand, implement, and control, they are widely used in industry. We analyze one-unit cycles for a class of robotic cells calledconstant travel-time robotic cells. We complete a structural analysis of the class of one-unit cycles and obtain a polynomial time algorithm for finding an optimal one-unit cycle.Constant travel-time robotic cells are used in real manufacturing operations that the authors have encountered during their interactions with companies. The results and the analysis in this paper offer practitioners (i) a tool to experiment with and study the design of a proposed robotic cell during a prototyping exercise, (ii) a lower bound on the throughput of a robotic cell to help them make an informed assessment of the ultimate productivity level, and (iii) a benchmark throughput level (for comparison purposes) for robotic cells whose operations differ slightly from those discussed in this paper.
[1]
Chelliah Sriskandarajah,et al.
Scheduling in robotic cells: Complexity and steady state analysis
,
1998,
Eur. J. Oper. Res..
[2]
G. Finke,et al.
Cycles and permutations in robotic cells
,
2001
.
[3]
Yves Crama,et al.
Cyclic scheduling in 3-machine robotic flow shops
,
1999
.
[4]
Chelliah Sriskandarajah,et al.
Analytical and metaheuristic solutions for emerging scheduling problems in e-commerce and robotics
,
2001
.
[5]
Yves Crama,et al.
Cyclic Scheduling of Identical Parts in a Robotic Cell
,
1997,
Oper. Res..
[6]
Gerd Finke,et al.
Complexity of One-Cycle Robotic Flow-Shops
,
2003,
J. Sched..
[7]
Wieslaw Kubiak,et al.
Sequencing of parts and robot moves in a robotic cell
,
1992
.
[8]
Gerd Finke,et al.
On A Conjecture About Robotic Cells: New Simplified Proof For The Three-Machine Case
,
1999
.
[9]
Chelliah Sriskandarajah,et al.
Scheduling in Robotic Cells: Heuristics and Cell Design
,
1999,
Oper. Res..
[10]
Chelliah Sriskandarajah,et al.
Scheduling large robotic cells without buffers
,
1998,
Ann. Oper. Res..
[11]
Chelliah Sriskandarajah,et al.
Scheduling in Robotic Cells: Classification, Two and Three Machine Cells
,
1997,
Oper. Res..