@inproceedings{3de2c2f3fa7749b8b7b1a4e85a8ad2ba,
title = "Parametric algorithms for cyclic scheduling problems with applications to robotics",
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.",
keywords = "Cyclic scheduling, Intersection of polygons, Polynomial time algorithm, Robotic scheduling",
author = "Vladimir Kats and Eugene Levner",
year = "2008",
doi = "10.1007/978-3-540-88636-562",
language = "אנגלית",
isbn = "3540886354",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "653--663",
booktitle = "MICAI 2008",
note = "7th Mexican International Conference on Artificial Intelligence, MICAI 2008 ; Conference date: 27-10-2008 Through 31-10-2008",
}