A parametric critical path problem and an application for cyclic scheduling
Discrete Applied Mathematics
On Throughput Maximization in Constant Travel-Time Robotic Cells
Manufacturing & Service Operations Management
Complexity of one-cycle robotic flow-shops
Journal of Scheduling
Sequencing and Scheduling in Robotic Cells: Recent Developments
Journal of Scheduling
A faster polynomial algorithm for 2-cyclic robotic scheduling
Journal of Scheduling
Identical part production in cyclic robotic cells: Concepts, overview and open questions
Discrete Applied Mathematics
A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case
Discrete Applied Mathematics
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
Cycles and permutations in robotic cells
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Consider an m-machine production line for processing identical parts served by a mobile robot. The problem is to find the minimum cycle time for 2-cyclic schedules, that is, schedules in which exactly two parts enter and two parts leave the production line during each cycle. This work treats a special case of the 2-cyclic robot scheduling problem when the robot route is given and operation durations are chosen from prescribed intervals. A strongly polynomial algorithm of time complexity O(m 8log驴m) is proposed.