Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

A Strategy for Solving the Plant Layout Problem

L. R. Foulds and D. F. Robinson
Operational Research Quarterly (1970-1977)
Vol. 27, No. 4, Part 1 (1976), pp. 845-855
DOI: 10.2307/3009168
Stable URL: http://www.jstor.org/stable/3009168
Page Count: 11
  • Subscribe ($19.50)
  • Cite this Item
A Strategy for Solving the Plant Layout Problem
Preview not available

Abstract

We consider the problem of laying out the facilities of which a plant is composed, in terms of specifying which facilities are to be adjacent. For each pair of facilities a benefit from siting them adjacent to each other is known. We seek to maximise the sum of benefits over all pairs of adjacent facilities. The problem is stated in terms of graph theory, and provision is made for some edges to be considered necessary and others forbidden, where each edge represents an adjacency. We describe a branch and bound algorithm for finding an optimal layout and a sequence of tests for determining whether or not the graphs constructed in the course of the algorithm are planar.

Page Thumbnails

  • Thumbnail: Page 
845
    845
  • Thumbnail: Page 
846
    846
  • Thumbnail: Page 
847
    847
  • Thumbnail: Page 
848
    848
  • Thumbnail: Page 
849
    849
  • Thumbnail: Page 
850
    850
  • Thumbnail: Page 
851
    851
  • Thumbnail: Page 
852
    852
  • Thumbnail: Page 
853
    853
  • Thumbnail: Page 
854
    854
  • Thumbnail: Page 
855
    855