A Polynomial Algorithm for 2-Cyclic Robotic Scheduling

  • Vladimir Kats
  • Eugene Levner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4293)


We solve a single-robot m-machine cyclic scheduling problem arising in flexible manufacturing systems served by computer-controlled robots. The problem is to find the minimum cycle time for the so-called 2-cyclic (or “2-degree”) schedules, in which exactly two parts enter and two parts leave the production line during each cycle. An earlier known polynomial time algorithm for this problem was applicable only to the Euclidean case, where the transportation times must satisfy the “triangle inequality”. In this paper we study a general non-Euclidean case. Applying a geometrical approach, we construct a polynomial time algorithm of complexity O(m 5 log m).


Schedule Problem Singular Point Planar Graph Polynomial Time Algorithm Robot Move 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aizenshtat, V.S.: Multi-operator cyclic processes (Russian). Doklady of the Byelorussian Academy of Sciences 7(4), 224–227 (1963)MATHGoogle Scholar
  2. 2.
    Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling Computer and Manufacturing Processes. Springer, Berlin (1996)MATHGoogle Scholar
  3. 3.
    Bloch, A.S., Tanayev, V.S.: Multi-operator processes (Russian). In: Proceedings of the Byelorussian Academy of Sciences (physical and mathematical sciences), vol. (2), pp. 5–11 (1966)Google Scholar
  4. 4.
    Che, A., Chu, C., Chu, F.: Multicyclic hoist scheduling with constant processing times. IEEE Transactions on Robotics and Automation 18(1), 69–80 (2002)CrossRefGoogle Scholar
  5. 5.
    Che, A., Chu, C., Levner, E.: A polynomial algorithm for 2-degree cyclic robotscheduling. European Journal of Operational research 145(1), 31–44 (2003)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Chu, C.: A Faster Polynomial Algorithm for 2-cyclic robotic scheduling. Journal of Scheduling (in press, 2006)Google Scholar
  7. 7.
    Crama, Y., Kats, V., van de Klundert, J., Levner, E.: Cyclic scheduling in robotic flowshop. Annals of operations Research 96(1-4), 97–123 (2000)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Dawande, M., Geismer, H.N., Sethi, S.P., Sriskandarajah, C.: Sequencing and scheduling in robotic cells: recent developments. Journal of Scheduling 8(5), 387–426 (2005)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Dawande, M.N., Geismer, H.N., Sethi, S.P., Sriskandarajah, C.: Througput Optimization in Robotic Cells. Springer, Heidelberg (2006)Google Scholar
  10. 10.
    Kats, V., Levner, E.: Cyclic scheduling on a robotic production line. Journal of Scheduling 5, 23–41 (2002)MATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Kats, V., Levner, E.: A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling. Operations Research Letters 21, 171–179 (1997)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Kats, V., Levner, E., Meyzin, L.: Multiple-part cyclic hoist scheduling using a sieve method. IEEE Transactions on Robotics and Automation 15(4), 704–713 (1999)CrossRefGoogle Scholar
  13. 13.
    Lei, L., Liu, Q.: Optimal cyclic scheduling of a robotic processing line with two-product and time-window constraints. INFOR 39(2), 185–199 (2001)Google Scholar
  14. 14.
    Lei, L., Wang, T.J.: Determining optimal cyclic hoist schedules in a single-hoist electroplating line. IEE Transactions 26(2), 25–33 (1994)CrossRefGoogle Scholar
  15. 15.
    Levner, E., Kats, V., Sriskandarajah, C.: A geometric algorithm for finding two-unit cyclic schedules in no-wait robotic flowshop. In: Proceedings of the International Workshop in Intelligent Scheduling of Robots and FMS, WISOR 1996, pp. 101–112. HAIT Press, Holon, Israel (1996)Google Scholar
  16. 16.
    Megiddo, N.: Towards a genuinely polynomial algorithm for linear programming. SIAM Journal on Computing 12, 347–353 (1983)MATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Pinedo, M.: Scheduling. Theory, Algorithms and Systems, 2nd edn. Prentice-Hall, Englewood Cliffs (2002)MATHGoogle Scholar
  18. 18.
    Sethi, S.P., Sriskandarajah, C., Sorger, G., Blazewicz, J., Kubiak, W.: Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems 4, 331–358 (1992)CrossRefGoogle Scholar
  19. 19.
    Song, W., Zabinsky, Z.B., Storch, L.: An algorithm for scheduling a chemical process tank line. Production Planning & Control 4, 323–332 (1993)CrossRefGoogle Scholar
  20. 20.
    Suprunenko, D.A., Aizenshtat, V.S., Metel’sky, A.S.: Multi-operator transformation processes (in Russian). Doklady of the Byelorussian Academy of Sciences 6(9), 541–544 (1962)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Vladimir Kats
    • 1
  • Eugene Levner
    • 2
  1. 1.Institute for Industrial MathematicsBeer-ShevaIsrael
  2. 2.Holon Institute of TechnologyHolonIsrael

Personalised recommendations