Name:
Publisher version
View Source
Access full-text PDFOpen Access
View Source
Check access options
Check access options
Name:
Conniss_2018_Rostering_air_tra ...
Size:
70.93Kb
Format:
PDF
Description:
Author Accepted Manuscript
Authors
Conniss, RichardAffiliation
University of DerbyIssue Date
2018-06
Metadata
Show full item recordAbstract
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.Citation
Conniss, R. (2018) 'Rostering air traffic controllers.', Electronic Notes in Discrete Mathematics, Vol. 67, DOI: 10.1016/j.endm.2018.05.010Publisher
ElsevierJournal
Electronic Notes in Discrete MathematicsDOI
10.1016/j.endm.2018.05.010Additional Links
https://www.sciencedirect.com/science/article/pii/S1571065318300866Type
ArticleLanguage
enISSN
15710653ae974a485f413a2113503eed53cd6c53
10.1016/j.endm.2018.05.010