A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
The airline crew scheduling problem is a combinatorial optimization problem and belongs to the class of NPhard problems. An effective method for solving the airline crew scheduling problem can reduce the crew costs and improve crew satisfaction. Because of its complexity, the problem is divided into two subproblems: the crew pairing problem and the crew rostering problem. In this paper, the crew rostering problem is focused on and the objective is to generate a fairness timetable in which thedoi:10.2306/scienceasia1513-1874.2014.40.456 fatcat:py5z66633bdzhj6deudi2xulmq