APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR SKILL-BASED ROUTING IN CALL CENTERS

DOI10.1017/S0269964812000216zbMath1254.90075MaRDI QIDQ4902493

Dennis Roubos, Sandjai Bhulai

Publication date: 15 January 2013

Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)

Related Items (2)

ONLINE CAPACITY PLANNING FOR REHABILITATION TREATMENTS: AN APPROXIMATE DYNAMIC PROGRAMMING APPROACH ⋮ Managing Patient Admissions in a Neurology Ward

Cites Work

• Unnamed Item
• Queueing models of call centers: An introduction
• Service-Level Differentiation in Call Centers with Fully Flexible Servers
• q-SERIES IN MARKOV CHAINS WITH BINOMIAL TRANSITIONS
• A Call-Routing Problem with Service-Level Constraints
• Queueing model for call blending in call centers

This page was built for publication: APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR SKILL-BASED ROUTING IN CALL CENTERS