A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand

DOI10.1016/j.cor.2015.06.016zbMath1349.90546OpenAlexW1468942520MaRDI QIDQ342137

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

zbMATH Keywords

optimizationcapacity analysispersonnel planningstaffing and schedulingtime-varying arrival process

Mathematics Subject Classification ID

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)

Related Items

Performance Approximation for Time-Dependent Queues with Generally Distributed Abandonments ⋮ Retail store operations: literature review and research directions ⋮ Physician Staffing for Emergency Departments with Time-Varying Demand ⋮ A stochastic optimization approach to shift scheduling with breaks adjustments ⋮ On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling ⋮ The venue management problem: setting staffing levels, shifts and shift schedules at concession stands ⋮ Eulerian polynomials and Quasi-Birth-Death processes with time-varying-periodic rates

Cites Work

• Unnamed Item
• Combining integer programming and the randomization method to schedule employees
• Accounting for time-varying queueing effects in workforce scheduling
• Call center staffing with simulation and cutting plane methods
• Setting staffing requirements for time dependent queueing networks: the case of accident and emergency departments
• Profit-oriented shift scheduling of inbound contact centers with skills-based routing, impatient customers, and retrials
• 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
• Staffing Multiskill Call Centers via Linear Programming and Simulation
• Staffing of Time-Varying Queues to Achieve Time-Stable Performance
• Queues with Many Servers: The Virtual Waiting-Time Process in the QED Regime
• The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution