A subproblem-centric model and approach to the nurse scheduling problem
From MaRDI portal
Publication:1403303
DOI10.1007/s10107-003-0426-2zbMath1035.90029OpenAlexW2040691271MaRDI QIDQ1403303
Publication date: 1 September 2003
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0426-2
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90) Theory of organizations, manpower planning in operations research (90B70)
Related Items
An assessment of a days off decomposition approach to personnel shift scheduling ⋮ Relaxation heuristics for the set multicover problem with generalized upper bound constraints ⋮ First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem ⋮ A note on a single-shift days-off scheduling problem with sequence-dependent labor costs ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ A shift sequence based approach for nurse scheduling and a new benchmark dataset ⋮ Physician Staffing for Emergency Departments with Time-Varying Demand ⋮ The second international nurse rostering competition ⋮ Finding good nurse duty schedules: a case study ⋮ NURSE STAFFING UNDER DEMAND UNCERTAINTY TO REDUCE COSTS AND ENHANCE PATIENT SAFETY ⋮ A Pareto-based search methodology for multi-objective nurse scheduling ⋮ Employee substitutability as a tool to improve the robustness in personnel scheduling ⋮ Shift rostering using decomposition: assign weekend shifts first ⋮ New approaches to nurse rostering benchmark instances ⋮ A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
