Abstract
We study the problem of optimally scheduling tickets in shared delivery of IT services. Such delivery models are characterized by a common pool of skilled agents who collectively support the service needs of several customers at a time. The ticket scheduling problem becomes interesting in this scenario due to the need to provide satisfactory experience to multiple customers with different Service Level Agreements (SLAs) in a cost-efficient and optimal way, by intelligently leveraging the available skill set and balancing workload across agents. We present a detailed description of the problem domain and introduce a novel metric for estimating the relative criticality of tickets from different customers at any point in time, taking into account several factors such as the distance from SLA breach, the SLA penalty and the expected volume of tickets during the rest of the service time window. This criticality measure is used within a Mixed Integer Programming (MIP) based solution approach to the ticket scheduling problem, where we consider the objectives of SLA penalty minimization, balancing breaches across customers, load balancing across agents, and maximizing skill match. Due to the complexity of the problem, optimization engines may not always return feasible or efficient solutions within reasonable time limits. Hence, we also develop a custom heuristic algorithm that returns acceptable solutions very fast. Detailed simulation experiments are used to compare these approaches and to demonstrate their efficiency in meeting the scheduling objectives of shared delivery.
Chapter PDF
Similar content being viewed by others
Keywords
- Mixed Integer Programming
- Service Level Agreement
- Mixed Integer Programming Model
- Mixed Integer Programming Formulation
- Total Penalty
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Application assembly optimization: a distinct approach to global delivery. White Paper, IBM GBS (2010)
Deshpande, P.M., Garg, D., Rama Suri, N.: Auction based models for ticket allocation problem in it service delivery industry. In: IEEE Intl. Conf. on Ser. Comp., SCC (2008)
Gans, N., et al.: Telephone call centers: Tutorial, review, and research prospects. Manf. & Ser. Op. Mgmt. 5 (2003)
Gupta, P., Parija, G.R.: Efficient seat utilization in global it delivery service systems. In: IEEE SCC, pp. 97–103 (2009)
Kakal, C.S.: Global shared support service: Leveraging expertise, sharing costs, and deriving value. White Paper, Infosys (May 2005)
Karger, D., Stein, C., Wein, J.: Scheduling algorithms. In: Algorithms and Theory of Computation Handbook (2010)
Khan, A., et al.: Aim-hi: a framework for request routing in large-scale it global service delivery. IBM J. Res. Dev. 53 (2009)
Lawler, E.L., et al.: Sequencing and scheduling: Algorithms and complexity. In: Logistics of Production and Inventory, vol. 4, pp. 445–522. Elsevier (1993)
Shao, Q., Chen, Y., Tao, S., Yan, X., Anerousis, N.: Efficient ticket routing by resolution sequence mining. In: KDD (2008)
Subbian, K., et al.: Incentive compatible mechanisms for group ticket allocation in software maintenance services. In: APSEC (2007)
Wallace, R.B., Whitt, W.: A staffing algorithm for call centers with skill-based routing. Manufacturing & Service Operations Management 7 (2005)
Zhou, N., Ma, Q., Ratakonda, K.: Quantitative modeling of communication cost for global service delivery. In: IEEE SCC, pp. 388–395 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gupta, H.S., Sengupta, B. (2012). Scheduling Service Tickets in Shared Delivery. In: Liu, C., Ludwig, H., Toumani, F., Yu, Q. (eds) Service-Oriented Computing. ICSOC 2012. Lecture Notes in Computer Science, vol 7636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34321-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-34321-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34320-9
Online ISBN: 978-3-642-34321-6
eBook Packages: Computer ScienceComputer Science (R0)