DocumentCode :
2182794
Title :
A new policy for the service request assignment problem with multiple severity level, due date and sla penalty service requests
Author :
Sheopuri, Anshul ; Zeng, Sai ; Dorai, Chitra
Author_Institution :
IBM T.J. Watson Res. Center, Hawthorne, NY, USA
fYear :
2008
fDate :
7-10 Dec. 2008
Firstpage :
1661
Lastpage :
1668
Abstract :
We study the problem of assigning multiple severity level service requests to agents in an agent pool. Each severity level is associated with a due date and a penalty, which is incurred if the service request is not resolved by the due date. Motivated by Van Meighem (2003), who shows the asymptotic optimality of the generalized longest queue policy for the problem of minimizing the due date dependent expected delay costs when there is a single agent, we develop a class of index-based policies that is a generalization of the priority first-come-first-serve, weighted shortest expected processing time and generalized longest queue policy. In our simulation study of an assignment system of a large technology firm, the index-based policy shows an improvement of 0-20 % over the priority first-come-first-serve policy depending upon the load conditions.
Keywords :
information services; queueing theory; SLA penalty service requests; asymptotic optimality; due date; generalized longest queue policy; index-based policies; multiple severity level service requests; priority first-come-first-serve policy; service request assignment problem; weighted shortest expected processing time; Contracts; Cost function; Delay effects; Hardware; Queueing analysis; Safety; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Simulation Conference, 2008. WSC 2008. Winter
Conference_Location :
Austin, TX
Print_ISBN :
978-1-4244-2707-9
Electronic_ISBN :
978-1-4244-2708-6
Type :
conf
DOI :
10.1109/WSC.2008.4736251
Filename :
4736251
Link To Document :
بازگشت