Journal article Open Access

Graph Coloring based Heuristic for Crew Rostering

László Hajdu; Attila Tóth; Miklós Krész

Dublin Core Export

<?xml version='1.0' encoding='utf-8'?>
<oai_dc:dc xmlns:dc="" xmlns:oai_dc="" xmlns:xsi="" xsi:schemaLocation="">
  <dc:creator>László Hajdu</dc:creator>
  <dc:creator>Attila Tóth</dc:creator>
  <dc:creator>Miklós Krész</dc:creator>
  <dc:description>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.</dc:description>
  <dc:source>Acta Cybernetica 1-19</dc:source>
  <dc:subject>crew rostering</dc:subject>
  <dc:subject>graph coloring</dc:subject>
  <dc:subject>tabu search</dc:subject>
  <dc:title>Graph Coloring based Heuristic for Crew Rostering</dc:title>
Views 37
Downloads 25
Data volume 8.8 MB
Unique views 34
Unique downloads 22


Cite as