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

DOI10.1016/0307-904X(95)00124-3zbMath0865.90106OpenAlexW2055423535WikidataQ126666733 ScholiaQ126666733MaRDI QIDQ5961820

Yavuz A. Bozer, Suk-Chul Rim

Publication date: 24 April 1997

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0307-904x(95)00124-3

zbMATH Keywords

manufacturing systemsquadratic assignment problembidirectional circular layout problemdiscrete layoutfacility layoutgeneralized linear ordering problem

Mathematics Subject Classification ID

Production models (90B30) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (7)

A survey for the quadratic assignment problem ⋮ Reconfigurable layout problem ⋮ Designing an efficient method for simultaneously determining the loop and the location of the P/D stations using genetic algorithm ⋮ A branch and bound method for solving the bidirectional circular layout problem ⋮ Analysis of automated guided vehicle configurations in flexible manufacturing systems ⋮ A mathematical model and algorithms for the aircraft hangar maintenance scheduling problem ⋮ Survey of research in the design and control of automated guided vehicle systems

Cites Work

• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• A location problem on unicyclic networks: Balanced case
• Some simplified NP-complete graph problems
• On the One-Dimensional Space Allocation Problem
• On the Use of Exact and Heuristic Cutting Plane Methods for the Quadratic Assignment Problem
• Optimal Linear Ordering
• Tree-search algorithms for quadratic assignment problems
• A branch and bound method for solving the bidirectional circular layout problem

This page was built for publication: A branch and bound method for solving the bidirectional circular layout problem