Exact solution procedures for the balanced unidirectional cyclic layout problem

In this paper, we consider the balanced unidirectional cyclic layout problem (BUCLP) arising in the determination of workstation locations around a closed loop conveyor system, in the allocation of cutting tools on the sites around a turret, in the positioning of stations around a unidirectional single loop AGV path. BUCLP is known to be NP-Complete. One important property of this problem is the balanced material flow assumption where the material flow is conserved at every workstation. We first develop a branch-and-bound procedure by using the special material flow property of the problem. Then, we propose a dynamic programming algorithm, which provides optimum solutions for instances with up to 20 workstations due to memory limitations. The branch and bound procedure can solve problems with up to 50 workstations.

[1]  Panagiotis Kouvelis,et al.  Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems , 1992, Oper. Res..

[2]  Chris N. Potts,et al.  Workload balancing and loop layout in the design of a flexible manufacturing system , 2001, Eur. J. Oper. Res..

[3]  Chris N. Potts,et al.  Local search algorithms for the min-max loop layout problem , 2002, J. Oper. Res. Soc..

[4]  Lawrence Hubert,et al.  Combinatorial Data Analysis , 2001 .

[5]  Dennis E. Blumenfeld,et al.  Performance comparison of assembly systems with fixed and flexible cycle times , 1989 .

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[7]  Selcuk Karabati,et al.  Exact and approximate algorithms for the loop layout problem , 1993 .

[8]  Ali Tamer Unal,et al.  A location problem on unicyclic networks: Balanced case , 1992 .

[9]  Maurice Queyranne,et al.  On the One-Dimensional Space Allocation Problem , 1981, Oper. Res..

[10]  T. S. Abdul-Razaq,et al.  Dynamic Programming State-Space Relaxation for Single-Machine Scheduling , 1988 .

[11]  Panos Afentakis,et al.  A loop layout design problem for flexible manufacturing systems , 1989 .

[12]  J. Carlier,et al.  Two branch and bound algorithms for the permutation flow shop problem , 1996 .

[13]  Yavuz A. Bozer,et al.  Exact solution procedures for the circular layout problem , 1989 .

[14]  Gerhard Reinelt,et al.  The linear ordering problem: algorithms and applications , 1985 .

[15]  Shine-Der Lee,et al.  Configuring layout in unidirectional loop manufacturing systems , 2001 .

[16]  P. Banerjee,et al.  Facilities layout design optimization with single loop material flow path configuration , 1995 .

[17]  Barbaros Ç. Tansel,et al.  Move based heuristics for the unidirectional loop network layout problem , 1998, Eur. J. Oper. Res..

[18]  M. Held,et al.  Finite-State Processes and Dynamic Programming , 1967 .

[19]  C. Potts.  A Lagrangean Based Branch and Bound Algorithm for Single Machine Sequencing with Precedence Constraints to Minimize Total Weighted Completion Time , 1985 .

[20]  Leon F. McGinnis,et al.  Facility Layout and Location: An Analytical Approach , 1991 .

[21]  P. McMullen.  THE LINEAR ORDERING PROBLEM: ALGORITHMS AND APPLICATIONS (Research and Exposition in Mathematics 8) , 1987 .

[22]  P Kouvelis,et al.  A survey of layout issues in flexible manufacturing systems , 1992 .

[23]  Mark H. Houck.  Optimization by Dynamic Programming , 1981 .

[24]  İ. K. Altinel *,et al.  Design of unidirectional cyclic layouts , 2005 .

[25]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[26]  Gang Yu,et al.  Optimal algorithms for row layout problems in automated manufacturing systems , 1995 .