A branch and bound algorithm for locating input and output points of departments on the block layout

DOI10.1057/PALGRAVE.JORS.2600720zbMATH Open1054.90589OpenAlexW1990279009MaRDI QIDQ3157355FDOQ3157355

Yeong-Dae Kim, Jae-Gon Kim

Publication date: 13 January 2005

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600720

Recommendations

• An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
• Layout planning for facilities with fixed shapes and input and output points
• A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
• An efficient algorithm for unequal area facilities layout planning with input and output points
• Supply facility and input/output point locations in the presence of barriers

zbMATH Keywords

branch and bound algorithmfacility layoutinput and output points

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85)

Cited In (5)

• A convex optimisation framework for the unequal-areas facility layout problem
• An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance
• Integrated slicing tree approach for solving the facility layout problem with input and output locations based on contour distance
• A three-phase heuristic algorithm for fixed-charge capacitated material flow network design with input/output points location
• Optimal facility layout and material handling network design

This page was built for publication: A branch and bound algorithm for locating input and output points of departments on the block layout

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