Scheduling computer and manufacturing processes
Scheduling computer and manufacturing processes
Sequencing and Scheduling in Robotic Cells: Recent Developments
Journal of Scheduling
A faster polynomial algorithm for 2-cyclic robotic scheduling
Journal of Scheduling
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling
Operations Research Letters
Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Note: A quadratic algorithm for the 2-cyclic robotic scheduling problem
Theoretical Computer Science
Note: A quadratic algorithm for the 2-cyclic robotic scheduling problem
Theoretical Computer Science
Note: A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem
Theoretical Computer Science
| Hi-index | 0.00 |
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(m5 log m).