53 research outputs found
Dynamic control of a single-server system with abandonments
In this paper, we discuss the dynamic server control in a two-class service system with abandonments. Two models are considered. In the first case, rewards are received upon service completion, and there are no abandonment costs (other than the lost opportunity to gain rewards). In the second, holding costs per customer per unit time are accrued, and each abandonment involves a fixed cost. Both cases are considered under the discounted or average reward/cost criterion. These are extensions of the classic scheduling question (without abandonments) where it is well known that simple priority rules hold. The contributions in this paper are twofold. First, we show that the classic c-μ rule does not hold in general. An added condition on the ordering of the abandonment rates is sufficient to recover the priority rule. Counterexamples show that this condition is not necessary, but when it is violated, significant loss can occur. In the reward case, we show that the decision involves an intuitive tradeoff between getting more rewards and avoiding idling. Secondly, we note that traditional solution techniques are not directly applicable. Since customers may leave in between services, an interchange argument cannot be applied. Since the abandonment rates are unbounded we cannot apply uniformization-and thus cannot use the usual discrete-time Markov decision process techniques. After formulating the problem as a continuous-time Markov decision process (CTMDP), we use sample path arguments in the reward case and a savvy use of truncation in the holding cost case to yield the results. As far as we know, this is the first time that either have been used in conjunction with the CTMDP to show structure in a queueing control problem. The insights made in each model are supported by a detailed numerical study. © 2010 Springer Science+Business Media, LLC
Don't Call Us, We'll Call You: An Empirical Study of Caller Behavior Under a Callback Option
Optimal selection of contracts and work shifts in multi-skill call centers
This paper deals with the problem of finding the most suitable contracts to be used when hiring the operators of a call center and deciding their optimal working schedule, to optimize the trade-off between the service level provided to the customers and the cost of the personnel. In a previous paper (Cordone et al. 2011), we proposed a heuristic method to quickly build an integer solution from the solution of the continuous relaxation of an integer linear programming model. In this paper, we generalize that model to take into account a much wider class of working contracts, allowing heterogeneous shift patterns, as well as legal constraints related to continuously active working environments. Since our original rounding heuristic cannot be extended to the new model, due to its huge size and to the involved correlations between different sets of integer variables, we introduce a more sophisticated heuristic based on decomposition and on a multi-level iterative structure. We compare the results of this heuristic with those of a Greedy Randomized Adaptive Search Procedure, both on real-world instances and on realistic random instances
Scheduling problem in call centers with uncertain arrival rates forecasts: a distributionnaly robust approach
International audienceThis paper deals with the staffing and scheduling problem in call centers. We consider that the call arrival rates are subject to uncertainty and are following independent unknown continuous probability distributions. We assume that we only know the first and second moments of the distribution and thus propose to model this stochastic optimization problem as a distributionally robust program with joint chance constraints. Moreover, the risk level is dynamically shared throughout the entire scheduling horizon during the optimization process. We propose a deterministic equivalent of the problem and solve linear approximations of the Right-Hand Side of the program to provide upper and lower bounds of the optimal solution. We applied our approach on a real-life instance and give numerical results. Finally, we showed the practical interest of this approach compared to a stochastic approach in which the choice of the distribution is incorrect
- …