Advanced Search
MyIDEAS: Login to save this article or follow this journal

Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent

Contents:

Author Info

  • L. R. Foulds

    (University of Florida)

Registered author(s):

    Abstract

    This paper surveys work done to date on the problem of laying out the facilities of some system in terms of specifying which activities are to be adjacent. Each pair of facilities has a closeness rating which represents the desirability that they are located adjacently. Ratings are usually proportional to the flow of goods or people between facilities. The aim of the layout analyst is to design a system so that the sum of the ratings of adjacent pairs is maximized as this represents travel saved. This paper formulates the layout problem and reviews exact and heuristic methods of solution. In the literature review special emphasis is placed on the newly-emerging graph-theoretic techniques which appear promising.

    Download Info

    If 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.
    File URL: http://dx.doi.org/10.1287/mnsc.29.12.1414
    Download Restriction: no

    Bibliographic Info

    Article provided by INFORMS in its journal Management Science.

    Volume (Year): 29 (1983)
    Issue (Month): 12 (December)
    Pages: 1414-1426

    as in new window
    Handle: RePEc:inm:ormnsc:v:29:y:1983:i:12:p:1414-1426

    Contact details of provider:
    Postal: 7240 Parkway Drive, Suite 300, Hanover, MD 21076 USA
    Phone: +1-443-757-3500
    Fax: 443-757-3515
    Email:
    Web page: http://www.informs.org/
    More information through EDIRC

    Related research

    Keywords: facilities/equipment planning: layout; networks/graphs: applications; programming: quadratic;

    References

    No references listed on IDEAS
    You can help add them by filling out this form.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    2. Helber, Stefan & Böhme, Daniel & Oucherif, Farid & Lagershausen, Svenja & Kasper, Steffen, 2014. "A hierarchical facility layout planning approach for large and complex hospitals," Hannover Economic Papers (HEP) dp-527, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    3. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    4. Hossein Safizadeh, M. & McKenna, David R., 1996. "Application of multidimensional scaling techniques to facilities layout," European Journal of Operational Research, Elsevier, vol. 92(1), pages 54-62, July.
    5. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:29:y:1983:i:12:p:1414-1426. See general 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: (Mirko Janc).

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.