A Strategy for Solving the Plant Layout Problem
From MaRDI portal
Publication:4123105
DOI10.1057/jors.1976.174zbMath0352.90067MaRDI 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
90C35: Programming involving graphs or networks
05C35: Extremal problems in graph theory
90C10: Integer programming
Related Items
A genetic algorithm for facility layout, The facility layout problem, An algorithm for quadratic assignment problems, An interactive layout heuristic based on hexagonal adjacency graphs, 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 continuous approach to considering uncertainty in facility design, TESSA—A new greedy heuristic for facilities layout planning