Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T02:28:46.879Z Has data issue: false hasContentIssue false

APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR THE CONTROL OF TIME-VARYING QUEUING SYSTEMS APPLIED TO CALL CENTERS WITH ABANDONMENTS AND RETRIALS

Published online by Cambridge University Press:  21 December 2009

Dennis Roubos
Affiliation:
VU University Amsterdam, Faculty of Sciences, 1081 HV Amsterdam, The Netherlands E-mail: droubos@few.vu.nl; sbhulai@few.vu.nl
Sandjai Bhulai
Affiliation:
VU University Amsterdam, Faculty of Sciences, 1081 HV Amsterdam, The Netherlands E-mail: droubos@few.vu.nl; sbhulai@few.vu.nl
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

In this article we develop techniques for applying Approximate Dynamic Programming (ADP) to the control of time-varying queuing systems. First, we show that the classical state space representation in queuing systems leads to approximations that can be significantly improved by increasing the dimensionality of the state space by state disaggregation. Second, we deal with time-varying parameters by adding them to the state space with an ADP parameterization. We demonstrate these techniques for the optimal admission control in a retrial queue with abandonments and time-varying parameters. The numerical experiments show that our techniques have near to optimal performance.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 2009