A graph coloring approach to airline crew scheduling problem
No Thumbnail Available
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
Maltepe Üniversitesi
Access Rights
CC0 1.0 Universal
info:eu-repo/semantics/openAccess
info:eu-repo/semantics/openAccess
Abstract
The airline crew scheduling problem is well-known as one of the most difficult combinatorial problem. Crew scheduling for airlines requires an optimally scheduled coverage of flights with regard to given timetables. In this paper, in order to construct daily feasible flight sequence for an employee, we proposed an approach with graph coloring. Same colors determine daily feasible schedule which can be task with same crew. After daily composition of pairings with graph coloring approach, we modeled problem as crew assignment problem. So, we assembled pairings into monthly work schedules and assigned to individual crew member. While solving this problem, we used some data which belongs to a domestic airline company called Izair.
Description
Keywords
Journal or Series
International Conference of Mathematical Sciences
WoS Q Value
Scopus Q Value
Volume
Issue
Citation
Dündar, P., Tunçel, H. ve Kılınççeker, O. (2009). A graph coloring approach to airline crew scheduling problem. Maltepe Üniversitesi. s. 328.
