<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05638489</id>
  <dt>j</dt>
  <an>05638489</an>
  <augroup>
    <au>Pisacane, Ornella</au>
  </augroup>
  <ti>Agent scheduling in a multiskill call center.</ti>
  <so>4OR 7, No. 2, 199-202 (2009).</so>
  <py>2009</py>
  <pu>Springer, Heidelberg</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>call center</ut>
    <ut>integer programming</ut>
    <ut>linear programming</ut>
    <ut>scheduling problem</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/s10288-008-0078-4</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This is a summary of the author's PhD thesis, supervised by Pierre L'Ecuyer and Roberto Musmanno and defended on 21 February 2008 at the Universit\`a della Calabria. The thesis is written in English and is available from the author upon request. This work deals with the comparison of simulation-based algorithms for solving the agents scheduling problem in a multiskill call center minimizing their costs under service levels constraints. A solution approach, combining simulation, with integer or linear programming, and cut generation, is proposed. Considering realistic problems, it performs better than the two-step approach proposed in the literature. It is also shown that a randomized search, extending the one defined for the single-period staffing problem in {\it A. N. Avramidis, W. Chan} and {\it P. L'Ecuyer} [Staffing multi-skill call centers via search methods and a performance approximation, IIE Trans. (in press) (2008)], yields highly suboptimal solutions. Finally, an extension of the cutting plane method to directly control the probability on the customers abandonments is designed.</ab>
    <rv></rv>
  </abgroup>
</item>