This preview shows page 1. Sign up to view the full content.
Unformatted text preview: n queues and there is one server. At each time, we must allocate the server to one of the queues. When serving the i th queue, the service time is exponential with expected completion time 1 / i . There is a cost c i per unit time per customer waiting in queue i . After a customer is served, he leaves the system with probability q . Otherwise, he joins another queue; the probability he chooses each i th queue is q i , and n i =0 q i = 1. The objective is to minimize expected discounted cost, with a discount rate > 0....
View
Full
Document
 Spring '10
 Bertsekas
 Strain

Click to edit the document details