From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future

DOI10.1007/978-3-642-02094-0_8zbMath1248.90048OpenAlexW1562383695MaRDI QIDQ3637316

Burkhard Monien, Sven Grothklags, Ulf Lorenz

Publication date: 9 July 2009

Published in: Algorithmics of Large and Complex Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02094-0_8

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (1)

An integrated flight scheduling and fleet assignment problem under uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The *-minimax search procedure for trees containing chance nodes
• Games against nature
• An analysis of alpha-beta pruning
• Some properties of the fleet assignment problem
• Pathology on game trees revisited, and an alternative to minimaxing
• The fleet assignment problem: Solving a large scale integer program
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• Flight String Models for Aircraft Fleeting and Routing
• Advances in the Optimization of Airline Fleet Assignment
• Daily Aircraft Routing and Scheduling
• Swapping Applications in a Daily Airline Fleet Assignment
• Maintenance and Crew Considerations in Fleet Assignment
• A game-theoretic control approach for job shops in the presence of disruptions
• A Stochastic Model of Airline Operations
• Demand Driven Dispatch: A Method for Dynamic Aircraft Capacity Assignment, Models and Algorithms

This page was built for publication: From State-of-the-Art Static Fleet Assignment to Flexible Stochastic Planning of the Future