Facilities design with graph theory and strings

James M Moore

Omega, 1976, vol. 4, issue 2, 193-203

Abstract: A facilities design algorithm is developed based upon such graph theory concepts as maximal spanning trees and planar graphs. The upper bound to the demands made by closeness ratings is developed from graph theory. The algorithm lends itself to computer solution minimizing the costs of flow between activities. An alternative approach using strings and the list processing capabilities of computers is suggested. Numerical examples are provided given input in the form of the relationship matrix and working through the block plan layout.

Date: 1976
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/0305-0483(76)90060-8
Full text for ScienceDirect subscribers only

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:eee:jomega:v:4:y:1976:i:2:p:193-203

Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/supportfaq.cws_home/regional
https://shop.elsevie ... _01_ooc_1&version=01

Access Statistics for this article

Omega is currently edited by B. Lev

More articles in Omega from Elsevier
Bibliographic data for series maintained by Catherine Liu ().