Graph coloring based heuristic for crew rostering

DOI10.14232/ACTACYB.281106MaRDI QIDQ5855844zbMATH OpenOpenAlexFDO

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

Publication date 20 March 2021

Published in Acta Cybernetica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14232/actacyb.281106

zbMATH Keywords

graph coloringtabu searchcrew rostering

Mathematics Subject Classification ID

Applications of graph theory (05C90) Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Theory of organizations, manpower planning in operations research (90B70)

Recommendations

• A graph-based formulation for the shift rostering problem
• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• A graph colouring model for assigning a heterogeneous workforce to a given schedule
• Modeling and solving the crew rostering problem
• Staff scheduling and rostering: a review of applications, methods and models.

Cited in

(4)

• A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
• Classroom note. Contributions of graphs to staff rostering
• A heuristic procedure for the crew rostering problem
• A graph-based formulation for the shift rostering problem

This page was built for publication: Graph coloring based heuristic for crew rostering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5855844)