Crew & Operations

Crew & Operations

1. Crew Scheduling

   • Optimum sequence of flight legs
   • assign flight & cabin crew
   • 1. Crew Pairing
     • anonymous
     • sequence of flights
     • start / end at same base
     • need to meet regulations
     • sit connections
       • 10min to 3h
       • waiting time to change planes
     • Rest times
       • connection between two duty cycles
     • avoid overnights away from base
       • 3x cost
     • try to keep to 1 tail No.
       • avoid deadheading
       • subject to impact of delays / cancellations
     • Crew Pairing Math Model
       • Objective function
         • Minimise costs
         • high crew utilisation
         • min sit times
       • constraints
         • legal pairings
         • Flight cover
         • crews available at base
         • rules & regulations
           • government
           • airline
           • unions
       • Process similar to Route Generator
       • OUTCOME: set of legal route pairings
         • Next: crew rostering
   • 2. Crew Rostering
     • assign individual staff to crew pairings
     • ensure balanced workload
     • Math model to minimise deviation
       • OUTCOME: Crew rosters (excl. reserves)
         • Next: assign individuals

2. Manpower Planning

   • all aspects of airline
     • flying
     • airport
     • admin
     • catering
     • MRO
     • etc.
   • Hiring
   • Training
   • Scheduling
   • Manpower Scheduling Math Model
     • Objective function
       • Minimise cost
       • max efficiency
       • max utilisatiion
     • constraints
       • regulations
       • operations requirement

3. Gate assignments

   • avoid delays from poor Gate assignments
   • especially hubs where gates permanently assigned to airline
   • Gate Assignment Math Model
     • Objective function
       • min delays
       • short distance for PAX
       • short distance for BAGS
     • constraints
       • aircraft size for gate
       • ramp congestion
       • BAG distance x No. of connecting bags
       • PAX distance x No of connecting pax
     • OUTCOME: optimum gate assignment with shortest pax and/or bag connections
       • assign baggage handlers
       • assign gate crews
       • assign handling equipment