The airline crew
scheduling problems at the planning level are typically solved in two steps: firstly, obtaining crew itineraries/feasible
pairings that partition all flights and the objective is to minimize pairing costs; and secondly, assigning these optimal pairings to individual crew that minimizes crew costs (called crew rostering). Side
constraints that capture safety regulations, i.e. ‘duty time rules, time connections and crew bases limitation (a limit on total; pairings per base)’; are embedded to the standard problem constraints structure in the first stage, whereas additional rule at the rostering stage that capture task coverage is added to the standard problem constraints structure in the second stage. A heuristic algorithm is proposed to solve the airline crew
scheduling with those side constraints.