The howard-romanovskii routing algorithm revisited, with applications torobot scheduling

Vladimir Kats; Eugene Levner

The howard-romanovskii routing algorithm revisited, with applications torobot scheduling

Vladimir Kats, Eugene Levner

Department of Social & Health Sciences

Institute for Industrial Mathematics Israel

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

Abstract

We consider the original routing algorithm invented by Romanovskii (1967)for solving a cyclic project scheduling problem and establish its closerelationship with the well-known routing algorithm by Dantzig, Blattner and Rao(1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can onlytreat fixed numerical data, we show that they both can be extended to solveproblems with interval-valued input data.

Original language	English
Title of host publication	2009 International Conference on Computers and Industrial Engineering, CIE 2009
Pages	143-148
Number of pages	6
State	Published - 2009
Event	2009 International Conference on Computers and Industrial Engineering, CIE 2009 - Troyes, France Duration: 6 Jul 2009 → 9 Jul 2009

Publication series

Name	2009 International Conference on Computers and Industrial Engineering, CIE 2009

Conference

Conference	2009 International Conference on Computers and Industrial Engineering, CIE 2009
Country/Territory	France
City	Troyes
Period	6/07/09 → 9/07/09

Keywords

Polynomial algorithm
Robotic scheduling
Routing algorithm
Scheduling

Cite this

@inproceedings{11c5fab51e6745169af80de0af42a581,

title = "The howard-romanovskii routing algorithm revisited, with applications torobot scheduling",

abstract = "We consider the original routing algorithm invented by Romanovskii (1967)for solving a cyclic project scheduling problem and establish its closerelationship with the well-known routing algorithm by Dantzig, Blattner and Rao(1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can onlytreat fixed numerical data, we show that they both can be extended to solveproblems with interval-valued input data.",

keywords = "Polynomial algorithm, Robotic scheduling, Routing algorithm, Scheduling",

author = "Vladimir Kats and Eugene Levner",

year = "2009",

language = "אנגלית",

isbn = "9781424441365",

series = "2009 International Conference on Computers and Industrial Engineering, CIE 2009",

pages = "143--148",

booktitle = "2009 International Conference on Computers and Industrial Engineering, CIE 2009",

note = "2009 International Conference on Computers and Industrial Engineering, CIE 2009 ; Conference date: 06-07-2009 Through 09-07-2009",

}

Kats, V & Levner, E 2009, The howard-romanovskii routing algorithm revisited, with applications torobot scheduling. in 2009 International Conference on Computers and Industrial Engineering, CIE 2009., 5223785, 2009 International Conference on Computers and Industrial Engineering, CIE 2009, pp. 143-148, 2009 International Conference on Computers and Industrial Engineering, CIE 2009, Troyes, France, 6/07/09.

The howard-romanovskii routing algorithm revisited, with applications torobot scheduling. / Kats, Vladimir; Levner, Eugene.
2009 International Conference on Computers and Industrial Engineering, CIE 2009. 2009. p. 143-148 5223785 (2009 International Conference on Computers and Industrial Engineering, CIE 2009).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - The howard-romanovskii routing algorithm revisited, with applications torobot scheduling

AU - Kats, Vladimir

AU - Levner, Eugene

PY - 2009

Y1 - 2009

N2 - We consider the original routing algorithm invented by Romanovskii (1967)for solving a cyclic project scheduling problem and establish its closerelationship with the well-known routing algorithm by Dantzig, Blattner and Rao(1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can onlytreat fixed numerical data, we show that they both can be extended to solveproblems with interval-valued input data.

AB - We consider the original routing algorithm invented by Romanovskii (1967)for solving a cyclic project scheduling problem and establish its closerelationship with the well-known routing algorithm by Dantzig, Blattner and Rao(1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can onlytreat fixed numerical data, we show that they both can be extended to solveproblems with interval-valued input data.

KW - Polynomial algorithm

KW - Robotic scheduling

KW - Routing algorithm

KW - Scheduling

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

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:77956097822

SN - 9781424441365

T3 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

SP - 143

EP - 148

BT - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

T2 - 2009 International Conference on Computers and Industrial Engineering, CIE 2009

Y2 - 6 July 2009 through 9 July 2009

ER -

The howard-romanovskii routing algorithm revisited, with applications torobot scheduling

Abstract

Publication series

Conference

Keywords

Other files and links

Fingerprint

Cite this