A New Graph-Theoretic Heuristic for Facility Layout
From MaRDI portal
Publication:4012771
Recommendations
Cited in
(16)- Facilities layout generalized model solved by n-boundary shortest path heuristics
- A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
- scientific article; zbMATH DE number 4008427 (Why is no real title available?)
- FACOPT: A user friendly FACility layout OPTimization system.
- Local Search Algorithms for the Maximal Planar Layout Problem
- Machine layout problem in modern manufacturing facilities
- 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
- Location and layout planning. A survey
- scientific article; zbMATH DE number 844203 (Why is no real title available?)
- 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
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)