Advertisement

Stochastic Optimization for Adaptive Labor Staffing in Service Systems

  • L. A. Prashanth
  • H. L. Prasad
  • Nirmit Desai
  • Shalabh Bhatnagar
  • Gargi Dasgupta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7084)

Abstract

Service systems are labor intensive. Further, the workload tends to vary greatly with time. Adapting the staffing levels to the workloads in such systems is nontrivial due to a large number of parameters and operational variations, but crucial for business objectives such as minimal labor inventory. One of the central challenges is to optimize the staffing while maintaining system steady-state and compliance to aggregate SLA constraints. We formulate this problem as a parametrized constrained Markov process and propose a novel stochastic optimization algorithm for solving it. Our algorithm is a multi-timescale stochastic approximation scheme that incorporates a SPSA based algorithm for ‘primal descent’ and couples it with a ‘dual ascent’ scheme for the Lagrange multipliers. We validate this optimization scheme on five real-life service systems and compare it with a state-of-the-art optimization tool-kit OptQuest. Being two orders of magnitude faster than OptQuest, our scheme is particularly suitable for adaptive labor staffing. Also, we observe that it guarantees convergence and finds better solutions than OptQuest in many cases.

Keywords

Service systems labor optimization constrained stochastic optimization 

References

  1. 1.
    Alter, S.: Service system fundamentals: Work system, value chain, and life cycle. IBM Systems Journal 47(1), 71–85 (2008)CrossRefGoogle Scholar
  2. 2.
    Bhatnagar, S., Fu, M., Marcus, S., Wang, I.: Two-timescale simultaneous perturbation stochastic approximation using deterministic perturbation sequences. ACM Transactions on Modeling and Computer Simulation (TOMACS) 13(2), 180–209 (2003)CrossRefGoogle Scholar
  3. 3.
    Banerjee, D., Desai, N., Dasgupta, G.: Simulation-based evaluation of dispatching policies in service systems. In: Winter Simulation Conference (2011) (under review)Google Scholar
  4. 4.
    Laguna, M.: Optimization of complex systems with optquest. OptQuest for Crystal Ball User Manual, Decisioneering (1998)Google Scholar
  5. 5.
    Verma, A., Desai, N., Bhamidipaty, A., Jain, A., Nallacherry, J., Roy, S., Barnes, S.: Automated optimal dispatching of service requests. In: SRII Global Conference (2011)Google Scholar
  6. 6.
    Wasserkrug, S., Taub, S., Zeltyn, S., Gilat, D., Lipets, V., Feldman, Z., Mandelbaum, A.: Creating operational shift schedules for third-level it support: challenges, models and case study. International Journal of Services Operations and Informatics 3(3), 242–257 (2008)CrossRefGoogle Scholar
  7. 7.
    Spall, J.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Transactions on Automatic Control 37(3), 332–341 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Bhatnagar, S., Hemachandra, N., Mishra, V.: Adaptive multivariate three-timescale stochastic approximation algorithms for simulation based optimization. ACM Transactions on Modeling and Computer Simulation (TOMACS) 21(3) (2011)Google Scholar
  9. 9.
    Borkar, V.S.: Stochastic approximation: a dynamical systems viewpoint. Cambridge Univ. Pr. (2008)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • L. A. Prashanth
    • 1
  • H. L. Prasad
    • 1
  • Nirmit Desai
    • 2
  • Shalabh Bhatnagar
    • 1
  • Gargi Dasgupta
    • 2
  1. 1.Indian Institute of ScienceBangaloreIndia
  2. 2.IBM ResearchBangaloreIndia

Personalised recommendations