Sojourn times in a random queue with and without preemption

Sojourn times in a random queue with and without preemption

0.00 Avg rating0 Votes
Article ID: iaor20001858
Country: Netherlands
Volume: 112
Issue: 3
Start Page Number: 646
End Page Number: 653
Publication Date: Feb 1999
Journal: European Journal of Operational Research
Authors: ,
Keywords: Sojourn times, M/M/1 queues
Abstract:

We consider an equilibrium M/M/1 queue in which customers arrive at a random position, both for the preemptive and non-preemptive cases. The Laplace–Stieltjes transforms of their sojourn time distributions are derived and in the latter case it is verified that the result is that of an M/M/1 queue where the server chooses the next task to serve at random.

Reviews

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