Cyclic preference scheduling for nurses using branch and price

DOI10.1002/nav.20201zbMath1126.90028OpenAlexW1973275527MaRDI QIDQ5436481

Jonathan F. Bard, Hadi W. Purnomo

Publication date: 16 January 2008

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.20201

zbMATH Keywords

column generationcyclic schedulingbranch and pricenurse schedulingfeasibility heuristics

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (10)

A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering ⋮ Scheduling part-time personnel with availability restrictions and preferences to maximize employee satisfaction ⋮ A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime ⋮ Flexible weekly tour scheduling for postal service workers using a branch and price ⋮ Patient appointment scheduling at hemodialysis centers: an exact branch and price approach ⋮ Operating room planning and surgical case scheduling: a review of literature ⋮ Modelling a nurse shift schedule with multiple preference ranks for shifts and days-off ⋮ NURSE STAFFING UNDER DEMAND UNCERTAINTY TO REDUCE COSTS AND ENHANCE PATIENT SAFETY ⋮ A column generation approach for the integrated shift and task scheduling problem of logistics assistants in hospitals ⋮ Shift rostering using decomposition: assign weekend shifts first

Cites Work

• Unnamed Item
• Optimizing the use of contingent labor when demand is uncertain

This page was built for publication: Cyclic preference scheduling for nurses using branch and price