IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v50y1999i5d10.1057_palgrave.jors.2600720.html
   My bibliography  Save this article

A branch and bound algorithm for locating input and output points of departments on the block layout

Author

Listed:
  • J-G Kim

    (Korea Advanced Institute of Science and Technology)

  • Y-D Kim

    (Korea Advanced Institute of Science and Technology)

Abstract

We consider the problem of locating input and output (I/O) points of each department for a given layout. The objective of the problem is to minimise the total distance of material flows between the I/O points. Here, distances between the I/O points are computed as the lengths of the shortest path (not the rectilinear distances) between the I/O points. We developed a procedure to eliminate dominated candidate positions of I/O points that do not need to be considered. With this procedure, a large number of dominated candidate positions can be eliminated. A linear programming (LP) model for minimising the total rectilinear distance of flows is used to obtain a lower bound. Using the elimination procedure and the LP model, a branch and bound algorithm is developed to find an optimal location of the I/O points. Results from computational experiments show that the suggested algorithm finds optimal solutions in a very short time even for large-sized problems.

Suggested Citation

  • J-G Kim & Y-D Kim, 1999. "A branch and bound algorithm for locating input and output points of departments on the block layout," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 50(5), pages 517-525, May.
    • Handle: RePEc:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600720
    DOI: 10.1057/palgrave.jors.2600720
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2600720
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2600720?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. Jankovits, Ibolya & Luo, Chaomin & Anjos, Miguel F. & Vannelli, Anthony, 2011. "A convex optimisation framework for the unequal-areas facility layout problem," European Journal of Operational Research, Elsevier, vol. 214(2), pages 199-215, October.
    2. Ghorashi Khalilabadi, S. M. & Roy, D. & de Koster, M.B.M., 2022. "A Data-driven Approach to Enhance Worker Productivity by Optimizing Facility Layout," ERIM Report Series Research in Management ERS-2022-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    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:pal:jorsoc:v:50:y:1999:i:5:d:10.1057_palgrave.jors.2600720. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.