Crew pairing

This article or the following section is not adequately provided with supporting documents ( e.g. individual evidence ). Information without sufficient evidence could be removed soon. Please help Wikipedia by researching the information and including good evidence.

The problem of crew pairing (CPP) is a combinatorial optimization problem of operations research and theoretical computer science . The task consists - as the first phase of the crew scheduling - of creating cost-effective flight sequences (pairing) that can each be managed by one crew on, if possible, one working day. In doing so, collective bargaining and statutory restrictions must be observed. In the subsequent phase, crew rostering, a crew is assigned to each pairing .

Since the personnel costs of the flight personnel make up the second largest share of the total costs of airlines after the kerosene costs, there is great savings potential with crew pairing. Solution methods are therefore intensively researched in the area of optimization . In terms of complexity theory , however, the CPP belongs to the class of NP-equivalent problems, since the complexity increases sharply as the flight plan becomes larger.