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

Vladimir Kats; Eugene Levner

doi:10.1016/j.cie.2010.04.009

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

Vladimir Kats, Eugene Levner

Department of Management

Institute for Industrial Mathematics Israel

Research output: Contribution to journal › Article › peer-review

13 Scopus citations

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.

Original language	English
Pages (from-to)	279-288
Number of pages	10
Journal	Computers and Industrial Engineering
Volume	61
Issue number	2
DOIs	https://doi.org/10.1016/j.cie.2010.04.009
State	Published - Sep 2011

Keywords

Cyclic scheduling
Robot scheduling
Scheduling
Strongly polynomial algorithm

Access to Document

10.1016/j.cie.2010.04.009

Cite this

@article{ea61c9c080b2439aad45edac876e4149,

title = "Cyclic routing algorithms in graphs: Performance analysis and applications to robot scheduling",

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.",

keywords = "Cyclic scheduling, Robot scheduling, Scheduling, Strongly polynomial algorithm",

author = "Vladimir Kats and Eugene Levner",

year = "2011",

month = sep,

doi = "10.1016/j.cie.2010.04.009",

language = "אנגלית",

volume = "61",

pages = "279--288",

journal = "Computers and Industrial Engineering",

issn = "0360-8352",

publisher = "Elsevier Ltd.",

number = "2",

}

TY - JOUR

T1 - Cyclic routing algorithms in graphs

T2 - Performance analysis and applications to robot scheduling

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 2011/9

Y1 - 2011/9

N2 - 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.

AB - 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.

KW - Cyclic scheduling

KW - Robot scheduling

KW - Scheduling

KW - Strongly polynomial algorithm

UR - http://www.scopus.com/inward/record.url?scp=80052441663&partnerID=8YFLogxK

U2 - 10.1016/j.cie.2010.04.009

DO - 10.1016/j.cie.2010.04.009

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:80052441663

SN - 0360-8352

VL - 61

SP - 279

EP - 288

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

IS - 2

ER -

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

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this