An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling

DOI10.1007/978-3-642-00142-0_23MaRDI QIDQ5392006zbMATH OpenOpenAlexFDO

Authors Volker Nissen, René Birnstiel

Publication date 7 April 2011

Published in Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00142-0_23

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• scientific article; zbMATH DE number 764426
• Evolutionary algorithms for jobshop scheduling
• scientific article; zbMATH DE number 1178246
• scientific article; zbMATH DE number 1703886
• A synergy exploiting evolutionary approach to complex scheduling problems
• A hybrid evolutionary algorithm for the job shop scheduling problem
• scientific article; zbMATH DE number 1755533

Cited in

(5)

• A branch-and-bound algorithm for shift scheduling with stochastic nonstationary demand
• Bridging the gap between self schedules and feasible schedules in staff scheduling
• A comparison of three heuristics on a practical case of sub-daily staff scheduling
• A novel discrete state transition algorithm for staff assignment problem
• Research on flexible personnel scheduling for single task with delivery date as the goal

This page was built for publication: An Evolutionary Algorithm for Sub-Daily/Sub-Shift Staff Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392006)