Optimal shift scheduling with a global service level constraint (original) (raw)
Related papers
An optimal local search procedure for manpower scheduling in call centers
1998
We are concerned with the minimization of multimodular functions. We show that for these functions local search gives the global optimum for a well-de ned nite neighborhood. We apply this to a problem arising from manpower scheduling in call centers which has a multimodular objective function.
A Branch-and-Bound Algorithm for Shift Scheduling with Nonstationary Demand
SSRN Electronic Journal, 2000
Many shift scheduling algorithms presume that the staffing levels, required to ensure a target customer service, are known in advance. Determining these staffing requirements is often not straightforward, particularly in systems where the arrival rate fluctuates over the day. We present a branch-and-bound approach to estimate optimal shift schedules in systems with nonstationary demand and (stochastic) service level constraints. The algorithm is intended for personnel planning in small-scale service systems with limited opening hours (such as smallscale call centers, banks, and retail stores). Our computational experiments show that the algorithm efficiently explores the solution space and quickly finds an optimum (even if an inferior starting solution is used). 1 best, particularly in systems with nonstationary arrival rates. Moreover, this "two-step" approach may result in a suboptimal schedule .
Scheduling Breaks in Shift Plans for Call Centers
In this paper we consider a real-life break scheduling problem for call center agents involving a large number of breaks and constraints. Obtaining good solutions for this problem increases the well-being of call center employees and guarantees a certain quality of service for calling customers. To solve this problem we present two local search approaches, a min-conflicts based search algorithm and a tabu search algorithm and consider a hybridization of both techniques. Our computational experiments reveal that the presented techniques generate high-quality solutions to our problems in reasonable time. These solutions are able to satisfy the needs of customers, call center agents, and employers at the same time.
Mathematical Problems in Engineering
It may be very difficult to achieve the optimal shift schedule in call centers which have highly uncertain and peaked demand during short time periods. Overlapping shift systems are usually designed for such cases. This paper studies shift scheduling and rostering problems for inbound call centers where overlapping shift systems are used. An integer programming model that determines which shifts to be opened and how many operators to be assigned to these shifts is proposed for the shift scheduling problem. For the rostering problem both integer programming and constraint programming models are developed to determine assignments of operators to all shifts, weekly days-off, and meal and relief break times of the operators. The proposed models are tested on real data supplied by an outsource call center and optimal results are found in an acceptable computation time. An improvement of 15% in the objective function compared to the current situation is observed with the proposed model fo...
Optimization of Multi-skill Call Centers Contracts and Work-shifts
Service Science, 2011
all centers are complex systems in which it is essential to optimize the trade-off between the service level provided to the customers and the cost for the personnel. In this paper we describe a quantitative approach to choose the most suitable contracts to hire the call center operators. The aim is to organize their work-shifts and their rest periods, including lunch-breaks, in such a way that the mix of skills obtained in each time slot is as close as possible to a desired level, estimated according to demand forecasts. The approach here proposed is based on a heuristic method which exploits a general purpose linear programming solver.
Shift-Scheduling of Call Centers With Uncertain Arrival Parameters
This paper considers a multi-periodic multi-shift call center staffing problem with two types of jobs: calls and emails. The arrival rate of calls is random and the workforce presents some flexibility: the agents can be affected to one job type in real-time. At each period of the day, a service quality constraint limits the waiting time for a call. The staffing problem is modeled as a newsboy-type model under an expected cost criterion. We then consider three different approaches in order to solve the optimization problem. First, we explicitly formulate the expected cost newsboy-type formulation as a stochastic program. Second, the formulation is extended to the conditional value-at-risk (CVaR) setting. Third, we develop the robust optimization approach. The proposed approaches are evaluated with real data obtained from the call center of a Dutch hospital. Computational results show that the robust approach is highly tractable and the solutions have good quality under several conditions. We show in addition the necessity of taking into account the randomness of the call arrival rates. We also show that profiting from the email job flexibility is highly attractive.
Optimal selection of contracts and work shifts in multi-skill call centers
EURO Journal on Computational Optimization, 2014
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 t...
Optimizing daily agent scheduling in a multiskill call center
European Journal of Operational Research, 2010
We examine and compare simulation-based algorithms for solving the agent scheduling problem in a multiskill call center. This problem consists in minimizing the total costs of agents under constraints on the expected service level per call type, per period, and aggregated. We propose a solution approach that combines simulation with integer or linear programming, with cut generation. In our numerical experiments with realistic problem instances, this approach performs better than all other methods proposed previously for this problem. We also show that the two-step approach, which is the standard method for solving this problem, sometimes yield solutions that are highly suboptimal and inferior to those obtained by our proposed method.
Optimal shift scheduling: A branch-and-price approach
Naval Research Logistics, 2000
We present a branch-and-price technique for optimal staff scheduling with multiple rest breaks, meal break, and break windows. We devise and implement specialized branching rules suitable for solving the set covering type formulation implicitly, using column generation. Our methodology is more widely applicable and computationally superior to the alternative methods in the literature. We tested our methodology on 365 test problems involving between 1728 and 86400 shift variations, and 20 demand patterns. In a direct comparison with an alternative method, our approach yields significant improvements both in cpu time and in the number of problem instances solved to optimality. The improvements were particularly marked for problems involving larger numbers of feasible shifts.