scholarly journals A rotation-based branch-and-price approach for the nurse scheduling problem

2019 ◽  
Vol 12 (3) ◽  
pp. 417-450 ◽  
Author(s):  
Antoine Legrain ◽  
Jérémy Omer ◽  
Samuel Rosat
Keyword(s):  
Scheduling Problem ◽  
Branch And Price ◽  
Nurse Scheduling ◽  
Price Approach

Branch-and-price approach for the multi-skill project scheduling problem

2013 ◽  
Vol 8 (5) ◽  
pp. 1721-1734 ◽  
Author(s):  
Carlos Montoya ◽  
Odile Bellenguez-Morineau ◽  
Eric Pinson ◽  
David Rivreau
Keyword(s):  
Project Scheduling ◽  
Scheduling Problem ◽  
Branch And Price ◽  
Project Scheduling Problem ◽  
Price Approach

scholarly journals New Approach Combining Branch and Price with Metaheuristics to Solve Nurse Scheduling Problem

2017 ◽  
Vol 21 (7) ◽  
pp. 1251-1261 ◽  
Author(s):  
Junya Inafune ◽  
◽  
Shinya Watanabe ◽  
Masayoshi Okudera
Keyword(s):  
Scheduling Problem ◽  
Nurse Rostering ◽  
Branch And Price ◽  
Nurse Scheduling ◽  
High Quality ◽  
New Approach ◽  
Nurse Rostering Problem ◽  
Benchmark Instances

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