Graph coloring based heuristic for crew rostering

Hajdu László and Tóth Attila and Krész Miklós: Graph coloring based heuristic for crew rostering. In: Acta cybernetica, (24) 4. pp. 643-661. (2020)

[thumbnail of cybernetica_024_numb_004_643-661.pdf]
Preview
Cikk, tanulmány, mű
cybernetica_024_numb_004_643-661.pdf

Download (244kB) | Preview

Abstract

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.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2020
Volume: 24
Number: 4
ISSN: 0324-721X
Page Range: pp. 643-661
Publisher: University of Szeged, Institute of Informatics
Place of Publication: Szeged
Related URLs: http://acta.bibl.u-szeged.hu/71734/
DOI: 10.14232/actacyb.281106
Uncontrolled Keywords: Problémamegoldás - algoritmus, Heurisztika, Matematikai modell
Additional Information: Bibliogr.: p. 659-661. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
01. Natural sciences > 01.02. Computer and information sciences > 01.02.01. Computer sciences, information science and bioinformatics
Date Deposited: 2021. Feb. 05. 12:02
Last Modified: 2021. Feb. 05. 12:02
URI: http://acta.bibl.u-szeged.hu/id/eprint/71763

Actions (login required)

View Item View Item