Contact Center Scheduling with Strict Resource Requirements

DOI10.1007/978-3-642-20807-2_13zbMath1341.90042OpenAlexW171146128MaRDI 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

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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)

This page was built for publication: Contact Center Scheduling with Strict Resource Requirements