Solving Airline-fleet Scheduling Problems with Mixed-integer Programming

Uwe H. Suhl and Leena M. Suhl

Chapter 7 in Operational Research in Industry, 1999, pp 135-156 from Palgrave Macmillan

Abstract: Abstract This chapter discusses the solution of real-life airline fleet scheduling problems of a large European airline, and aims to minimize the number of aircraft needed to serve a given set of flights. There is certain Nfreedom to schedule the flights expressed as a time window per each flight within which the flight has to depart. This is the strategy of some European carriers, which first fix the number of flights per connection together with the time window and the fleet for each flight according to the expected number of passengers. In a second step they schedule the flights within their given departure time windows. This problem of scheduling the flights and simultaneously generating aircraft rotations will be called the fleet scheduling problem. (For more details on the planning process see Suhl, 1995)

Keywords: Time Window; Schedule Problem; Column Generation; Standing Time; Priority Vector (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:palchp:978-0-230-37292-4_7

Ordering information: This item can be ordered from
http://www.palgrave.com/9780230372924

DOI: 10.1057/9780230372924_7

Access Statistics for this chapter

More chapters in Palgrave Macmillan Books from Palgrave Macmillan
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().