Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem

2009 ◽  
Vol 13 (1) ◽  
pp. 77-93 ◽  
Author(s):  
Broos Maenhout ◽  
Mario Vanhoucke
2019 ◽  
Vol 12 (3) ◽  
pp. 417-450 ◽  
Author(s):  
Antoine Legrain ◽  
Jérémy Omer ◽  
Samuel Rosat

2013 ◽  
Vol 8 (5) ◽  
pp. 1721-1734 ◽  
Author(s):  
Carlos Montoya ◽  
Odile Bellenguez-Morineau ◽  
Eric Pinson ◽  
David Rivreau

Author(s):  
Junya Inafune ◽  
◽  
Shinya Watanabe ◽  
Masayoshi Okudera

This paper presents a new approach combining Branch and Price (B&P) with metaheuristics to derive various high-quality schedules as solutions to a nurse scheduling problem (nurse rostering problem). There are two main features of our approach. The first is the combination of B&P and metaheuristics, and the second is the implementation of an efficient B&P algorithm. Through applying our approach to widely used benchmark instances, the effectiveness of our approach is determined.


Sign in / Sign up

Export Citation Format

Share Document