Title :
The Howard-Romanovskii routing algorithm revisited, with applications to robot scheduling
Author :
Kats, Vladimir ; Levner, Eugene
Author_Institution :
Inst. for Ind. Math., Beer-Sheva, Israel
Abstract :
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.
Keywords :
industrial robots; manufacturing systems; scheduling; Howard-Romanovskii routing algorithm; automated production system; cyclic project scheduling problem; interval-valued input data; robot scheduling; Beverage industry; Distributed Bragg reflectors; Industrial relations; Job shop scheduling; Mathematics; Polynomials; Processor scheduling; Routing; Scheduling algorithm; Service robots; Scheduling; polynomial algorithm; robotic scheduling; routing algorithm;
Conference_Titel :
Computers & Industrial Engineering, 2009. CIE 2009. International Conference on
Conference_Location :
Troyes
Print_ISBN :
978-1-4244-4135-8
Electronic_ISBN :
978-1-4244-4136-5
DOI :
10.1109/ICCIE.2009.5223785
