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

Buffer Space Allocation in Automated Assembly Lines

Author

Listed:
  • J. MacGregor Smith

    (University of Massachusetts, Amherst, Massachusetts)

  • Sophia Daskalaki

    (University of Massachusetts, Amherst, Massachusetts)

Abstract

Automated assembly lines are modeled as finite open queueing networks and a heuristic for buffer space allocation within these lines is presented. The Expansion Method, an analytical technique for modeling finite open queueing networks and Powell's unconstrained optimization procedure are integrated in a design methodology, which evaluates alternative line topologies, system throughputs, and their optimal buffer sizes. The resulting design methodology is demonstrated for series, merging and splitting topologies of automated assembly lines with balanced and unbalanced service rates.

Suggested Citation

  • J. MacGregor Smith & Sophia Daskalaki, 1988. "Buffer Space Allocation in Automated Assembly Lines," Operations Research, INFORMS, vol. 36(2), pages 343-358, April.
    • Handle: RePEc:inm:oropre:v:36:y:1988:i:2:p:343-358
    DOI: 10.1287/opre.36.2.343
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.36.2.343
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.36.2.343?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. H. S. R. Martins & F. R. B. Cruz & A. R. Duarte & F. L. P. Oliveira, 2019. "Modeling and optimization of buffers and servers in finite queueing networks," OPSEARCH, Springer;Operational Research Society of India, vol. 56(1), pages 123-150, March.
    2. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    3. Elisa Gebennini & Andrea Grassi & Cesare Fantuzzi, 2015. "The two-machine one-buffer continuous time model with restart policy," Annals of Operations Research, Springer, vol. 231(1), pages 33-64, August.
    4. Bakuli, David L. & MacGregor Smith, J., 1996. "Resource allocation in state-dependent emergency evacuation networks," European Journal of Operational Research, Elsevier, vol. 89(3), pages 543-555, March.
    5. Kirkavak, Nureddin & Dincer, Cemal, 1999. "The general behavior of pull production systems: The allocation problems," European Journal of Operational Research, Elsevier, vol. 119(2), pages 479-494, December.
    6. Gilberto Pérez-Lechuga & Francisco Venegas-Martínez & Marco A. Montufar-Benítez & Jaime Mora-Vargas, 2022. "On the Dynamics in Decoupling Buffers in Mass Manufacturing Lines: A Stochastic Approach," Mathematics, MDPI, vol. 10(10), pages 1-21, May.
    7. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Modelling complex assemblies as a queueing network for lead time control," European Journal of Operational Research, Elsevier, vol. 174(1), pages 150-168, October.
    8. Subba Rao, S. & Gunasekaran, A. & Goyal, S. K. & Martikainen, T., 1998. "Waiting line model applications in manufacturing," International Journal of Production Economics, Elsevier, vol. 54(1), pages 1-28, January.
    9. Smith, J. MacGregor & Cruz, F.R.B. & van Woensel, T., 2010. "Topological network design of general, finite, multi-server queueing networks," European Journal of Operational Research, Elsevier, vol. 201(2), pages 427-441, March.
    10. Nahas, Nabil & Nourelfath, Mustapha & Gendreau, Michel, 2014. "Selecting machines and buffers in unreliable assembly/disassembly manufacturing networks," International Journal of Production Economics, Elsevier, vol. 154(C), pages 113-126.
    11. Mitchell, David H. & MacGregor Smith, J., 2001. "Topological network design of pedestrian networks," Transportation Research Part B: Methodological, Elsevier, vol. 35(2), pages 107-135, February.
    12. George Liberopoulos, 2020. "Comparison of optimal buffer allocation in flow lines under installation buffer, echelon buffer, and CONWIP policies," Flexible Services and Manufacturing Journal, Springer, vol. 32(2), pages 297-365, June.
    13. Andijani, A. A., 1998. "A multi-criterion approach for Kanban allocations," Omega, Elsevier, vol. 26(4), pages 483-493, August.
    14. Andijani, A. A. & Anwarul, M., 1997. "Manufacturing blocking discipline: A multi-criterion approach for buffer allocations," International Journal of Production Economics, Elsevier, vol. 51(3), pages 155-163, September.

    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:36:y:1988:i:2:p:343-358. 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.