A matrix-geometric solution of the jockeying problem

A matrix-geometric solution of the jockeying problem

0.00 Avg rating0 Votes
Article ID: iaor1991324
Country: Netherlands
Volume: 44
Issue: 1
Start Page Number: 67
End Page Number: 74
Publication Date: Jan 1990
Journal: European Journal of Operational Research
Authors: ,
Abstract:

The multi-server exponential queue is considered, studied by Disney and Mitchell in 1971, and by Elsayed and Bastani in 1985, where customers are allowed to jockey among queues. A matrix-geometric solution for the problem is proposed. By exploiting the structure of the model, simple procedures are developed for computing the stationary probability vector of the underlying continuous-time Markov chain, the waiting time distribution, and other performance characteristics of interest.

Reviews

Required fields are marked *. Your email address will not be published.