A branch and bound method for solving the bidirectional circular layout problem
Authors:
- Yavuz A. BozerYBYavuz A. Bozer
- 1 May 1996
- journal article
- Published by Elsevier in Applied Mathematical Modelling
- Vol. 20 (5) , 342-351
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Tandem AGV systems: A partitioning algorithm and performance comparison with conventional AGV systemsEuropean Journal of Operational Research, 1992
- OSL—optimal single-loop guide paths for AGVSInternational Journal of Production Research, 1992
- Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle LoopsIIE Transactions, 1991
- Decentralized Control of Automated Guided Vehicles on a Simple LoopIIE Transactions, 1989
- Machine Layout Problem in Flexible Manufacturing SystemsOperations Research, 1988
- On the One-Dimensional Space Allocation ProblemOperations Research, 1981
- Assignment and Matching Problems: Solution Methods with FORTRAN-Programs1980
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- Optimal Linear OrderingSIAM Journal on Applied Mathematics, 1973
- Tree-search algorithms for quadratic assignment problemsNaval Research Logistics Quarterly, 1971