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

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.

[1]  François Soumis,et al.  Schedule efficiency in a robotic production cell , 1995 .

[2]  James B. Orlin,et al.  Finding minimum cost to time ratio cycles with small integral transit times , 1993, Networks.

[3]  Yves Robert,et al.  Introduction to Scheduling , 2009, CRC computational science series.

[4]  Claire Hanen,et al.  Periodic schedules for linear precedence constraints , 2009, Discret. Appl. Math..

[5]  G. Dantzig,et al.  FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[6]  Lei Lei.  Determining the optimal starting times in a cyclic schedule with a given route , 1993, Comput. Oper. Res..

[7]  Thomas Kampmeyer,et al.  Cyclic Scheduling Problems , 2006 .

[8]  Vladimir Kats,et al.  The Howard-Romanovskii routing algorithm revisited, with applications to robot scheduling , 2009, 2009 International Conference on Computers & Industrial Engineering.

[9]  Feng Chu,et al.  Multicyclic hoist scheduling with constant processing times , 2002, IEEE Trans. Robotics Autom..

[10]  Robin Roundy.  Cyclic Schedules for Job Shops with Identical Jobs , 1992, Math. Oper. Res..

[11]  Chengbin Chu,et al.  Multi-degree cyclic scheduling of a no-wait robotic cell with multiple robots , 2009, Eur. J. Oper. Res..

[12]  I. V. Romanovskil.  Optimization of stationary control of a discrete deterministic process , 1967 .

[13]  Eugene Levner,et al.  A network flow algorithm for just-in-time project scheduling , 1994 .

[14]  Chengbin Chu,et al.  Cyclic scheduling of a hoist with time window constraints , 1998, IEEE Trans. Robotics Autom..

[15]  Philippe Chrétienne.  The basic cyclic scheduling problem with deadlines , 1991, Discret. Appl. Math..

[16]  Eugene Levner,et al.  Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints , 2008, Eur. J. Oper. Res..

[17]  J. Quadrat,et al.  Numerical Computation of Spectral Elements in Max-Plus Algebra☆ , 1998 .

[18]  Eric Sanlaville,et al.  The Basic Cyclic Scheduling Model For Robotic Flow Shops , 2001 .

[19]  Richard M. Karp,et al.  A characterization of the minimum cycle mean in a digraph , 1978, Discret. Math..

[20]  Didier Dubois,et al.  A linear-system-theoretic view of discrete-event processes , 1983 .

[21]  Chengbin Chu,et al.  A polynomial algorithm for 2-degree cyclic robot scheduling , 2003, Eur. J. Oper. Res..

[22]  Rajesh K. Gupta,et al.  Faster maximum and minimum mean cycle algorithms for system-performance analysis , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[23]  Nimrod Megiddo.  Combinatorial Optimization with Rational Objective Functions , 1979, Math. Oper. Res..

[24]  Richard M. Karp,et al.  Parametric shortest path algorithms with an application to cyclic staffing , 1981, Discret. Appl. Math..

[25]  Robert E. Tarjan,et al.  Faster parametric shortest path and minimum-balance algorithms , 1991, Networks.

[26]  Alix Munier Kordon.  A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule , 2011 .

[27]  J. van de Klundert.  Scheduling problems in automated manufacturing , 1996 .

[28]  TAE-EOG LEE,et al.  Performance Measures and Schedules in Periodic Job Shops , 1997, Oper. Res..

[29]  Chengbin Chu,et al.  Multi-degree cyclic scheduling of two robots in a no-wait flowshop , 2005, IEEE Transactions on Automation Science and Engineering.

[30]  Danjing Li,et al.  A hierarchical control structure for a class of timed discrete event systems , 2008 .

[31]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[32]  Eugene Levner,et al.  A Parametric Critical Path Problem and an Application for Cyclic Scheduling , 1998, Discret. Appl. Math..