Graph coloring based heuristic for crew rostering

In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and...

Full description

Saved in:
Bibliographic Details
Main Authors: Hajdu László
Tóth Attila
Krész Miklós
Format: Article
Published: University of Szeged, Institute of Informatics Szeged 2020
Series:Acta cybernetica 24 No. 4
Kulcsszavak:Problémamegoldás - algoritmus, Heurisztika, Matematikai modell
Subjects:
doi:10.14232/actacyb.281106

Online Access:http://acta.bibl.u-szeged.hu/71763
Description
Summary:In the last years personnel cost became a huge factor in the financial management of many companies and institutions.The firms are obligated to employ their workers in accordance with the law prescribing labour rules. The companies can save costs with minimizing the differences between the real and the expected worktimes. Crew rostering is assigning the workers to the previously determined shifts, which has been widely studied in the literature. In this paper, a mathematical model of the problem is presented and a two-phase graph coloring method for the crew rostering problem is introduced. Our method has been tested on artificially generated and real life input data. The results of the new algorithm have been compared to the solutions of the integer programming model for moderate-sized problems instances.
Physical Description:643-661
ISSN:0324-721X