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

DOI10.1016/0307-904X(95)00124-3MaRDI QIDQ5961820zbMATH OpenOpenAlexWikidataFDO

Authors 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

quadratic assignment problemfacility layoutmanufacturing systemsbidirectional circular layout problemdiscrete layoutgeneralized linear ordering problem

Mathematics Subject Classification ID

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

Recommendations

• Exact solution procedures for the balanced unidirectional cyclic layout problem
• Design of unidirectional cyclic layouts
• Move based heuristics for the unidirectional loop network layout problem
• Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems
• Configuring layout in unidirectional loop manufacturing systems

Cites work

• A branch and bound method for solving the bidirectional circular layout problem
• A location problem on unicyclic networks: Balanced case
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• 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
• Some simplified NP-complete graph problems
• Tree-search algorithms for quadratic assignment problems

Cited in

(9)

• Analysis of automated guided vehicle configurations in flexible manufacturing systems
• A mathematical model and algorithms for the aircraft hangar maintenance scheduling 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
• A survey for the quadratic assignment problem
• Design of unidirectional cyclic layouts
• Exact solution procedures for the balanced unidirectional cyclic layout problem
• Survey of research in the design and control of automated guided vehicle systems
• Reconfigurable layout problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961820)