The use of flowlines to simplify routing complexity in two-stage flowshops

Flexible manufacturing systems are often designed as flowshops supported by automated material handling devices that facilitate routing among any two processors of adjacent stages. This routing structure is complex, and results in excessive capital investment and costs of management. In this paper we propose a decomposition of two-stage flowshops into smaller independent flowlines that allow for unidirectional routing only. We solve optimally the problem of minimizing makespan on two parallel flowlines, by means of a Dynamic Programming algorithm (DP). Based on DP we develop lower bounds on the throughput performance of environments that consist of more than two flowlines. We present several heuristic algorithms and report their optimality gaps. Using these algorithms, we show that the decomposition of two stage flowshops with complicated routing into flowline-like designs with unidirectional routing is associated with minor losses in throughput performance, and hence significant savings in material handling costs.

[1]  George L. Vairaktarakis,et al.  Flowshops with processing flexibility across production stages , 1998 .

[2]  George L. Vairaktarakis,et al.  Minimizing makespan in hybrid flowshops , 1994, Oper. Res. Lett..

[3]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[4]  Linda Hendry.  Flexible Manufacturing Systems – The Technology and Management , 1993 .

[5]  Kripa Shanker,et al.  A loading and dispatching problem in a random flexible manufacturing system , 1985 .

[6]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[7]  Chris N. Potts,et al.  Scheduling a two-stage hybrid flow shop with parallel machines at the first stage , 1997, Ann. Oper. Res..

[8]  Kathryn E. Stecke,et al.  Design, planning, scheduling, and control problems of flexible manufacturing systems , 1985 .

[9]  Marius M. Solomon,et al.  A computational study of heuristics for two-stage flexible flowshops , 1996 .

[10]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[11]  J. Erschler,et al.  Steady state scheduling of a flexible manufacturing system with periodic releasing and flow time constraints , 1985 .

[12]  George L. Vairaktarakis,et al.  Performance Comparison of Some Classes of Flexible Flow Shops and Job Shops , 1998 .

[13]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[14]  Cheryl Gaimon,et al.  Routing flexibility and production scheduling in a flexible manufacturing system , 1992 .

[15]  A. Kusiak,et al.  A scheduling problem in glass manufacturing , 1996 .

[16]  Kathryn E. Stecke,et al.  Planning and scheduling approaches to operate a particular FMS , 1992 .

[17]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[18]  Jacek Blazewicz,et al.  Scheduling in Computer and Manufacturing Systems , 1990 .

[19]  T.C.E. Cheng,et al.  A state-of-the-art review of parallel-machine scheduling research , 1990 .