A Strategy for Solving the Plant Layout Problem
From MaRDI portal
Publication:4123105
DOI10.1057/jors.1976.174zbMath0352.90067OpenAlexW2009582911MaRDI QIDQ4123105
Publication date: 1976
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/jors.1976.174
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10)
Related Items (9)
The facility layout problem ⋮ Maximum planar subgraphs and nice embeddings: Practical layout tools ⋮ An algorithm for quadratic assignment problems ⋮ TESSA—A new greedy heuristic for facilities layout planning ⋮ An interactive layout heuristic based on hexagonal adjacency graphs ⋮ A genetic algorithm for facility layout ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ GRASP with Path-Relinking for Facility Layout ⋮ A continuous approach to considering uncertainty in facility design
This page was built for publication: A Strategy for Solving the Plant Layout Problem
