Towards a practical engineering tool for rostering
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1728539 (Why is no real title available?)
- scientific article; zbMATH DE number 67483 (Why is no real title available?)
- scientific article; zbMATH DE number 788044 (Why is no real title available?)
- A comparative study of eight constraint programming languages over the Boolean and finite domains
- A context for constraint satisfaction problem formulation selection
- A graph-based hyper-heuristic for educational timetabling problems
- A memetic approach to the nurse rostering problem
- An annotated bibliography of personnel scheduling and rostering
- An indirect genetic algorithm for a nurse-scheduling problem
- Applying an extended guided local search to the quadratic assignment problem
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Case-based heuristic selection for timetabling problems
- Guided Local Search
- Hyper-Heuristics: An Emerging Direction in Modern Search Technology
- Large scale combinatorial optimization: A methodological viewpoint
- Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies
- Nurse rostering problems -- a bibliographic survey.
- On benchmarking constraint logic programming platforms. Response to Fernández and Hill's ``A comparative study of eight constraint programming languages over the Boolean and finite domains
- Staff scheduling and rostering: a review of applications, methods and models.
- Testing heuristics: We have it all wrong
- The hardest constraint problems: A double phase transition
- The state of the art of nurse rostering
Cited in
(4)
This page was built for publication: Towards a practical engineering tool for rostering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2468743)