IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v53y2015i11p3462-3474.html
   My bibliography  Save this article

An optimal approach for maximizing the number of adjacencies in multi floor layout problem

Author

Listed:
  • Hossein Neghabi
  • Farhad Ghassemi Tari

Abstract

Multi-floor facility layout problem concerns the arrangement of departments on the different floors. In this paper, a new mathematical model is proposed for multi-floor layout with unequal department area. Maximising the number of useful adjacencies among departments is considered as the objective function. The adjacencies are divided into two major categories: horizontal and vertical adjacencies. The horizontal adjacency may be occurred between the departments assigned to same floors while the vertical can be happened between departments assigned to any consecutive floors. A minimum common boundary length (surface area) between any two horizontal (vertical) adjacent departments is specified. The efficiency of the model is demonstrated by six illustrative examples. The proposed model is practical in multi-floor plant where the existence of adjacencies between departments is useful or essential due to possible establishment of conveyor, transferring pipes, lift truck route, etc.

Suggested Citation

  • Hossein Neghabi & Farhad Ghassemi Tari, 2015. "An optimal approach for maximizing the number of adjacencies in multi floor layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 53(11), pages 3462-3474, June.
    • Handle: RePEc:taf:tprsxx:v:53:y:2015:i:11:p:3462-3474
    DOI: 10.1080/00207543.2014.999957
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2014.999957
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2014.999957?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tprsxx:v:53:y:2015:i:11:p:3462-3474. See general information about how to correct material in RePEc.

    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.

    We have no bibliographic references for this item. You can help adding them by using 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.