Hyper-heuristics for personnel scheduling domains

DOI10.1016/J.ARTINT.2024.104172MaRDI QIDQ6592991zbMATH OpenFDO

Authors Lucas Kletzander, Nysret Musliu

Publication date 26 August 2024

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2024.104172

zbMATH Keywords

combinatorial optimizationhyper-heuristicspersonnel scheduling

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70) Combinatorial optimization (90C27)

Recommendations

• Using a large set of low level heuristics in a hyperheuristic approach to personnel scheduling
• Evolutionary Computation in Combinatorial Optimization
• scientific article; zbMATH DE number 1728538
• scientific article; zbMATH DE number 2079883
• A column generation based hyper-heuristic to the bus driver scheduling problem

Cites work

• An iterated multi-stage selection hyper-heuristic
• Efficient generation of rotating workforce schedules
• scientific article; zbMATH DE number 915581 (Why is no real title available?)
• HyFlex: a benchmark framework for cross-domain heuristic search
• Local search for shift design.
• Modelling and solving the minimum shift design problem
• Optimal speedup of Las Vegas algorithms
• Personnel scheduling: a literature review
• Recent advances in selection hyper-heuristics
• Revisiting the self-adaptive large neighborhood search
• Solver independent rotating workforce scheduling
• Staff scheduling and rostering: a review of applications, methods and models.
• The state of the art of nurse rostering
• Workforce planning incorporating skills: state of the art

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)