Comparison and hybridization of crossover operators for the nurse scheduling problem
From MaRDI portal
Publication:940898
DOI10.1007/s10479-007-0268-zzbMath1151.90423MaRDI QIDQ940898
Mario Vanhoucke, Broos Maenhout
Publication date: 3 September 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0268-z
90B35: Deterministic scheduling theory in operations research
90C59: Approximation methods and heuristics in mathematical programming
Related Items
An evolutionary approach for the nurse rerostering problem, On the characterization and generation of nurse scheduling problem instances, Local search neighbourhoods for dealing with a novel nurse rostering model
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for flowshop sequencing
- Nurse rostering problems -- a bibliographic survey.
- Staff scheduling and rostering: a review of applications, methods and models.
- An indirect genetic algorithm for a nurse-scheduling problem
- Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem
- An annotated bibliography of personnel scheduling and rostering
- Hybrid genetic algorithms for bin-packing and related problems
- The state of the art of nurse rostering
- Constructing nurse schedules at large hospitals
- A Polyhedral Approach for the Staff Rostering Problem
- Scheduling Nursing Personnel According to Nursing Preference: A Mathematical Programming Approach
- Improved Implicit Optimal Modeling of the Labor Shift Scheduling Problem
- Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
- Variable neighborhood search: Principles and applications
- A memetic approach to the nurse rostering problem
