A New Graph-Theoretic Heuristic for Facility Layout

Janny Leung
Additional contact information
Janny Leung: Decision Sciences Group/MIS Department, College of Business and Public Administration, University of Arizona, Tucson, Arizona 85721

Management Science, 1992, vol. 38, issue 4, 594-605

Abstract: The facility layout problem is important in the modern manufacturing environment because increased machine flexibility and product diversification create additional complexities in scheduling and material handling. An important first step in facility layout is the determination of which machines should be adjacent. This problem can be modelled as that of finding a maximum weight planar subgraph of a graph, given a measure of the desirability that two machines be adjacent based on the anticipated flows and technological constraints. We present a new heuristic that is a generalization of previous work of Foulds and Robinson. Preliminary computational results are presented which suggest that this heuristic performs well.

Keywords: facility layout; graph-theoretic heuristic; planar graphs; adjacency (search for similar items in EconPapers)
Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.38.4.594 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:38:y:1992:i:4:p:594-605

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().