A Call-Routing Problem with Service-Level Constraints

DOI10.1287/opre.51.2.255.12787zbMath1163.90547MaRDI QIDQ3635189

Publication date: 5 July 2009

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/91288aef1e997fc4eb2fb647567651dbb424205d

Mathematics Subject Classification ID

90B50: Management decision making, including multiple objectives

90B15: Stochastic network models in operations research

90B22: Queues and service in operations research

90B90: Case-oriented studies in operations research

Related Items

TWO-CLASS ROUTING WITH ADMISSION CONTROL AND STRICT PRIORITIES, APPROXIMATE DYNAMIC PROGRAMMING TECHNIQUES FOR SKILL-BASED ROUTING IN CALL CENTERS, Nonlinear Programming Problem for an M-Design Multi-Skill Call Center with Impatience Based on Queueing Model Method, An Optimal Callback Policy for General Arrival Processes: A Pathwise Analysis, Optimal pricing and scheduling control of product shipping, Profit maximization in flexible serial queueing networks, Queues with waiting time dependent service, Stability of generalized Jackson networks with infinite supply of work, Optimal resource allocation for multiqueue systems with a shared server pool, Dynamic routing in large-scale service systems with heterogeneous servers, An optimal deterministic control policy of servers in front and back rooms with a variable number of switching points and switching costs, Outsourcing strategy in two-stage call centers, Call centers with a postponed callback offer, Reservation, a tool to reduce the balking effect and the probability of delay, Exact analysis for multiserver queueing systems with cross selling, On the scheduling of operations in a chat contact center, Optimal balanced control for call centers, Front-office multitasking between service encounters and back-office tasks, Optimal staffing for ticket queues, The transient blended queue, Jackson networks with unlimited supply of work, DYNAMIC ROUTING POLICIES FOR MULTISKILL CALL CENTERS, DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM