Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Koole et al. (2003) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: