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

DOI10.1016/J.COR.2015.06.016MaRDI QIDQ342137zbMATH OpenOpenAlexFDO

Authors 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)

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

Cites work

• scientific article; zbMATH DE number 1097572 (Why is no real title available?)
• A survey and experimental comparison of service-level-approximation methods for nonstationary \(M(t)/M/s(t)\) queueing systems with exhaustive discipline
• Accounting for time-varying queueing effects in workforce scheduling
• Call center staffing with simulation and cutting plane methods
• Combining integer programming and the randomization method to schedule employees
• Optimizing call center staffing using simulation and analytic center cutting-plane methods
• Profit-oriented shift scheduling of inbound contact centers with skills-based routing, impatient customers, and retrials
• Queues with many servers: the virtual waiting-time process in the QED regime
• Setting staffing requirements for time dependent queueing networks: the case of accident and emergency departments
• Staffing multiskill call centers via linear programming and simulation
• Staffing of time-varying queues to achieve time-stable performance
• The discrete-time single-server queue with time-inhomogeneous compound Poisson input and general service time distribution
• Workforce scheduling with multiple objectives

Cited in

(8)

• Physician staffing for emergency departments with time-varying demand
• Performance approximation for time-dependent queues with generally distributed abandonments
• The venue management problem: setting staffing levels, shifts and shift schedules at concession stands
• On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling
• Eulerian polynomials and quasi-birth-death processes with time-varying-periodic rates
• scientific article; zbMATH DE number 1462943 (Why is no real title available?)
• Retail store operations: literature review and research directions
• A stochastic optimization approach to shift scheduling with breaks adjustments

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)