María Concepción Ausín Olivera () Rosa E. Lillo () Michael P. Wiper ()
Abstract
In this paper we consider the problem of designing a GI/M/c queueing system. Given arrival and service data, our objective is to choose the optimal number of servers so as to minimize an expected cost function which depends on quantities, such as the number of customers in the queue. A semiparametric approach based on Erlang mixture distributions is used to model the general interarrival time distribution. Given the sample data, Bayesian Markov chain Monte Carlo methods are used to estimate the system parameters and the predictive distributions of the usual performance measures. We can then use these estimates to minimize the steady-state expected total cost rate as a function of the control parameter c. We provide a numerical example based on real data obtained from a bank in Madrid.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.