IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v25y1979i12p1175-1183.html
   My bibliography  Save this article

Crew Planning at Flying Tiger: A Successful Application of Integer Programming

Author

Listed:
  • Roy E. Marsten

    (University of Arizona)

  • Michael R. Muller

    (The Flying Tiger line, Los Angeles)

  • Christine L. Killion

    (The Flying Tiger line, Los Angeles)

Abstract

This paper presents a successful application of integer programming to the scheduling of flight crews for a cargo airline. The crew planning process is discussed, the role of the set partitioning model is explained, and representative computational experience is reported. The success of this application is shown to rest upon improved problem conceptualization and decomposition rather than on any advances in solution techniques.

Suggested Citation

  • Roy E. Marsten & Michael R. Muller & Christine L. Killion, 1979. "Crew Planning at Flying Tiger: A Successful Application of Integer Programming," Management Science, INFORMS, vol. 25(12), pages 1175-1183, December.
    • Handle: RePEc:inm:ormnsc:v:25:y:1979:i:12:p:1175-1183
    DOI: 10.1287/mnsc.25.12.1175
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.25.12.1175
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.25.12.1175?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
    ---><---

    Citations

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


    Cited by:

    1. Wen, Xin & Sun, Xuting & Sun, Yige & Yue, Xiaohang, 2021. "Airline crew scheduling: Models and algorithms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    2. Joyce W. Yen & John R. Birge, 2006. "A Stochastic Programming Approach to the Airline Crew Scheduling Problem," Transportation Science, INFORMS, vol. 40(1), pages 3-14, February.
    3. Desaulniers, G. & Desrosiers, J. & Dumas, Y. & Marc, S. & Rioux, B. & Solomon, M. M. & Soumis, F., 1997. "Crew pairing at Air France," European Journal of Operational Research, Elsevier, vol. 97(2), pages 245-259, March.
    4. Valls, Vicente & Angeles Perez, M. & Sacramento Quintanilla, M., 1998. "Pre-processing techniques for resource allocation in the heterogeneous case," European Journal of Operational Research, Elsevier, vol. 107(2), pages 470-491, June.
    5. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    6. Wark, Peter & Holt, John & Ronnqvist, Mikael & Ryan, David, 1997. "Aircrew schedule generation using repeated matching," European Journal of Operational Research, Elsevier, vol. 102(1), pages 21-35, October.
    7. Xin Wen & Sai-Ho Chung & Hoi-Lam Ma & Waqar Ahmed Khan, 2024. "Airline crew scheduling with sustainability enhancement by data analytics under circular economy," Annals of Operations Research, Springer, vol. 342(1), pages 959-985, November.
    8. Jenna Toussaint & Shang Wu & Kent D. Messer, 2012. "Maximizing Benefits for Women: A Charitable Donation Allocation Problem," Working Papers 12-12, University of Delaware, Department of Economics.
    9. Jacques Desrosiers & Arielle Lasry & Daniel McInnis & Marius M. Solomon & François Soumis, 2000. "Air Transat Uses ALTITUDE to Manage Its Aircraft Routing, Crew Pairing, and Work Assignment," Interfaces, INFORMS, vol. 30(2), pages 41-53, April.
    10. A. Mingozzi & M. A. Boschetti & S. Ricciardelli & L. Bianco, 1999. "A Set Partitioning Approach to the Crew Scheduling Problem," Operations Research, INFORMS, vol. 47(6), pages 873-888, December.

    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:ormnsc:v:25:y:1979:i:12:p:1175-1183. 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.