Parametric Algorithms for Cyclic Scheduling Problems with Applications to Robotics

Authors:
Vladimir Kats;Eugene Levner
Affiliations:
Institute for Industrial Mathematics, Beer-Sheva, Israel;Holon Institute of Technology, Holon Bar-Ilan University, Ramat Gan, Israel
Venue:
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2008

Citing 5
Cited 1

Determining the optimal starting times in a cyclic schedule with a given route

Computers and Operations Research
Improved Algorithms for Linear Inequalities with Two Variables per Inequality

SIAM Journal on Computing
A parametric critical path problem and an application for cyclic scheduling

Discrete Applied Mathematics
A faster polynomial algorithm for 2-cyclic robotic scheduling

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

MICAI'06 Proceedings of the 5th Mexican international conference on Artificial Intelligence

Parametric algorithms for 2-cyclic robot scheduling with interval processing times

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper considers cyclic scheduling problems arising in planning of robotic flowlines and logistics. The problems are reduced to finding the minimum (or maximum) cost-to-time ratio in doubly weighted graphs. New combinatorial algorithms are developed extending the cyclic project scheduling algorithm by Romanovskii (1967) and the minimum-cost-to-time-ratio algorithm by Dantzig, Blattner and Rao (1967). Whereas Romanovskii's and Dantzig-Blattner-Rao's algorithms are restricted to solving problems with fixed numerical data, the new algorithms can treat input data that are varied at prescribed intervals. Several special cases are solved in strongly polynomial time.