A Branch and Bound Algorithm for Optimum Allocation of Float Nurses

DOI10.1287/MNSC.22.9.972MaRDI QIDQ4091740zbMATH OpenOpenAlexFDO

Authors Vandankumar M. Trivedi, D. Michael Warner

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

Mathematics Subject Classification ID

Integer programming (90C10) Applications of mathematical programming (90C90)

Cited in

(8)

• On the characterization and generation of nurse scheduling problem instances
• Performance measurement criteria in health care organizations: Review and future research directions
• Development and evaluation of an assignment heuristic for allocating cross-trained workers
• Hospital capacity management decisions: Emphasis on cost control and quality enhancement
• Employee substitutability as a tool to improve the robustness in personnel scheduling
• 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

This page was built for publication: A Branch and Bound Algorithm for Optimum Allocation of Float Nurses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091740)