The Air Navigators Rostering Problem
Result description
This paper introduces briefly a personnel scheduling problem at The Air Navigation Services of the Czech Republic. This is a highly constrained real problem which was tackled manually. It is similar to the known Nurse Rostering Problem (NRP), but there are some differences which are mentioned inside paper. Our problem is outstanding through additional constraints which were not presented in state of art of the timetabling area yet. After the problem description we propose a basic mathematical model of these new constraint.
Keywords
The result's identifiers
Result code in IS VaVaI
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The Air Navigators Rostering Problem
Original language description
This paper introduces briefly a personnel scheduling problem at The Air Navigation Services of the Czech Republic. This is a highly constrained real problem which was tackled manually. It is similar to the known Nurse Rostering Problem (NRP), but there are some differences which are mentioned inside paper. Our problem is outstanding through additional constraints which were not presented in state of art of the timetabling area yet. After the problem description we propose a basic mathematical model of these new constraint.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Basic information
Result type
O - Miscellaneous
CEP
BB - Applied statistics, operational research
Year of implementation
2009