An Efficient Equipment-Layout Algorithm
From MaRDI portal
Publication:4767136
DOI10.1287/OPRE.22.3.622zbMATH Open0279.90043OpenAlexW2170015994MaRDI QIDQ4767136FDOQ4767136
Publication date: 1974
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.22.3.622
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Mathematical programming (90C99)
Cited In (10)
- Flexibility in manufacturing system design: a review of recent approaches from operations research
- A polyhedral study of triplet formulation for single row facility layout problem
- A new lower bound for the single row facility layout problem
- The facility layout problem
- Single and multiple period layout models for automated manufacturing systems
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- A heuristic procedure for the single-row facility layout problem
- An efficient tabu algorithm for the single row facility layout problem
- A heuristic procedure for solving the quadratic assignment problem
- On the exact solution of a facility layout problem
This page was built for publication: An Efficient Equipment-Layout Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767136)