A Polynomial Algorithm for 2-Cyclic Robotic Scheduling
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).
KeywordsSchedule Problem Singular Point Planar Graph Polynomial Time Algorithm Robot Move
Unable to display preview. Download preview PDF.
- 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
- 6.Chu, C.: A Faster Polynomial Algorithm for 2-cyclic robotic scheduling. Journal of Scheduling (in press, 2006)Google Scholar
- 9.Dawande, M.N., Geismer, H.N., Sethi, S.P., Sriskandarajah, C.: Througput Optimization in Robotic Cells. Springer, Heidelberg (2006)Google Scholar
- 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
- 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