A hybrid integer and constraint programming approach to solve nurse rostering problems
From MaRDI portal
Recommendations
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Integer programming techniques for the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A flexible mixed integer programming-based system for real-world nurse rostering
- Integer programming model extensions for a multi-stage nurse rostering problem
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- A constraint programming based column generation approach to nurse rostering problems
Cites work
- A generic two-phase stochastic variable neighborhood approach for effectively solving the nurse rostering problem
- A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A memetic approach to the nurse rostering problem
- A Pareto-based search methodology for multi-objective nurse scheduling
- A shift sequence based approach for nurse scheduling and a new benchmark dataset
- A systematic two phase approach for the nurse rostering problem
- A two-phase adaptive variable neighborhood approach for nurse rostering
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
- Generating effective symmetry-breaking predicates for search problems
- Handbook of constraint programming.
- Integer programming techniques for the nurse rostering problem
- New approaches to nurse rostering benchmark instances
- On the complexity of manpower shift scheduling
- Personnel scheduling: models and complexity
- Staff scheduling and rostering: a review of applications, methods and models.
- The first international nurse rostering competition 2010
- The nurse rostering problem: a critical appraisal of the problem structure
- The state of the art of nurse rostering
Cited in
(16)- The nurse rostering problem: a critical appraisal of the problem structure
- A hybrid model of integer programming and variable neighbourhood search for highly-constrained nurse rostering problems
- Variable neighborhood search accelerated column generation for the nurse rostering problem
- A hybrid integer programming and variable neighbourhood search algorithm to solve nurse rostering problems
- A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem
- A scenario-based robust optimization with a pessimistic approach for nurse rostering problem
- A flexible mixed integer programming-based system for real-world nurse rostering
- Type-2 integrated process-planning and scheduling problem: reformulation and solution algorithms
- A goal programming approach to nurse scheduling with individual preference satisfaction
- An integer programming approach for the physician rostering problem
- Fatigue, personnel scheduling and operations: review and research opportunities
- First-order linear programming in a column generation-based heuristic approach to the nurse rostering problem
- A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem
- A column generation-based algorithm for midterm nurse scheduling with specialized constraints, preference considerations, and overtime
- A constraint programming based column generation approach to nurse rostering problems
- Branching strategies in a branch-and-price approach for a multiple objective nurse scheduling problem
This page was built for publication: A hybrid integer and constraint programming approach to solve nurse rostering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652269)
