Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling

Authors:
Vladimir Kats;Eugene Levner
Affiliations:
Institute for Industrial Mathematics, Beer-Sheva, Israel;Holon Institute of Technology, Holon and Bar-Ilan University, Ramat Gan, Israel
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 9
Cited 2

The basic cyclic scheduling problem with deadlines

ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Cyclic schedules for job shops with identical jobs

Mathematics of Operations Research
Determining the optimal starting times in a cyclic schedule with a given route

Computers and Operations Research
A parametric critical path problem and an application for cyclic scheduling

Discrete Applied Mathematics
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Periodic schedules for linear precedence constraints

Discrete Applied Mathematics
Introduction to Scheduling

Introduction to Scheduling
A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule

Journal of Scheduling
Faster maximum and minimum mean cycle algorithms for system-performance analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Cyclic Flowshop Scheduling with Operators and Robots: Vyacheslav Tanaev's Vision and Lasting Contributions

Journal of Scheduling
Note: A note on periodic schedules for linear precedence constraints

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we revisit and extend the algorithm for the cyclic project scheduling problem which was originally proposed by Romanovskii (1967). While the algorithm has been derived for fixed numerical data, we show how it can be extended to handle the problems with interval data. We also propose a new algorithm for the cyclic scheduling problem with interval data that extends the parametric method developed by Megiddo (1979) and runs in strongly polynomial time.