A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand
DOI10.1016/J.COR.2015.06.016zbMATH Open1349.90546OpenAlexW1468942520MaRDI QIDQ342137FDOQ342137
Mieke Defraeye, Inneke Van Nieuwenhuyse
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.06.016
Recommendations
- scientific article; zbMATH DE number 1462943
- A stochastic optimization approach to shift scheduling with breaks adjustments
- A composite branch and cut algorithm for optimal shift scheduling with multiple breaks and break windows
- Accounting for time-varying queueing effects in workforce scheduling
- An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime
- Call center staffing with simulation and cutting plane methods
- Staffing Multiskill Call Centers via Linear Programming and Simulation
- Profit-oriented shift scheduling of inbound contact centers with skills-based routing, impatient customers, and retrials
- Staffing of Time-Varying Queues to Achieve Time-Stable Performance
- Combining integer programming and the randomization method to schedule employees
- Accounting for time-varying queueing effects in workforce scheduling
- Setting staffing requirements for time dependent queueing networks: the case of accident and emergency departments
- Workforce scheduling with multiple objectives
- A survey and experimental comparison of service-level-approximation methods for nonstationary \(M(t)/M/s(t)\) queueing systems with exhaustive discipline
- Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods
- The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution
- Title not available (Why is that?)
Cited In (8)
- The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
- Title not available (Why is that?)
- A stochastic optimization approach to shift scheduling with breaks adjustments
- Physician Staffing for Emergency Departments with Time-Varying Demand
- On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
- Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments
- Eulerian polynomials and Quasi-Birth-Death processes with time-varying-periodic rates
- Retail store operations: literature review and research directions
This page was built for publication: A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342137)
