IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v40y1992i3p533-550.html
   My bibliography  Save this article

Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems

Author

Listed:
  • Panagiotis Kouvelis

    (Duke University, Durham, North Carolina)

  • Michael W. Kim

    (University of California, Riverside, California)

Abstract

In this paper, we address the design of unidirectional loop network layouts for automated manufacturing environments. We show that the problem is NP-complete. Using a workstation interchange argument, we develop dominance relationships for easy identification of local optimal solutions. Our results suggest the need for simple heuristics to solve the problem. We identify cases in which the heuristics perform optimally, and we analyze the worst case behavior of the heuristics. We develop an optimal branch-and-bound procedure that is computationally efficient for medium-sized problems. We also present a decomposition principle helpful for dealing with large workflow matrices. We report computational results on the heuristics and the branch-and-bound procedure. We show that one of the heuristics performs impressively well in terms of solution quality and computational time requirements.

Suggested Citation

  • Panagiotis Kouvelis & Michael W. Kim, 1992. "Unidirectional Loop Network Layout Problem in Automated Manufacturing Systems," Operations Research, INFORMS, vol. 40(3), pages 533-550, June.
    • Handle: RePEc:inm:oropre:v:40:y:1992:i:3:p:533-550
    DOI: 10.1287/opre.40.3.533
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.40.3.533
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.40.3.533?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
    ---><---

    Citations

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


    Cited by:

    1. Gintaras Palubeckis, 2020. "An Approach Integrating Simulated Annealing and Variable Neighborhood Search for the Bidirectional Loop Layout Problem," Mathematics, MDPI, vol. 9(1), pages 1-30, December.
    2. Kim, Kap Hwan, 1995. "Positioning of automated guided vehicles in a loop layout to minimize the mean vehicle response time," International Journal of Production Economics, Elsevier, vol. 39(3), pages 201-214, May.
    3. Tansel, Barbaros C. & Bilen, Canan, 1998. "Move based heuristics for the unidirectional loop network layout problem," European Journal of Operational Research, Elsevier, vol. 108(1), pages 36-48, July.
    4. Öncan, Temel & AltInel, I. Kuban, 2008. "Exact solution procedures for the balanced unidirectional cyclic layout problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 609-623, September.
    5. Mariem Besbes & Marc Zolghadri & Roberta Costa Affonso & Faouzi Masmoudi & Mohamed Haddar, 2020. "A methodology for solving facility layout problem considering barriers: genetic algorithm coupled with A* search," Journal of Intelligent Manufacturing, Springer, vol. 31(3), pages 615-640, March.
    6. Potts, C. N. & Whitehead, J. D., 2001. "Workload balancing and loop layout in the design of a flexible manufacturing system," European Journal of Operational Research, Elsevier, vol. 129(2), pages 326-336, March.
    7. Lee, Shine-Der & Chiang, Chih-Ping, 2002. "Cell formations in the uni-directional loop material handling environment," European Journal of Operational Research, Elsevier, vol. 137(2), pages 401-420, March.
    8. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.
    9. Vis, Iris F.A., 2006. "Survey of research in the design and control of automated guided vehicle systems," European Journal of Operational Research, Elsevier, vol. 170(3), pages 677-709, May.

    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:inm:oropre:v:40:y:1992:i:3:p:533-550. 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 Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.