A quadratic algorithm for the 2-cyclic robotic scheduling problem

doi:10.1016/j.tcs.2008.11.016

Theoretical Computer Science

Volume 410, Issues 8–10, 1 March 2009, Pages 973-976

https://doi.org/10.1016/j.tcs.2008.11.016 Get rights and content

Under an Elsevier user license

open archive

Abstract

We improve on an $O (n^{5} log n)$ algorithm by Kats and Levner [V. Kats, E. Levner, A polynomial algorithm for 2-cyclic robotic scheduling, in: Gelbukh, Reyes-García (Eds.), Proceedings of MICAI’06, in: LNAI, vol. 4293, Springer Verlag, 2006, pp. 439–449] for 2-cyclic robotic scheduling. We provide in this work an $O (n^{2} log n)$ algorithm for this problem.

Keywords

k

-cyclic robotic scheduling

Polynomial algorithm

Automated manufacturing process optimization

Theoretical Computer Science

NoteA quadratic algorithm for the 2-cyclic robotic scheduling problem

Abstract

Keywords

Note
A quadratic algorithm for the 2-cyclic robotic scheduling problem