An optimal local search procedure for manpower schedulling in call centers
| Authors |
|
|---|---|
| Publication date | 2003 |
| Journal | IIE Transactions |
| Volume | Issue number | 35 |
| Pages (from-to) | 1049-1055 |
| Number of pages | 6 |
| Organisations |
|
| Abstract | We study a shift scheduling problem for call centers with an overall service level objective. We prove a property of this problem, called multimodularity, that ensures that a local search algorithm terminates with a globally optimal solution. We report on computations performed using real call center data. |
| Document type | Article |
| Published at |
https://doi.org/10.1080/07408170304398
(Final published version)
|
| Permalink to this page | |