A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F14%3A00218403" target="_blank" >RIV/68407700:21230/14:00218403 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.cor.2014.03.019" target="_blank" >http://dx.doi.org/10.1016/j.cor.2014.03.019</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.cor.2014.03.019" target="_blank" >10.1016/j.cor.2014.03.019</a>
Alternative languages
Result language
angličtina
Original language name
A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand
Original language description
This work deals with the employee rostering problem at the airport. Such problems, related to the time varying demand of the transport services, use many (e.g., about a hundred) diverse shifts to cover the workforce demand during the day. Together with the strict constraints, given by the collective agreement, the problem becomes difficult to solve. Algorithms commonly used for solving the usual employee rostering problems produce poor quality rosters, which are unusable in practice. This paper suggestsa three stage approach allowing one to solve the employee rostering problems where a huge set of different shifts is used to satisfy the coverage requirements. The solution is based on the problem transformation to a simpler problem, thereupon, an evolutionary algorithm is used to determine a rough position of the shifts in the roster. Afterwards, the maximal weighted matching in the bipartite graph is applied as the inverse transformation of the problem and the final roster is obtained
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BB - Applied statistics, operational research
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2014
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Computer & Operations Research
ISSN
0305-0548
e-ISSN
—
Volume of the periodical
49
Issue of the periodical within the volume
September
Country of publishing house
US - UNITED STATES
Number of pages
13
Pages from-to
117-129
UT code for WoS article
000337647700011
EID of the result in the Scopus database
—