IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v27y1993i2p133-150.html
   My bibliography  Save this article

Scheduling flights at hub airports

Author

Listed:
  • Trietsch, Dan

Abstract

In a typical hub airport, incoming flights from many origins feed outgoing flights to equally many destinations. If an incoming flight is late, outgoing flights that are fed by it may also be delayed. Alternatively, aircraft may leave before some feeding flights arrive, thereby incurring high misconnection penalties. By optimizing the scheduled ground time of each plane, we can minimize the expected sum of costs and penalties. In this paper we develop generalized newsboy models for this purpose. In particular, we investigate in detail a pure-waiting model in which no misconnections are allowed and discuss a no-waiting model in which aircraft that are ready to leave never wait for late-feeding flights. The models show that to maximize the system level of service at a given cost, the level of service of individual flights should be allowed to vary. The models can also be applied to similar problems such as express parcel deliveries and ground transportation hubs. The problems we address are nonlinear and highly combinatorial, so for life-size problems it is not practical to solve them to optimality. Therefore, an important part of the paper is devoted to heuristic solutions and the promising numerical experience achieved with them.

Suggested Citation

  • Trietsch, Dan, 1993. "Scheduling flights at hub airports," Transportation Research Part B: Methodological, Elsevier, vol. 27(2), pages 133-150, April.
  • Handle: RePEc:eee:transb:v:27:y:1993:i:2:p:133-150
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0191-2615(93)90004-T
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Morton O’Kelly, 2010. "Routing Traffic at Hub Facilities," Networks and Spatial Economics, Springer, vol. 10(2), pages 173-191, June.
    2. Laslo, Zohar & Golenko-Ginzburg, Dimitri & Keren, Baruch, 2008. "Optimal booking of machines in a virtual job-shop with stochastic processing times to minimize total machine rental and job tardiness costs," International Journal of Production Economics, Elsevier, vol. 111(2), pages 812-821, February.
    3. Baker, Kenneth R. & Trietsch, Dan, 2009. "Safe scheduling: Setting due dates in single-machine problems," European Journal of Operational Research, Elsevier, vol. 196(1), pages 69-77, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:27:y:1993:i:2:p:133-150. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.