A frequent observation in service systems with queues in parallel is that customers in other queues tend to be served faster than those in one?s own queue. This paper quantifies the probability that one?s service would have started earlier if one had joined another queue than the queue that was actually chosen, for exponential multiserver systems with queues in parallel in which customers join one of the shortest queues upon arrival and in which jockeying is not possible.
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
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by Tilburg University, Center for Economic Research in its series Discussion Paper with number
2008-54.
Find related papers by JEL classification: C44 - Mathematical and Quantitative Methods - - Econometric and Statistical Methods: Special Topics - - - Statistical Decision Theory; Operations Research C60 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - General
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: