Skip to main content
Log in

Sequencing and Scheduling in Robotic Cells: Recent Developments

  • Published:
Journal of Scheduling Aims and scope Submit manuscript

Abstract

A great deal of work has been done to analyze the problem of robot move sequencing and part scheduling in robotic flowshop cells. We examine the recent developments in this literature. A robotic flowshop cell consists of a number of processing stages served by one or more robots. Each stage has one or more machines that perform that stage’s processing. Types of robotic cells are differentiated from one another by certain characteristics, including robot type, robot travel-time, number of robots, types of parts processed, and use of parallel machines within stages. We focus on cyclic production of parts. A cycle is specified by a repeatable sequence of robot moves designed to transfer a set of parts between the machines for their processing.

We start by providing a classification scheme for robotic cell scheduling problems that is based on three characteristics: machine environment, processing restrictions, and objective function, and discuss the influence of these characteristics on the methods of analysis employed. In addition to reporting recent results on classical robotic cell scheduling problems, we include results on robotic cells with advanced features such as dual gripper robots, parallel machines, and multiple robots. Next, we examine implementation issues that have been addressed in the practice-oriented literature and detail the optimal policies to use under various combinations of conditions. We conclude by describing some important open problems in the field.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  • Agnetis, A., “Scheduling no-wait robotic cells with two and three machines,” European Journal of Operational Research, 123, 303–314 (2000).

    Article  MathSciNet  Google Scholar 

  • Agnetis, A. and D. Pacciarelli, “Part sequencing in three-machine no-wait robotic cells,” Operations Research Letters, 27, 185–192 (2000).

    Article  Google Scholar 

  • Akçalı, E., K. Nemoto, and R. Uzsoy, “Cycle-time improvements for photolithography process in semiconductor manufacturing,” IEEE Transactions on Semiconductor Manufacturing, 14, 48–56 (2001).

    Article  Google Scholar 

  • Aneja, Y. P. and H. Kamoun, “Scheduling of parts and robot activities in a two-machine robotic cell,” Computers and Operations Research, 26, 297–312 (1999).

    Article  Google Scholar 

  • Asfahl, C. R., Robots and Manufacturing Automation, John Wiley & Sons, New York, NY, 1985.

    Google Scholar 

  • Baumann, W., R. Birner, J. Haensler, R. P. Hartmann, and A. B. Stevens, “Operating and idle times for cyclic multi-machine servicing,” The Industrial Robot, 44–49 (1981).

  • Bedini, R., G. G. Lisini, and P. Sterpos, “Optimal programming of working cycles for industrial robots,” Journal of Mechanical Design. Transactions of the ASME, 101, 250–257 (1979).

    Google Scholar 

  • Błażewicz, J., H. Eiselt, G. Finke, G. LaPorte, and J. Weglarz. “Scheduling tasks and vehicles in a flexible manufacturing system,” International Journal of Flexible Manufacturing Systems, 4, 5–16 (1991).

    Article  Google Scholar 

  • Błażewicz, J., S. P. Sethi, and C. Sriskandarajah, “Scheduling of robot moves and parts in a robotic cell,” in K. E. Stecke and R. Suri (eds.), Proceedings of the Third ORSA/TIMS Conference on Flexible Manufacturing Systems: Operations Research Models and Applications (Ann Arbor, MI), Elsevier Science Publishers, B.V., Amsterdam, The Netherlands, 1989, pp. 281–286.

  • Brauner, N. and G. Finke, “Final results on the one-cycle conjecture in robotic cells,” Internal note, Laboratoire LEIBNIZ, Institut IMAG, Grenoble, France, 1997.

  • Brauner, N. and G. Finke, “Cyclic scheduling in a robotic flowshop,” in Proceedings IEPM’97, International Conference on Industrial Engineering and Production Management, Lyon, France, 1997, vol.1, pp. 439–449.

  • Brauner, N. and G. Finke, “On a conjecture in robotic cells: new simplified proof for the three-machine case,” INFOR, 37(1), 20–36 (1999).

    Google Scholar 

  • Brauner, N. and G. Finke, “Optimal moves of the material handling system in a robotic cell,” International Journal of Production Economics, 74, 269–277 (2001a).

    Article  Google Scholar 

  • Brauner, N. and G. Finke, “Cycles and permutations in robotic cells,” Mathematical and Computer Modeling, 34, 565–591 (2001b).

    Article  Google Scholar 

  • Brauner, N., G. Finke, and W. Kubiak, “Complexity of one-cycle robotic flow-shops,” Journal of Scheduling, 6, 355–371 (2003).

    Article  Google Scholar 

  • Che, A., C. Chu, and F. Chu, “Multicyclic hoist scheduling with constant processing times,” IEEE Transactions on Robotics and Automation, 18(1), 69–80 (2002).

    Article  Google Scholar 

  • Che, A., C. Chu, and E. Levner, “A polynomial algorithm for 2-degree cyclic robot scheduling,” European Journal of Operational Research, 145(1), 31–44 (2003).

    Article  Google Scholar 

  • Chen, H., C. Chu, and J. Proth, “Cyclic scheduling with time window constraints,” IEEE Transactions on Robotics and Automation, 14(1), 144–152 (1998).

    Article  Google Scholar 

  • Claybourne, B. H., “Scheduling robots in flexible manufacturing cells,” CME Automation, 30(5), 36–40 (1983).

    Google Scholar 

  • Crama, Y., “Combinatorial optimization models for production scheduling in automated manufacturing systems,” European Journal of Operational Research, 99, 136–153 (1997).

    Article  Google Scholar 

  • Crama, Y., V. Kats, J. van de Klundert, and E. Levner, “Cyclic scheduling in robotic flowshops,” Annals of Operations Research: Mathematics of Industrial Systems, 96, 97–124 (2000).

    Google Scholar 

  • Crama, Y. and J. van de Klundert, “Cyclic scheduling of identical parts in a robotic cell,” Operations Research, 6, 952–965 (1997a).

    Google Scholar 

  • Crama, Y. and J. van de Klundert, “Robotic flowshop scheduling is strongly NP-complete,” in W. K. Klein Haneveld et al. (eds.), Ten Years LNMB, CWI Tract, Amsterdam, 1997b, pp. 277–286.

  • Crama, Y. and J. van de Klundert, “Cyclic scheduling in 3-machine robotic flowshops,” Journal of Scheduling, 2, 35–54 (1999).

    Article  MathSciNet  Google Scholar 

  • Dawande, M., N. Geismar, and S. Sethi, “Dominance of cyclic solutions and some open problems in scheduling bufferless robotic cells,” to appear in SIAM Review, 2006a.

  • Dawande, M., N. Geismar, S. Sethi, and C. Sriskandarajah, Throughput Optimization in Robotic Cells, Springer, to appear.

  • Dawande, M., C. Sriskandarajah, and S. Sethi, “On throughput maximization in constant travel-time robotic cells,” Manufacturing and Service Operations Management, 4(4), 296–312 (2002).

    Article  Google Scholar 

  • Devedzic, V., “A knowledge-based system for the strategic control level of robots in flexible manufacturing cell,” International Journal of Flexible Manufacturing Systems, 2(4), 263–287 (1990).

    Google Scholar 

  • Dixon, C. and S. D. Hill, “Work-cell cycle-time analysis in a flexible manufacturing system,” in Proceedings of the Pacific Conference in Manufacturing, Sydney and Melbourne, Australia, 1990, vol. 1, pp.182–189.

  • Drobouchevitch, I. G., S. Sethi, and C. Sriskandarajah, “Scheduling dual gripper robotic cell: 1-unit cycles,” to appear in European Journal of Operational Research, 2005.

  • Drobouchevitch, I. G., S. Sethi, J. Sidney, and C. Sriskandarajah, “A note on scheduling multiple parts in two-machine dual gripper robotic cell: Heuristic algorithm and performance guarantee,” International Journal of Operations and Quantitative Management, 10(4), 297–314 (2004).

    Google Scholar 

  • Duenyas, I., J. W. Fowler, and L. W. Schruben, “Planning and scheduling in JAPANESE SEMICONDUCTOR MANUFACTURING,” Journal of Manufacturing Systems, 1994, pp. 323–333.

  • Finke, G., C. Gueguen, and N. Brauner, “Robotic cells with buffer space,” in R. O’Connor and P. Magee (eds.), ECCO IX Conference Proceedings, Dublin City University, 1996.

  • Garey, M. R. and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, San Francisco, 1979.

    Google Scholar 

  • Geismar, H. N., M. Dawande, and C. Sriskandarajah, “Robotic cells with parallel machines: Throughput maximization in constant travel-time cells,” Journal of Scheduling, 7, 375–395 (2004a).

    Article  Google Scholar 

  • Geismar, H. N., M. Dawande, and C. Sriskandarajah, “Approximation algorithms for k-unit Cyclic Solutions in Robotic Cells,” European Journal of Operational Research, 162, 291–309 (2005).

    Article  Google Scholar 

  • Geismar, H. N., M. Dawande, and C. Sriskandarajah, “Scheduling constant travel-time dual gripper robotic cells with parallel machines,” Working Paper, School of Management, University of Texas at Dallas, 2004b.

  • Geismar, H. N., S. P. Sethi, J. B. Sidney, and C. Sriskandarajah, “A note on productivity gains in flexible robotic cells,” Working Paper, School of Management, University of Texas at Dallas, 2004c.

  • Geismar, H. N., C. Sriskandarajah, and N. Ramanan, “Increasing throughput for robotic cells with parallel machines and multiple robots,” IEEE Transactions on Automation Science and Engineering, 1(1), 84–89 (2004d).

    Article  Google Scholar 

  • Gilmore, P. and R. Gomory, “Sequencing a one-state variable machine: A solvable case of the traveling salesman problem,” Operations Research, 12, 675–679 (1964).

    Google Scholar 

  • Graham, R. L., E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnoy Kan, “Optimization and approximation in deterministic sequencing and scheduling: A survey,” Annals of Discrete Mathematics, 5, 287–326 (1979).

    MathSciNet  Google Scholar 

  • Hall, N., “Operations research techniques for robotic systems,” in S. Y. Nof (ed.), Handbook of Industrial Robotics, 2nd ed., John Wiley and Sons, 1999.

  • Hall, N. G., H. Kamoun, and C. Sriskandarajah, “Scheduling in robotic cells: Classification, two- and three-machine cells,” Operations Research, 45, 421–439 (1997).

    Google Scholar 

  • Hall, N. G., H. Kamoun, and C. Sriskandarajah, “Scheduling in robotic cells: Complexity and steady state analysis,” European Journal of Operational Research, 109, 43–63 (1998).

    Article  Google Scholar 

  • Hall, N. G. and C. Sriskandarajah, “A survey of machine scheduling problems with blocking and no-wait in process,” Operations Research, 44(3), 510–525 (1996).

    Google Scholar 

  • Hall, N. G., C. Potts, and C. Sriskandarajah, “Parallel machine scheduling with a common server,” Discrete Applied Mathematics, 102, 223–243 (2000).

    Article  Google Scholar 

  • Herrmann, J., N. Chandrasekaran, B. Conaghan, M. Nguyen, G. Rubloff, and R. Shi, “Evaluating the impact of process changes on cluster tool performance,” IEEE Transactions on Semiconductor Manufacturing, 13, 181–192 (2000).

    Article  Google Scholar 

  • Ioachim, I. and F. Soumis, “Schedule efficiency in a robotic production cell,” The International Journal of Flexible Manufacturing Systems, 7, 5–26 (1995).

    Article  Google Scholar 

  • Kamoun, H., “Scheduling in repetitive manufacturing systems: COMPLEXITY, HEURISTIC ALGORITHMS AND SYSTEM DESIGN,” Ph.D. Thesis, Graduate Department of Industrial Engineering, University of Toronto, 1994.

  • Kamoun, H., N. G. Hall, and C. Sriskandarajah, “Scheduling in robotic cells: Heuristics and cell design,” Operations Research, 47, 821–835 (1999).

    Google Scholar 

  • Kats, V., “An exact optimal cyclic scheduling algorithm for multioperator service of a production line, part 2,” Automation and Remote Control, 42(4), 538–543 (1982).

    Google Scholar 

  • Kats, V. and E. Levner, “Minimizing the number of robots to meet a given schedule,” Annals of Operations Research, 69, 209–226 (1997).

    Article  Google Scholar 

  • Kats, V. and E. Levner, “Polynomial algorithms for cyclic scheduling of tasks on parallel processors,” in Proceedings of the 16th IASTED International Conference on Applied Informatics, Garmisch, Germany, 1998, pp. 302–304.

  • Kats, V. and E. Levner, “Cycle scheduling in a robotic production line,” Journal of Scheduling, 5, 23–41 (2002).

    Article  MathSciNet  Google Scholar 

  • Kats, V., E. Levner, and L. Meyzin, “Multiple-part cyclic hoist scheduling using a sieve method,” IEEE Transactions on Robotics and Automation, 15(4), 704–713 (1999).

    Article  Google Scholar 

  • Kondoleon, A. S., “Cycle time analysis of robot assembly systems,” in Proceedings of the Ninth Symposium on Industrial Robots, 1979, pp. 575–587.

  • Kumar, S., N. Ramanan, and C. Sriskandarajah, “Minimizing cycle time in large robotic cells,” IIE Transactions, 37(2), 123–136 (2005).

    Article  Google Scholar 

  • Lawler, E. L., J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (eds.), The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, John Wiley & Sons, Chichester, 1985.

    Google Scholar 

  • Lei, L. and T. J. Wang, “Determining optimal cyclic hoist schedules in a single-hoist electroplating line,” IIE Transactions, 26(2), 25–33 (1994).

    Google Scholar 

  • Levner, E., V. Kats, and V. Levit, “An improved algorithm for cyclic flowshop scheduling in a robotic cell,” European Journal of Operational Research, 97, 500–508 (1997).

    Article  Google Scholar 

  • Little, J. D. C., “A proof for the queuing formula: L = λ W,” Operations Research, 9(3), 383–387 (1961).

    Google Scholar 

  • Logendran, R. and C. Sriskandarajah, “Sequencing of robot activities and parts in two-machine robotic cells,” International Journal of Production Research, 34(12), 3447–3463 (1996).

    Google Scholar 

  • Maimon, O. Z. and S. Y. Nof, “Coordination of robots sharing assembly tasks,” Journal of Dynamic Systems Measurement and Control. Transactions of the ASME, 107(4), 299–307 (1985).

    Google Scholar 

  • Mangione, F., N. Brauner, and B. Penz, “Optimal cycles for the robotic balanced no-wait flowshop,” in Proceedings IEPM’03, International Conference of Industrial Engineering and Production Management, Porto, Portugal, May 2003.

  • Medeiros, D. J., E. F. Watson, J. S. Carson, and M. S. Manivannan (eds.), “Operational modeling & simulation in semiconductor manufacturing,” in Proceedings of the 1998 Winter Simulation Conference.

  • Miller, R. K., Robots in Industry: Applications for the Electronics Industry, SEAI Institute, New York, 1984.

    Google Scholar 

  • Nof, S. Y. and D. Hannah, “Operational characteristics of multi-robot systems with cooperation,” International Journal of Production Research, 27(3), 477–492 (1989).

    Google Scholar 

  • Perkinson, T., P. McLarty, R. Gyurcsik, and R. Cavin, “Single-wafer cluster tool performance: An analysis of throughput,” IEEE Transactions on Semiconductor Manufacturing, 7, 369–373 (1994).

    Article  Google Scholar 

  • Perkinson, T., R. Gyurcsik, and P. McLarty, “Single-wafer cluster tool performance: An analysis of the effects of redundant chambers and revisitation sequences on throughput,” IEEE Transactions on Semiconductor Manufacturing, 9, 384–400 (1996).

    Article  Google Scholar 

  • Pinedo, M., Scheduling: Theory, Algorithms, and Systems, Prentice Hall, Englewood Cliffs, New Jersey, 1995.

    Google Scholar 

  • Ramanan, N., personal communication, 2002.

  • Rudge, D. A., “The automation of solution phase synthetic chemistry using XP zymate laboratory robotic systems,” Laboratory Automation and Information Management, 33, 81–86 (1997).

    Article  Google Scholar 

  • Sethi, S. P., C. Sriskandarajah, G. Sorger, J. Błażewicz, and W. Kubiak, “Sequencing of parts and robot moves in a robotic cell,” Int. J. Flexible Manufacturing Systems, 4, 331–358 (1992).

    Article  Google Scholar 

  • Sethi, S. P., J. Sidney, and C. Sriskandarajah, “Scheduling in dual gripper robotic cells for productivity gains,” IEEE Transactions on Robotics and Automation, 17, 324–341 (2001).

    Article  Google Scholar 

  • Sriskandarajah, C., I. G. Drobouchevitch, S. Sethi, and R. Chandrasekaran, “Scheduling multiple parts in a robotic cell served by a dual gripper robot,” Operations Research, 52, 65–82 (2004).

    Article  MathSciNet  Google Scholar 

  • Sriskandarajah, C., N. G. Hall, and H. Kamoun, “Scheduling large robotic cells without buffers,” Annals of Operations Research, 76, 287–321 (1998).

    Article  Google Scholar 

  • Su, Q. and F. Chen, “Optimal sequencing of double-gripper gantry robot moves in tightly-coupled serial production systems,” IEEE Transactions on Robotics and Automation, 12, 22–30 (1996).

    Article  Google Scholar 

  • Suri, R., “Quantitative techniques for robotic systems analysis,” in S. Y. Nof (ed.), Handbook of Industrial Robotics, John Wiley and Sons, 1985, Vol. I.

  • Van de Klundert, J., Scheduling Problems in Automated Manufacturing, Faculty of Economics and Business Administration, University of Limburg, Maastricht, The Netherlands, Dissertation no. 96-35, 1996.

  • Venkatesh, S., R. Davenport, P. Foxhoven, and J. Nulman, “A steady-state throughput analysis of cluster tools: Dual-blade versus single-blade robots,” IEEE Transactions on Semiconductor Manufacturing, 10, 418–424 (1997).

    Article  Google Scholar 

  • Wilhelm, W. E., “Complexity of sequencing tasks in assembly cells attended by one or two robots,” Naval Research Logistics, 34, 721–738 (1987).

    Google Scholar 

  • Wittrock, R. J., “Scheduling algorithms for flexible flow lines,” IBM Journal of Research and Development, 29, 401–412 (1985).

    Google Scholar 

  • Wood, S., “Simple performance models for integrated processing tools,” IEEE Transactions on Semiconductor Manufacturing, 9, 320–328 (1996).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Milind Dawande.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dawande, M., Geismar, H.N., Sethi, S.P. et al. Sequencing and Scheduling in Robotic Cells: Recent Developments. J Sched 8, 387–426 (2005). https://doi.org/10.1007/s10951-005-2861-9

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10951-005-2861-9

Keywords

Navigation