A Branch and Bound Algorithm for Optimum Allocation of Float Nurses
From MaRDI portal
Publication:4091740
DOI10.1287/mnsc.22.9.972zbMath0326.90069OpenAlexW2089235378MaRDI QIDQ4091740
D. Michael Warner, Vandankumar M. Trivedi
Publication date: 1976
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.22.9.972
Related Items (8)
A bicriterion algorithm for the allocation of cross-trained workers based on operational and human resource objectives ⋮ The impact of reserve duties on the robustness of a personnel shift roster: an empirical investigation ⋮ Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem ⋮ Employee substitutability as a tool to improve the robustness in personnel scheduling ⋮ Performance measurement criteria in health care organizations: Review and future research directions ⋮ On the characterization and generation of nurse scheduling problem instances ⋮ Development and evaluation of an assignment heuristic for allocating cross-trained workers ⋮ Hospital capacity management decisions: Emphasis on cost control and quality enhancement
This page was built for publication: A Branch and Bound Algorithm for Optimum Allocation of Float Nurses
