Buffer and Server Allocation in General Multi-Server Queueing Networks

Laoucine Kerbache, T. van Woensel, R. Andriansyah, F.R.B. Cruz and J. Macgregor Smith
Additional contact information
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

Post-Print from HAL

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.

Keywords: joint buffer and server allocation; general service; queues; networks (search for similar items in EconPapers)
Date: 2010-03
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Published in International Transactions in Operational Research, 2010, 17 (2), pp.257-286. ⟨10.1111/j.1475-3995.2009.00746.x⟩

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hal:journl:hal-00521806

DOI: 10.1111/j.1475-3995.2009.00746.x

Access Statistics for this paper

More papers in Post-Print from HAL
Bibliographic data for series maintained by CCSD ().