Bounded flexibility in days-on and days-off scheduling
From MaRDI portal
Publication:4629207
DOI10.1002/nav.21561zbMath1410.90082OpenAlexW1832051610MaRDI QIDQ4629207
Jens O. Brunner, Jan M. Köhler, Jonathan F. Bard
Publication date: 26 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21561
integer programmingdynamic programmingstaffingbranch and priceresource constrained shortest path problemservice industrydays-on and days-off scheduling
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (8)
Polynomially solvable personnel rostering problems ⋮ A branch-and-price algorithm for stable workforce assignments with hierarchical skills ⋮ A resource type analysis of the integrated project scheduling and personnel staffing problem ⋮ A scenario-based robust optimization with a pessimistic approach for nurse rostering problem ⋮ A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing ⋮ A graph-based formulation for the shift rostering problem ⋮ A decomposed branch-and-price procedure for integrating demand planning in personnel staffing problems ⋮ Designing an annual leave scheduling policy: case of a financial center
This page was built for publication: Bounded flexibility in days-on and days-off scheduling
