Dynamic scheduling of a GI/GI/1+GI queue with multiple customer classes
We consider a dynamic control problem for a GI/GI/1+GI queue with multiclass customers. The customer classes are distinguished by their interarrival time, service time, and abandonment time distributions. There is a cost c k >0 for every class k?{1,2,,N} customer that abandons the queue before receiving service. The objective is to minimize average cost by dynamically choosing which customer class the server should next serve each time the server becomes available (and there are waiting customers from at least two classes).
scheduling control in multiclass queue customer abandonment customer reneging customer impatience diffusion approximation brownian control problem 60k25 90b22 93e20