Hdl Handle:
http://hdl.handle.net/10545/622763
Title:
Rostering air traffic controllers.
Authors:
Conniss, 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.
Affiliation:
University of Derby
Citation:
Conniss, R. (2018) 'Rostering air traffic controllers.', Electronic Notes in Discrete Mathematics, Vol. 67, DOI: 10.1016/j.endm.2018.05.010
Publisher:
Elsevier
Journal:
Electronic Notes in Discrete Mathematics
Issue Date:
Jun-2018
URI:
http://hdl.handle.net/10545/622763
DOI:
10.1016/j.endm.2018.05.010
Additional Links:
https://www.sciencedirect.com/science/article/pii/S1571065318300866
Type:
Article
Language:
en
ISSN:
15710653
Sponsors:
N/A
Appears in Collections:
Department of Electronics, Computing & Maths

Full metadata record

DC FieldValue Language
dc.contributor.authorConniss, Richarden
dc.date.accessioned2018-06-15T15:30:59Z-
dc.date.available2018-06-15T15:30:59Z-
dc.date.issued2018-06-
dc.identifier.citationConniss, R. (2018) 'Rostering air traffic controllers.', Electronic Notes in Discrete Mathematics, Vol. 67, DOI: 10.1016/j.endm.2018.05.010en
dc.identifier.issn15710653-
dc.identifier.doi10.1016/j.endm.2018.05.010-
dc.identifier.urihttp://hdl.handle.net/10545/622763-
dc.description.abstractMany, 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.en
dc.description.sponsorshipN/Aen
dc.language.isoenen
dc.publisherElsevieren
dc.relation.urlhttps://www.sciencedirect.com/science/article/pii/S1571065318300866en
dc.subjectRosteringen
dc.subjectSchedulingen
dc.subjectHeuristicsen
dc.titleRostering air traffic controllers.en
dc.typeArticleen
dc.contributor.departmentUniversity of Derbyen
dc.identifier.journalElectronic Notes in Discrete Mathematicsen
All Items in UDORA are protected by copyright, with all rights reserved, unless otherwise indicated.