A learning large neighborhood search for the staff rerostering problem
From MaRDI portal
Publication:2170207
DOI10.1007/978-3-031-08011-1_20zbMATH Open1502.90103OpenAlexW4285247237MaRDI QIDQ2170207FDOQ2170207
Fabio F. Oberweger, Günther R. Raidl, Marc Huber, Elina Rönnberg
Publication date: 30 August 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-08011-1_20
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
Learning and adaptive systems in artificial intelligence (68T05) Mixed integer programming (90C11) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local branching
- Staff scheduling and rostering: a review of applications, methods and models.
- Personnel scheduling: a literature review
- A genetic algorithm approach to a nurse rerostering problem
- Solving the problem of rerostering nurse schedules with hard constraints: new multicommodity flow models
- An evolutionary approach for the nurse rerostering problem
- An integer multicommodity flow model applied to the rerostering of nurse schedules
- Solving a bi-objective nurse rerostering problem by using a utopic Pareto genetic heuristic
- The nurse rerostering problem: strategies for reconstructing disrupted schedules
- SeaPearl: a constraint programming solver guided by reinforcement learning
- Distributing battery swapping stations for electric scooters in an urban area
Uses Software
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)
