Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’

DOI10.1080/00207549408956927zbMath1041.90510OpenAlexW2036499170MaRDI QIDQ4394195

Mohsen M. D. Hassan

Publication date: 27 June 1999

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207549408956927

zbMATH Keywords

graph theorygreedy heuristicfacilities layout planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Production models (90B30)

Cites Work

• Facilities layout generalized model solved by n-boundary shortest path heuristics
• TESSA—A new greedy heuristic for facilities layout planning

This page was built for publication: Discussion A note on ‘Similarity of a new greedy heuristic for facility layout by graph theory to an existing approach’