Title of article :
THE N-NETWORK MODEL WITH UPGRADES
Author/Authors :
Douglas G. Down، نويسنده , , Mark E. Lewis، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2010
Pages :
30
From page :
171
To page :
200
Abstract :
In this article we introduce a newmethod of mitigating the problem of longwait times for low-priority customers in a two-class queuing system. To this end, we allow class 1 customers to be upgraded to class 2 after they have been in queue for some time.We assume that there are ci servers at station i, i = 1, 2. The servers at station 1 are flexible in the sense that they can work at either station, whereas the servers at station 2 are dedicated. Holding costs at rate hi are accrued per customer per unit time at station i, i = 1, 2. This study yields several surprising results. First, we show that stability analysis requires a condition on the order of the service rates. This is unexpected since no such condition is required when the system does not have upgrades. This condition continues to play a role when control is considered.We provide structural results that include a c-μ rule when an inequality holds and a threshold policy when the inequality is reversed. A numerical study verifies that the optimal control policy significantly reduces holding costs over the policy that assigns the flexible server to station 1. At the same time, in most cases the optimal control policy reduces waiting times of both customer classes.
Journal title :
Probability in the Engineering and Informational Sciences
Serial Year :
2010
Journal title :
Probability in the Engineering and Informational Sciences
Record number :
665178
Link To Document :
بازگشت