Rostering air traffic controllers.

Journal article


Conniss, Richard 2018. Rostering air traffic controllers. Electronic Notes in Discrete Mathematics. https://doi.org/10.1016/j.endm.2018.05.010
AuthorsConniss, Richard
Abstract

Many, if not most, real world scheduling problems fall into the class of NP. Classical, mathematically exact methods when applied to these problems often suffer from scaling issues, that prevent the computation of a solution in reasonable time. Similarly, real world problems can often be characterised by the requirement to dynamically change any prebuilt roster in reaction to unforeseen changes to the resources available, such as short notice staff absence or a change in the requirements of the task to be fulfilled. Metaheuristic methods have been successfully used to make approximations to optimal solutions which are good enough for practical use. In this paper an example of a novel and complex employee scheduling, or rostering, problem will be discussed and a simple metaheuristic method demonstrated to solve the problem.

KeywordsRostering; Scheduling; Heuristics
Year2018
JournalElectronic Notes in Discrete Mathematics
PublisherElsevier
ISSN15710653
Digital Object Identifier (DOI)https://doi.org/10.1016/j.endm.2018.05.010
Web address (URL)http://hdl.handle.net/10545/622763
hdl:10545/622763
Publication datesJun 2018
Publication process dates
Deposited15 Jun 2018, 15:30
ContributorsUniversity of Derby
File
File Access Level
Open
File
Permalink -

https://repository.derby.ac.uk/item/932y2/rostering-air-traffic-controllers

Download files

  • 9
    total views
  • 8
    total downloads
  • 0
    views this month
  • 0
    downloads this month

Export as