Service and capacity allocation in M/G/c/c state-dependent queueing networks

Authors:
F. R. B. Cruz;J. MacGregor Smith;D. C. Queiroz
Affiliations:
Department of Mechanical & Industrial Engineering, University of Massachusetts, Amherst, MA;Department of Mechanical & Industrial Engineering, University of Massachusetts, Amherst, MA;Departamento de Estatística, Universidade Federal de Minas Gerais, Belo Horizonte, MG, Brazil
Venue:
Computers and Operations Research
Year:
2005

Citing 2
Cited 2

Asymptotic behavior of the expansion method for open finite queueing networks

Computers and Operations Research
An M/G/C/C state-dependent network simulation model

Computers and Operations Research

Approximate analysis of M/G/c/c state-dependent queueing networks

Computers and Operations Research
Performance optimization of open zero-buffer multi-server queueing networks

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The problem of service and capacity allocation in state-dependent M/G/c/c queueing networks is analyzed and algorithms are developed to compute the optimal allocation c. The model is applied to the modeling of pedestrian circulation systems and basic series, merge, and split topologies are examined. Also of interest are applications to problems of evacuation planning in buildings. Computational experiments assert the algorithm's speed, robustness, and effectiveness. The results obtained indicate that the pattern of the optimal capacity surprisingly repeats over different topologies and it is also heavily dependent upon the arrival rate. Additional computational simulation results are provided to show the accuracy of the approach in all configurations tested.