Airline crew scheduling: state-of-the-art
From MaRDI portal
Publication:817210
DOI10.1007/s10479-005-3975-3zbMath1091.90019OpenAlexW2134801710MaRDI QIDQ817210
Ellis L. Johnson, Balaji Gopalakrishnan
Publication date: 7 March 2006
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-005-3975-3
Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
An online optimization-based procedure for the assignment of airplane seats, A two-stage heuristic approach for nurse scheduling problem: a case study in an emergency department, A new heuristic branching scheme for the crew pairing problem with base constraints, Solving a large-scale integrated fleet assignment and crew pairing problem, Deep-learning-based partial pricing in a branch-and-price algorithm for personalized crew rostering, A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals, Integrated airline crew scheduling: a bi-dynamic constraint aggregation method using neighborhoods, Air cargo scheduling: integrated models and solution procedures, Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems, Dynamic constraint aggregation for solving very large-scale airline crew pairing problems, ``You have to get wet to learn how to swim applied to bridging the gap between research into personnel scheduling and its implementation in practice, Network flow-based approaches for integrated aircraft fleeting and routing, Operational aircraft maintenance routing problem with remaining time consideration, A graph partitioning strategy for solving large-scale crew scheduling problems, An efficient Lagrangean heuristic for rental vehicle scheduling, An efficient column generation approach for practical railway crew scheduling with attendance rates, Railway crew scheduling: models, methods and applications, Robust crew pairing for managing extra flights, Improving set partitioning problem solutions by zooming around an improving direction, A branch-and-price heuristic for the crew pairing problem with language constraints, Efficient computer experiment-based optimization through variable selection, Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem, A multi-objective approach for robust airline scheduling, An iterative approach to robust and integrated aircraft routing and crew scheduling, Logical processing for integer programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the 0,1 facets of the set covering polytope
- Column generation and the airline crew pairing problem
- Introduction to ABACUS -- a branch-and-cut system
- Crew pairing at Air France
- Solving large scale crew scheduling problems
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- A parallel primal-dual simplex algorithm
- Computational experience with parallel mixed integer programming in a distributed environment
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling
- Computational results with a primal-dual subproblem simplex method
- Models and algorithms for integration of vehicle and crew scheduling
- Gomory cuts revisited
- Decomposition Principle for Linear Programs
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Totally-Balanced and Greedy Matrices
- Solving Large-Scale Zero-One Linear Programming Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
- Technical Note—A Note on Zero-One Programming
- Set Partitioning: A survey
- Covering, Packing and Knapsack Problems
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Flight Crew Scheduling
- A global approach to crew-pairing optimization
- Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
- Airline Crew Scheduling with Time Windows and Plane-Count Constraints
- Airline Crew Scheduling with Regularity
- Constructing robust crew schedules with bicriteria optimization
- A Computational Study of Search Strategies for Mixed Integer Programming
- Validation of subgradient optimization
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Deadhead Selection for the Long-Haul Crew Pairing Problem
- On the facial structure of set packing polyhedra
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- The traveling-salesman problem and minimum spanning trees: Part II
- A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
- Parallel integer optimization for crew scheduling
- Solving large airline crew scheduling problems: Random pairing generation and strong branching
