The Efficiency of Computer Algorithms for Plant Layout

DOI10.1287/MNSC.18.5.240MaRDI QIDQ5666155zbMATH OpenOpenAlexFDO

Authors Larry P. Ritzman

Publication date 1972

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.18.5.240

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cited in

(9)

• A new simulated annealing algorithm for the facility layout problem
• Solution methods for the balancing of jet turbines
• Two graph-theoretic procedures for an improved solution to the facilities layout problem
• A hybrid heuristic for the facilities layout problem
• A parallel heuristic for quadratic assignment problems
• A heuristic method for the multi-story layout problem
• The facility layout problem
• Heuristics and their design: A survey
• An exact algorithm for the general quadratic assignment problem

This page was built for publication: The Efficiency of Computer Algorithms for Plant Layout

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