A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand
We present a branch-and-bound approach for shift scheduling with non-stationary demand and (stochastic) service level constraints. The algorithm efficiently explores the solution space and quickly finds an estimated optimum. The algorithm is intended for personnel planning in small-scale service systems with limited opening hours. The algorithm is also highly competitive for larger-scale settings, when compared to benchmark algorithms from the literature.
personnel planning time-varying arrival process staffing and scheduling capacity analysis optimization