A learning large neighborhood search for the staff rerostering problem
From MaRDI portal
Publication:2170207
Recommendations
- An evolutionary approach for the nurse rerostering problem
- A novel approach for nurse rerostering based on a parallel algorithm
- A graph-based formulation for the shift rostering problem
- A neutrality-based iterated local search for shift scheduling optimization and interactive reoptimization
- The nurse rerostering problem: strategies for reconstructing disrupted schedules
Cites work
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- A genetic algorithm approach to a nurse rerostering problem
- An evolutionary approach for the nurse rerostering problem
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- Deep learning
- Distributing battery swapping stations for electric scooters in an urban area
- Local branching
- Personnel scheduling: a literature review
- SeaPearl: a constraint programming solver guided by reinforcement learning
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- Staff scheduling and rostering: a review of applications, methods and models.
- The nurse rerostering problem: strategies for reconstructing disrupted schedules
This page was built for publication: A learning large neighborhood search for the staff rerostering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2170207)