Deadhead Selection for the Long-Haul Crew Pairing Problem
From MaRDI portal
Publication:4861363
DOI10.1287/opre.43.3.491zbMath0840.90098OpenAlexW1988859541MaRDI QIDQ4861363
Levent Hatay, Cynthia Barnhart, Ellis L. Johnson
Publication date: 4 July 1996
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.43.3.491
crew availabilitydeadhead selection procedureinternational flightslong-haul crew pairing problemwork rule restrictions
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (12)
Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ An integer programming approach to generating airline crew pairings ⋮ Airline cockpit crew scheduling ⋮ Optimal construction of airline individual crew pairings. ⋮ A branch-and-price heuristic for the crew pairing problem with language constraints ⋮ Crew pairing at Air France ⋮ Optimizing crew rostering with multilicense on high-speed railway lines ⋮ Aircrew schedule generation using repeated matching ⋮ A network model for airline cabin crew scheduling ⋮ The robust crew pairing problem: model and solution methodology ⋮ Airline crew scheduling: state-of-the-art
This page was built for publication: Deadhead Selection for the Long-Haul Crew Pairing Problem
