A Strategy for Solving the Plant Layout Problem

DOI10.1057/JORS.1976.174MaRDI QIDQ4123105zbMATH OpenOpenAlexFDO

Authors Les R. Foulds, David Robinson

Publication date 1976

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1976.174

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(9)

• 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
• GRASP with path-relinking for facility layout
• TESSA—A new greedy heuristic for facilities layout planning
• A genetic algorithm for facility layout

This page was built for publication: A Strategy for Solving the Plant Layout Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4123105)