A Heuristic Procedure for the Layout of a Large Number of Facilities

DOI10.1287/mnsc.33.7.907zbMath0625.90023OpenAlexW2048719814MaRDI QIDQ3028686

Zvi Drezner

Publication date: 1987

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.33.7.907

zbMATH Keywords

DISCONfacilities layout problem on the plane

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (21)

An ant algorithm for the single row layout problem in flexible manufacturing systems ⋮ Effects of scatter plot initial solutions on regular grid facility layout algorithms in typical production models ⋮ On the unboundedness of facility layout problems ⋮ An agent-based framework for modeling and solving location problems ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Two-level modified simulated annealing based approach for solving facility layout problem ⋮ A nonlinear optimization approach for solving facility layout problems ⋮ A distance assignment approach to the facility layout problem ⋮ Mapping the convergence of genetic algorithms ⋮ An interactive layout heuristic based on hexagonal adjacency graphs ⋮ Automatic computation and drawing of facility layouts with logical aisle structures ⋮ An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages ⋮ An efficient tabu algorithm for the single row facility layout problem ⋮ An efficient two-staged approach for generating block layouts ⋮ A new lower bound for the single row facility layout problem ⋮ Application of multidimensional scaling techniques to facilities layout ⋮ A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem ⋮ Integrated design of the block layout and aisle structure by simulated annealing ⋮ A framework for hierarchical interactive generation of cellular layout* ⋮ Efficient models for the facility layout problem ⋮ An improved genetic algorithm for facility layout problems having inner structure walls and passages

This page was built for publication: A Heuristic Procedure for the Layout of a Large Number of Facilities