A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand

Popis výsledku v původním jazyce

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

Název v anglickém jazyce

A multistage approach for an employee timetabling problem with a high diversity of shifts as a solution for a strongly varying workforce demand

Popis výsledku anglicky

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

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2014

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Computer & Operations Research

ISSN

0305-0548

e-ISSN

—

Svazek periodika

49

Číslo periodika v rámci svazku

September

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

117-129

Kód UT WoS článku

000337647700011

EID výsledku v databázi Scopus

—