IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v46y1998i2p260-271.html
   My bibliography  Save this article

The Aircraft Maintenance Routing Problem

Author

Listed:
  • Ram Gopalan

    (American Express Travel Related Services, New York, New York)

  • Kalyan T. Talluri

    (Universitat Pompeu Fabra, Barcelona, Spain)

Abstract

Federal aviation regulations require that all aircraft undergo maintenance after flying a certain number of hours. To ensure high aircraft utilization, maintenance is done at night, and these regulations translate into requiring aircraft to overnight at a maintenance station every three to four days (depending on the fleet type), and to visit a balance-check station periodically. After the schedule is fleeted, the aircraft are routed to satisfy these maintenance requirements. We give fast and simple polynomial-time algorithms for finding a routing of aircraft in a graph whose routings during the day are fixed, that satisfies both the three-day maintenance as well as the balance-check visit requirements under two different models: a static infinite-horizon model and a dynamic finite-horizon model. We discuss an implementation where we embed the static infinite-horizon model into a three-stage procedure for finding a maintenance routing of aircraft.

Suggested Citation

  • Ram Gopalan & Kalyan T. Talluri, 1998. "The Aircraft Maintenance Routing Problem," Operations Research, INFORMS, vol. 46(2), pages 260-271, April.
  • Handle: RePEc:inm:oropre:v:46:y:1998:i:2:p:260-271
    DOI: 10.1287/opre.46.2.260
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.46.2.260
    Download Restriction: no

    File URL: https://libkey.io/10.1287/opre.46.2.260?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:inm:oropre:v:46:y:1998:i:2:p:260-271. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.