Contact Center Scheduling with Strict Resource Requirements
From MaRDI portal
Publication:3009760
DOI10.1007/978-3-642-20807-2_13zbMath1341.90042MaRDI QIDQ3009760
Gyana R. Parija, Sambuddha Roy, Amit Kumar, Pranav Gupta, Aman Dhesi
Publication date: 24 June 2011
Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_13
90B35: Deterministic scheduling theory in operations research
Cites Work
- Combining integer programming and the randomization method to schedule employees
- A PCP characterization of NP with optimal amortized query complexity
- Non-monotone submodular maximization under matroid and knapsack constraints
- Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract)