A branch and bound method for solving the bidirectional circular layout problem

[1]  D. Adolphson.  Optimal linear-ordering. , 1973 .

[2]  H. Kunzi,et al.  Lectu re Notes in Economics and Mathematical Systems , 1975 .

[3]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[4]  Hanif Dostmahomed Sherali.  The quadratic assignment problem :exact and heuristic methods , 1979 .

[5]  R. Burkard,et al.  Assignment and Matching Problems: Solution Methods with FORTRAN-Programs , 1980 .

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

[7]  Andrew Kusiak,et al.  Machine Layout Problem in Flexible Manufacturing Systems , 1988, Oper. Res..

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

[9]  John J. Bartholdi,et al.  Decentralized Control of Automated Guided Vehicles on a Simple Loop , 1989 .

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

[11]  Panos M. Pardalos,et al.  A parallel algorithm for the quadratic assignment problem , 1989, Proceedings of the 1989 ACM/IEEE Conference on Supercomputing (Supercomputing '89).

[12]  Yavuz A. Bozer,et al.  Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle Loops , 1991 .

[13]  David Sinriech,et al.  OSL—optimal single-loop guide paths for AGVS , 1992 .

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

[15]  Yavuz A. Bozer,et al.  Tandem AGV systems: A partitioning algorithm and performance comparison with conventional AGV systems , 1992 .