A New Graph-Theoretic Heuristic for Facility Layout
From MaRDI portal
Publication:4012771
DOI10.1287/MNSC.38.4.594zbMATH Open0773.90034OpenAlexW1967087646MaRDI QIDQ4012771FDOQ4012771
Authors: Janny Leung 
Publication date: 27 September 1992
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.38.4.594
Recommendations
Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30)
Cited In (16)
- Facilities layout generalized model solved by n-boundary shortest path heuristics
- Title not available (Why is that?)
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- Local Search Algorithms for the Maximal Planar Layout Problem
- Machine layout problem in modern manufacturing facilities
- FACOPT: A user friendly FACility layout OPTimization system.
- Linear programming based meta-heuristics for the weighted maximal planar graph
- Maximum planar subgraphs and nice embeddings: Practical layout tools
- Enumerating grid layouts of graphs
- Title not available (Why is that?)
- Location and layout planning. A survey
- A genetic algorithm and queuing theory based methodology for facilities layout problem
- The facility layout problem
- A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
- Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
- Two new heuristic algorithms for the maximal planar layout problem
Uses Software
This page was built for publication: A New Graph-Theoretic Heuristic for Facility Layout
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012771)
