The following pages link to (Q4472481):
Displaying 16 items.
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- A two-phase adaptive variable neighborhood approach for nurse rostering (Q337577) (← links)
- A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand (Q342022) (← links)
- Complexity results for the basic residency scheduling problem (Q398919) (← links)
- A heuristic algorithm based on multi-assignment procedures for nurse scheduling (Q475190) (← links)
- The first international nurse rostering competition 2010 (Q475197) (← links)
- Comparison and hybridization of crossover operators for the nurse scheduling problem (Q940898) (← links)
- Finding good nurse duty schedules: a case study (Q954255) (← links)
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem (Q969750) (← links)
- On the characterization and generation of nurse scheduling problem instances (Q1027526) (← links)
- Simulated annealing approach to nurse rostering benchmark and real-world instances (Q1730622) (← links)
- Solving shift scheduling problem with days-off preference for power station workers using binary integer goal programming model (Q1730633) (← links)
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems (Q1751653) (← links)
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem (Q2025104) (← links)
- Scheduling Security Personnel for the Vancouver 2010 Winter Olympic Games (Q6102733) (← links)
- On the complexity of nurse rostering problems (Q6556163) (← links)
