The Howard-Romanovskii routing algorithm revisited, with applications to robot scheduling
Vladimir Kats, Eugene Levner · 2009
We consider the original routing algorithm invented by Romanovskii (1967) for solving a cyclic project scheduling problem and establish its close relationship with the well-known routing algorithm by Dantzig, Blattner and Rao (1967). Though Romanovskii's and Dantzig-Blattner-Rao's algorithms can only treat fixed numerical data, we show that they both can be extended to solve problems with interval-valued input data.