Design of a manufacturing facility layout with a closed loop conveyor with shortcuts using queueing theory and genetic algorithms

Most current manufacturing facility layout problem solution methods aim at minimizing the total distance traveled, the material handling cost, and/or the time spent in the system (based on distance traveled at a specific speed). The methodology proposed in this paper solves the looped layout design problem for a looped layout manufacturing facility with a looped conveyor material handling system with shortcuts by using the operational performance metric, i.e. the work-in-process on the conveyor in a manufacturing facility, as the design criterion.

[1]  Genaro J. Gutierrez,et al.  Algorithms for robust single and multiple period layout planning for manufacturing systems , 1992 .

[2]  Andrew Kusiak,et al.  The facility layout problem , 1987 .

[3]  Andrew L. Johnson,et al.  A greedy heuristic for locating crossovers in conveyor-based AMHS in wafer fabs , 2009, Proceedings of the 2009 Winter Simulation Conference (WSC).

[4]  Michael C. Fu,et al.  Minimizing work-in-process and material handling in the facilities layout problem , 1997 .

[5]  F. Hillier,et al.  Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities , 1966 .

[6]  Dexian Huang,et al.  An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers , 2009 .

[7]  Saifallah Benjaafar,et al.  Modeling and Analysis of Congestion in the Design of Facility Layouts , 2002, Manag. Sci..

[8]  J. A. Buzacott,et al.  On the approximations to the single server queue , 1980 .

[9]  Andrew L. Johnson,et al.  Optimising the location of crossovers in conveyor-based automated material handling systems in semiconductor wafer fabs , 2011 .

[10]  Shahrukh A. Irani,et al.  Next Generation Factory Layouts: Research Challenges and Recent Progress , 2002, Interfaces.

[11]  Sev V. Nagalingam,et al.  A genetic algorithm and queuing theory based methodology for facilities layout problem , 2009 .

[12]  Wolfgang Kraemer,et al.  Approximate Formulae for the Delay in the Queueing System GI/G/ 1 , 1976 .

[13]  Andreas C. Nearchou,et al.  Meta-heuristics from nature for the loop layout design problem , 2006 .

[14]  W. Whitt,et al.  The Queueing Network Analyzer , 1983, The Bell System Technical Journal.

[15]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .

[16]  Y. A. Bozer,et al.  Throughput performance analysis and machine layout for discrete-space closed-loop conveyors , 2005 .

[17]  Yavuz A. Bozer,et al.  Expected waiting times at loading stations in discrete-space closed-loop conveyors , 2004, Eur. J. Oper. Res..