A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case

Authors:
Vladimir Kats;Eugene Levner
Affiliations:
Institute for Industrial Mathematics, Beer-Sheva, P.O. Box 15013, 84105, Israel;Holon Institute of Technology, Holon, P.O. Box 305, 58102, Israel
Venue:
Discrete Applied Mathematics
Year:
2009

Citing 4
Cited 4

Robotic cell scheduling with operational flexibility

Discrete Applied Mathematics
Sequencing and Scheduling in Robotic Cells: Recent Developments

Journal of Scheduling
A faster polynomial algorithm for 2-cyclic robotic scheduling

Journal of Scheduling
A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling

Operations Research Letters

Note: A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem

Theoretical Computer Science
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Computers and Industrial Engineering
A polynomial algorithm for multi-robot 2-cyclic scheduling in a no-wait robotic cell

Computers and Operations Research
Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Journal of Scheduling

Quantified Score

Hi-index	0.05

Visualization

Abstract

In this paper we consider the problem of no-wait cyclic scheduling of identical parts in an m-machine production line in which a robot is responsible for moving each part from a machine to another. The aim is to find the minimum cycle time for the so-called 2-cyclic schedules, in which exactly two parts enter and two parts leave the production line during each cycle. The earlier known polynomial-time algorithms for this problem are applicable only under the additional assumption that the robot travel times satisfy the triangle inequalities. We lift this assumption on robot travel times and present a polynomial-time algorithm with the same time complexity as in the metric case, O(m^5logm).