An interactive layout heuristic based on hexagonal adjacency graphs

DOI10.1016/0377-2217(92)90033-6zbMath0825.90473OpenAlexW2062148030MaRDI QIDQ1205707

Goetschalckx, Marc

Publication date: 1 April 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90033-6

Mathematics Subject Classification ID

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

Related Items (14)

The zone-based dynamic facility layout problem ⋮ A new mixed integer programming formulation for facility layout design using flexible bays ⋮ Location and layout planning. A survey ⋮ A linear programming embedded probabilistic tabu search for the unequal-area facility layout problem with flexible bays ⋮ An improved genetic algorithm for multi-floor facility layout problems having inner structure walls and passages ⋮ Extensions to STaTS for practical applications of the facility layout problem ⋮ Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem ⋮ An integrated approach for the concurrent determination of the block layout and the input and output point locations based on the contour distance ⋮ Application of multidimensional scaling techniques to facilities layout ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments ⋮ Flexible machine layout design for dynamic and uncertain production environments ⋮ Facility layout objective functions and robust layouts ⋮ A hierarchical AHP/DEA methodology for the facilities layout design problem ⋮ An improved genetic algorithm for facility layout problems having inner structure walls and passages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The facility layout problem
• The Quadratic Assignment Problem
• A Heuristic Procedure for the Layout of a Large Number of Facilities
• Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
• Assignment Problems and the Location of Economic Activities
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• SHAPE: A construction algorithm for area placement evaluation
• DISCON: A New Method for the Layout Problem
• Efficient Planarity Testing
• P-Complete Approximation Problems
• A Strategy for Solving the Plant Layout Problem
• The Complexity of Flowshop and Jobshop Scheduling

This page was built for publication: An interactive layout heuristic based on hexagonal adjacency graphs