A three-phase approach to solving the bidline problem

DOI10.1023/B:ANOR.0000019093.93633.BCMaRDI QIDQ1888188zbMATH OpenFDO

Authors Jeffery D. Weir, Ellis L. Johnson

Publication date 22 November 2004

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

circadian rhythmset partitioningcutting stockInteger programmingaircrew schedulingbidline generation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Integer programming (90C10)

Recommendations

• The operational airline crew scheduling problem
• Airline crew scheduling from planning to operations
• Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
• scientific article; zbMATH DE number 1452999
• Airline Crew Scheduling with Regularity

Cited in

(4)

• A branch-and-price heuristic for the crew pairing problem with language constraints
• Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods
• Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering
• A benders decomposition algorithm for a bid generation problem in the procurement of three-echelon transportation services

This page was built for publication: A three-phase approach to solving the bidline problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1888188)