A comparison of three heuristics on a practical case of sub-daily staff scheduling

DOI10.1007/s10479-012-1259-2zbMath1301.90035OpenAlexW2031056506MaRDI QIDQ475194

Maik Günther, Volker Nissen

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.db-thueringen.de/servlets/MCRFileNodeServlet/dbt_derivate_00024561/ilm1-2011200594.pdf

zbMATH Keywords

metaheuristicspersonnel planningartificial agentssub-daily scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Integrated truck and workforce scheduling to accelerate the unloading of trucks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modeling staff scheduling problems. A tutorial
• Recent approaches to global optimization problems through particle Swarm optimization
• Modelling and solving employee timetabling problems
• Evolution strategies. A comprehensive introduction
• An annotated bibliography of personnel scheduling and rostering
• A learning-based optimization approach to multi-project scheduling
• The state of the art of nurse rostering
• On Manpower Scheduling Algorithms