Facilities layout generalized model solved by n-boundary shortest path heuristics

DOI10.1016/S0377-2217(87)80181-9zbMath0614.90029OpenAlexW2003065298MaRDI QIDQ1820668

J. W. Giffin, Les R. Foulds

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/s0377-2217(87)80181-9

zbMATH Keywords

facility locationcomputational resultsadjacency graphplant layout

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Graph theory (05C99)

Related Items (3)

Location and layout planning. A survey ⋮ A heuristic procedure for the single-row facility layout problem ⋮ Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel concepts in graph theory
• Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
• A Note on the Generation of Random Normal Deviates
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• Gauss codes, planar hamiltonian graphs, and stack-sortable permutations
• A Depth-First-Search Characterization of Planarity
• Graph Property Update Algorithms and Their Appligation to Distance Matrices
• Efficient Planarity Testing
• Approximative Algorithms for Discrete Optimization Problems
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• A Theorem on Boolean Matrices

This page was built for publication: Facilities layout generalized model solved by n-boundary shortest path heuristics