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

Vladimir Kats, Eugene Levner

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publication2009 International Conference on Computers and Industrial Engineering, CIE 2009
Pages143-148
Number of pages6
StatePublished - 2009
Event2009 International Conference on Computers and Industrial Engineering, CIE 2009 - Troyes, France
Duration: 6 Jul 20099 Jul 2009

Publication series

Name2009 International Conference on Computers and Industrial Engineering, CIE 2009

Conference

Conference2009 International Conference on Computers and Industrial Engineering, CIE 2009
Country/TerritoryFrance
CityTroyes
Period6/07/099/07/09

Keywords

  • Polynomial algorithm
  • Robotic scheduling
  • Routing algorithm
  • Scheduling

Fingerprint

Dive into the research topics of 'The howard-romanovskii routing algorithm revisited, with applications torobot scheduling'. Together they form a unique fingerprint.

Cite this