Facilities design with graph theory and strings
AbstractA 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.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic InfoArticle provided by Elsevier in its journal Omega.
Volume (Year): 4 (1976)
Issue (Month): 2 ()
Contact details of provider:
Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description
You can help add them by filling out this form.
reading list or among the top items on IDEAS.Access and download statisticsgeneral information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.