A New Graph-Theoretic Heuristic for Facility Layout

DOI10.1287/MNSC.38.4.594MaRDI QIDQ4012771zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

adjacencyfacility layoutheuristicmaximum weight planar subgraph

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Production models (90B30) Programming involving graphs or networks (90C35)

Recommendations

• Efficient facility layout planning in a maximally planar graph model
• scientific article; zbMATH DE number 568799
• A new approach to the block layout problem
• The facility layout problem
• Two new heuristic algorithms for the maximal planar layout problem

Cited in

(23)

• The facility layout problem
• On finding a biconnected spanning planar subgraph with applications to the facilities layout problem
• Comment on ``The facility layout problem
• Location and layout planning. A survey
• Two new heuristic algorithms for the maximal planar layout problem
• FACOPT: A user friendly FACility layout OPTimization system.
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• Maximum planar subgraphs and nice embeddings: Practical layout tools
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem
• A connectivity graph generation approach for Manhattan path calculation in detailed facility layout
• A genetic algorithm and queuing theory based methodology for facilities layout problem
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• scientific article; zbMATH DE number 4008427 (Why is no real title available?)
• scientific article; zbMATH DE number 1206315 (Why is no real title available?)
• A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
• The Vertex Splitting Algorithm for facilities layout
• Efficient facility layout planning in a maximally planar graph model
• scientific article; zbMATH DE number 568799 (Why is no real title available?)
• Machine layout problem in modern manufacturing facilities
• Linear programming based meta-heuristics for the weighted maximal planar graph
• scientific article; zbMATH DE number 844203 (Why is no real title available?)
• Enumerating grid layouts of graphs
• Local Search Algorithms for the Maximal Planar Layout Problem

Describes a project that uses

Uses Software

• Microlay

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)