The effective rostering of Air Traffic Controllers is a complex and under researched area of the personnel scheduling literature. An effective method to produce real world rosters for controllers requires the ability to model shifts, breaks, multiple tasks and their associated qualifications, to rotate staff through all the tasks for which they are qualified to maintain skill levels, the requirement to train staff whilst continuing normal operations and an ability to reroster in the event of unexpected events. Examples in the literature that examine some of these components include shift scheduling [5], break planning [2] [6] and multi skilled staff [4] [3]. We shall present an algorithm that can effectively model many of the features of the ATC rostering problem, and produce useful real world rosters for operational use.
[1]
Nysret Musliu,et al.
An Improved Memetic Algorithm for Break Scheduling
,
2010,
Hybrid Metaheuristics.
[2]
Haitao Li,et al.
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP benders decomposition algorithm
,
2009,
J. Sched..
[3]
Louis-Martin Rousseau,et al.
A large neighbourhood search approach to the multi-activity shift scheduling problem
,
2010,
J. Heuristics.
[4]
Nysret Musliu,et al.
A Hybrid LS-CP Solver for the Shifts and Breaks Design Problem
,
2010,
Hybrid Metaheuristics.
[5]
Jean-François Cordeau,et al.
Implicit shift scheduling with multiple breaks and work stretch duration restrictions
,
2005,
J. Sched..