On the scheduling of operations in a chat contact center
type: Item
instance of: scholarly article
title: On the scheduling of operations in a chat contact center
zbMATH Open document ID: 1430.90196
author: Benjamin Legros
author: Oualid Jouini
published in: European Journal of Operational Research
publication date: 2019-01-09T00:00:00Z
Mathematics Subject Classification ID: 90B22
Mathematics Subject Classification ID: 90C40
zbMATH DE Number: 6998918
zbMATH Keywords: contact centers
zbMATH Keywords: queueing systems
zbMATH Keywords: Markov decision process
zbMATH Keywords: chat messages
zbMATH Keywords: multitasking
describes a project that uses: Reservation
MaRDI profile type: Publication
Wikidata QID: Q57982323
full work available at URL: j.ejor.2018.09.040
OpenAlex ID: W2893042644
cites work: Capacity sizing in the presence of a common shared resource: Dimensioning an inbound call center.
cites work: Call center service process analysis: Bayesian parametric and semi-parametric mixture modeling
cites work: Optimizing daily agent scheduling in a multiskill call center
cites work: The impact of special days in call arrivals forecasting: a neural network approach to modelling special days
cites work: Q3286740
cites work: On structural properties of the value function for an unbounded jump Markov process with an application to a processor sharing retrial queue
cites work: On the structure of value functions for threshold policies in queueing models
cites work: Queueing model for call blending in call centers
cites work: Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
cites work: Approximations for Chat Service Systems Using Many-Server Diffusion Limits
cites work: Markov chain models of a telephone call center with call blending
cites work: A Markov decision process model for equitable distribution of supplies under uncertainty
cites work: A Call-Routing Problem with Service-Level Constraints
cites work: Fluid Limits for Processor-Sharing Queues with Impatience
cites work: Mean sojourn times for phase-type discriminatory processor sharing systems
cites work: On the Assignment of Customers to Parallel Queues
cites work: Periodic routing to parallel queues and billiard sequences
cites work: Inter-dependent, heterogeneous, and time-varying service-time distributions in call centers
cites work: On the transient behavior of the processor sharing queue
cites work: Online scheduling policies for multiclass call centers with impatient customers
cites work: Queueing System MAP/M/N as a Model of Call Center with Call-Back Option
cites work: Minimizing response times and queue lengths in systems of parallel queues
cites work: Reservation, a tool to reduce the balking effect and the probability of delay
cites work: Waiting time based routing policies to parallel queues with percentiles objectives
cites work: Staffing and Control of Instant Messaging Contact Centers
cites work: Separable routing: A scheme for state-dependent routing of circuit switched telephone traffic
cites work: Markov decision processes with multidimensional action spaces
cites work: The Fluid Limit of an Overloaded Processor Sharing Queue
cites work: Q4315289
cites work: A strategic timing of arrivals to a linear slowdown processor sharing system
cites work: Routing and Staffing in Customer Service Chat Systems with Impatient Customers
cites work: Calculation of the performance region of an easy-to-optimize alternative for generalized processor sharing
cites work: Deciding Which Queue to Join: Some Counterexamples
cites work: Optimality of the shortest line discipline
cites work: Law of Large Number Limits of Limited Processor-Sharing Queues
cites work: Monotone optimal control for a class of Markov decision processes
DOI: 10.1016/J.EJOR.2018.09.040
description: scientific article; zbMATH DE number 6998918