IDEAS home Printed from https://ideas.repec.org/p/hal/journl/hal-00521806.html
   My bibliography  Save this paper

Buffer and Server Allocation in General Multi-Server Queueing Networks

Author

Listed:
  • Laoucine Kerbache

    (GREGH - Groupement de Recherche et d'Etudes en Gestion à HEC - HEC Paris - Ecole des Hautes Etudes Commerciales - CNRS - Centre National de la Recherche Scientifique)

  • T. van Woensel

    (School of industrial Engineering [Eindhoven] - TU/e - Eindhoven University of Technology [Eindhoven])

  • R. Andriansyah

    (Department of Mechanical Engineering [Eindhoven] - TU/e - Eindhoven University of Technology [Eindhoven] - TU/e - Technische Universiteit Eindhoven)

  • F.R.B. Cruz

    (School of Computer Science and Information Technology - UON - University of Nottingham, UK)

  • J. Macgregor Smith

    (Department of Mechanical and Industrial Engineering [UMass] - UMass Amherst - University of Massachusetts [Amherst] - UMASS - University of Massachusetts System)

Abstract

This paper deals with the joint optimization of the number of buffers and servers, an important issue since buffers and servers represent a significant amount of investment for many companies. The joint buffer and server optimization problem (BCAP) is a non-linear optimization problem with integer decision variables. The performance of the BCAP is evaluated by a combination of a two-moment approximation (developed for the performance analysis of finite general-service queues) and the generalized expansion method (a well-known method for performance analysis of acyclic networks of finite queues). A standard non-linear optimization package is used to optimize the BCAP for a large number of experiments. A comprehensive set of numerical results is presented. The results show that the methodology is capable of handling the trade-off between the number of servers and buffers, yielding better throughputs than previously published studies. Also, the importance of the squared coefficient of variation of the service time is stressed, since it strongly influences the approximate optimal allocation.

Suggested Citation

  • Laoucine Kerbache & T. van Woensel & R. Andriansyah & F.R.B. Cruz & J. Macgregor Smith, 2010. "Buffer and Server Allocation in General Multi-Server Queueing Networks," Post-Print hal-00521806, HAL.
    • Handle: RePEc:hal:journl:hal-00521806
    DOI: 10.1111/j.1475-3995.2009.00746.x
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. Yarmand, Mohammad H. & Down, Douglas G., 2013. "Server allocation for zero buffer tandem queues," European Journal of Operational Research, Elsevier, vol. 230(3), pages 596-603.
    2. 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.
    3. Cruz, F.R.B. & Van Woensel, T. & Smith, J. MacGregor, 2010. "Buffer and throughput trade-offs in M/G/1/K queueing networks: A bi-criteria approach," International Journal of Production Economics, Elsevier, vol. 125(2), pages 224-234, June.

    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:hal:journl:hal-00521806. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.