The Basic Cyclic Scheduling Model For Robotic Flow Shops

Abstract This paper analyzes the productivity of a robotic production cell, functioning under a repetitive robot move cycle. The cell is composed of m machines and one or several robot arms. Identical or different parts are entering the cell during a robot cycle. The problem of cycle time evaluation is shown to be an instance of the basic cyclic scheduling problem. Thus, several powerful results previously developed in the cyclic scheduling context are used to analyze our problem. We propose a O(q · m3) algorithm to compute the cycle time. The algorithm is first introduced for one-robot cells and then extended to multi-robot cells. A dynamic programming algorithm is used to find the optimal robot move cycle, that is, the cycle with minimum cycle time. Numerical results highlight the efficiency of cycle time evaluation methods and their potential practical utility in finding the optimal robot move cycle.

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

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

[3]  J. Desrosiers,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1998 .

[4]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

[5]  Henry L. W. Nuttle,et al.  Hoist Scheduling For A PCB Electroplating Facility , 1988 .

[6]  Yves Crama,et al.  Combinatorial optimization models for production scheduling in automated manufacturing systems , 1997 .

[7]  J. Quadrat,et al.  A linear-system-theoretic view of discrete-event processes , 1983, The 22nd IEEE Conference on Decision and Control.

[8]  Chelliah Sriskandarajah,et al.  Scheduling in robotic cells: Complexity and steady state analysis , 1998, Eur. J. Oper. Res..

[9]  Yves Crama,et al.  Cyclic scheduling in 3-machine robotic flow shops , 1999 .

[10]  John W. K. Leung,et al.  Determining the optimal move times for a given cyclic schedule of a material handling hoist , 1997 .

[11]  Stephen C. Graves,et al.  Scheduling of re-entrant flow shops , 1983 .

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

[13]  Zelda B. Zabinsky,et al.  An algorithm for scheduling a chemical processing tank line , 1993 .

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

[15]  Ronald D. Armstrong,et al.  A bounding scheme for deriving the minimal cycle time of a single-transporter N-stage process with time-window constraints , 1994 .

[16]  Vadim E. Levit,et al.  An improved algorithm for cyclic flowshop scheduling in a robotic cell , 1997 .

[17]  Chelliah Sriskandarajah,et al.  Scheduling in Robotic Cells: Classification, Two and Three Machine Cells , 1997, Oper. Res..

[18]  Andrew V. Goldberg,et al.  Negative-cycle detection algorithms , 1996, Math. Program..

[19]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[20]  Yves Crama,et al.  Cyclic Scheduling of Identical Parts in a Robotic Cell , 1997, Oper. Res..

[21]  Lei Lei,et al.  The minimum common-cycle algorithm for cyclic scheduling of two material handling hoists with time window constraints , 1991 .

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

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