Hyper-heuristics for personnel scheduling domains
From MaRDI portal
Publication:6592991
DOI10.1016/J.ARTINT.2024.104172zbMATH Open1547.6871MaRDI QIDQ6592991
Nysret Musliu, Lucas Kletzander
Publication date: 26 August 2024
Published in: Artificial Intelligence (Search for Journal in Brave)
Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Theory of organizations, manpower planning in operations research (90B70)
Cites Work
- Title not available (Why is that?)
- Workforce planning incorporating skills: state of the art
- An iterated multi-stage selection hyper-heuristic
- Optimal speedup of Las Vegas algorithms
- Efficient generation of rotating workforce schedules
- Staff scheduling and rostering: a review of applications, methods and models.
- Local search for shift design.
- Solver independent rotating workforce scheduling
- Revisiting the self-adaptive large neighborhood search
- Recent advances in selection hyper-heuristics
- Personnel scheduling: a literature review
- Modelling and solving the minimum shift design problem
- The state of the art of nurse rostering
- HyFlex: A Benchmark Framework for Cross-Domain Heuristic Search
This page was built for publication: Hyper-heuristics for personnel scheduling domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6592991)
