CONTRIBUTION TO CREW ROSTERING IN AIR TRANSPORT

Air transport offers a broad spectrum of problems that can be successfully solved by using mathematical programming methods. We can mention for example flight schedule planning, assigning airplanes or crew members to individual flights. Matching the crew members can bring many real constraints such as different experience, training skills, language skills or more specific constraints resulting in the fact that some pilots can be assigned to the same flight or not. The article is focused on solving the problem of crew rostering based on graph theory and linear programming