Robotic cells with stochastic processing times
Authors:
- 30 September 2010
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 42 (12) , 897-914
Abstract
This article considers the scheduling of flow shops with a common server that performs all material handling, including the transfer of parts between machines, in the context of robotic cell flow shops. Specifically, the first analytic study of the operations of a robotic cell in which one process has a stochastic processing time, which is common in the microlithography portion of semiconductor manufacturing, is presented. How to measure throughput in such cells is defined and then how the proximity of the stochastic process to the bottleneck process affects throughput is demonstrated. The distribution function of the robot's sequence time is found and verified with simulation results. This yields formulas for the cell's expected throughput. On-line scheduling schemes to improve throughput are presented.Keywords
This publication has 36 references indexed in Scilit:
- Complexity of One-Cycle Robotic Flow-ShopsJournal of Scheduling, 2003
- A polynomial algorithm for 2-degree cyclic robot schedulingEuropean Journal of Operational Research, 2003
- Multicyclic hoist scheduling with constant processing timesIEEE Transactions on Robotics and Automation, 2002
- Cycle-time improvements for photolithography process in semiconductor manufacturingIEEE Transactions on Semiconductor Manufacturing, 2001
- Part sequencing in three-machine no-wait robotic cellsOperations Research Letters, 2000
- Cyclic scheduling in robotic flowshopsAnnals of Operations Research, 2000
- Scheduling no-wait robotic cells with two and three machinesEuropean Journal of Operational Research, 2000
- Mean and Variance of Truncated Normal DistributionsThe American Statistician, 1999
- Cyclic scheduling of a hoist with time window constraintsIEEE Transactions on Robotics and Automation, 1998
- Stochastic Analysis of Cyclic SchedulesOperations Research, 1993