A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow
From MaRDI portal
Publication:6608513
DOI10.1007/S10100-023-00883-ZMaRDI QIDQ6608513FDOQ6608513
Authors: Michael Manitz, Marc-Philip Piehl 
Publication date: 20 September 2024
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Recommendations
- Staffing to maximize profit for call centers with impatient and repeat-calling customers
- Staffing call centers with impatient customers: refinements to many-server asymptotics
- Staffing of time-varying queues to achieve time-stable performance
- A staffing model for call center with customer patience variation
- Staffing many-server queues with impatient customers: constraint satisfaction in call centers
Cites Work
- Queues with waiting time dependent service
- Outsourcing strategy in two-stage call centers
- Queueing models of call centers: An introduction
- Approximation of the non-stationary \(M(t)/M(t)/c(t)\)-queue using stationary queueing models: The stationary backlog-carryover approach
- Improving the Sipp Approach for Staffing Service Systems That Have Cyclic Demands
- Performance analysis and optimization of inbound call centers
- Analysis and design of discrete part production lines
- Efficient algorithms for buffer space allocation
- Staffing a call center with uncertain non-stationary arrival rate and flexibility
- First in line waiting times as a tool for analysing queueing systems
- Optimization of overflow policies in call centers
This page was built for publication: A fast staffing algorithm for multistage call centers with impatient customers and time-dependent overflow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6608513)
