Dynamic server assignment in a two-queue model

Dynamic server assignment in a two-queue model

0.00 Avg rating0 Votes
Article ID: iaor19991736
Country: Netherlands
Volume: 103
Issue: 3
Start Page Number: 595
End Page Number: 609
Publication Date: Dec 1997
Journal: European Journal of Operational Research
Authors: ,
Keywords: 1 queues
Abstract:

We consider a polling model of two M/G/I queues, served by a single server. The service policy for this polling model is of threshold type. Service at queue 1 is exhaustive. Service at queue 2 is exhaustive unless the size of queue 1 reaches some level T during a service at queue 2; in the latter case the server switches to queue 1 at the end of that service. Both zero- and nonzero switchover times are considered. We derive exact expressions for the joint queue length distribution at customer departure epochs, and for the steady-state queue-length and sojourn time distributions. In addition, we supply a simple and very accurate approximation for the mean queue lengths, which is suitable for optimization purposes.

Reviews

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