Aircrew schedule generation using repeated matching

DOI10.1016/S0377-2217(96)00225-1zbMath0948.90058OpenAlexW2030039033MaRDI QIDQ1291572

K. Appert

Publication date: 21 November 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(96)00225-1

zbMATH Keywords

matchingcrew schedulingheuristicoptimisationsupplementary crew

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Matching models (91B68)

Related Items (3)

\textsc{Laps}\ \textsc{Care} -- an operational system for staff planning of home care ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ A repeated matching heuristic for the single-source capacitated facility location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Network models for vehicle and crew scheduling
• On the use of optimal fractional matchings for solving the (integer) matching problem
• A new approach for crew pairing problems by column generation with an application to air transportation
• On the integer properties of scheduling set partitioning models
• A new heuristic for the fleet size and mix vehicle routing problem
• A Column Generation Approach to the Urban Transit Crew Scheduling Problem
• A shortest augmenting path method for solving minimal perfect matching problems
• Solving Airline Crew Scheduling Problems by Branch-and-Cut
• Flight Crew Scheduling
• A Repeated Matching Heuristic for the Vehicle Routeing Problem
• The Column Generation Principle And The Airline Crew Scheduling Problem
• A Successive Shortest Path Algorithm for The Assignment Problem
• Deadhead Selection for the Long-Haul Crew Pairing Problem

This page was built for publication: Aircrew schedule generation using repeated matching