IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v29y1999i5p95-109.html
   My bibliography  Save this article

Course Planning at Lufthansa Technical Training: Constructing More Profitable Schedules

Author

Listed:
  • Knut Haase

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Wilhelm-Seelig-Platz 1, D-24098 Kiel, Germany)

  • Jörg Latteier

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Wilhelm-Seelig-Platz 1, D-24098 Kiel, Germany)

  • Andreas Schirmer

    (Institut für Betriebswirtschaftslehre, Christian-Albrechts-Universität zu Kiel, Wilhelm-Seelig-Platz 1, D-24098 Kiel, Germany and Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität zu Kiel, Hermann-Rodewald-Str. 3, D-24118 Kiel, Germany)

Abstract

Lufthansa Technical Training GmbH (LTT) runs training courses for Lufthansa Technik AG and for several other international airlines. It offers about 670 types of courses of which several hundred take place each year. The course-scheduling problem LTT faces is to develop a schedule for the year that maximizes its profit while meeting complex precedence, temporal, and resource-related constraints. A good operational schedule should also meet a number of subordinate objectives. In the past, LTT did all its scheduling manually. We developed a prototype course-scheduling module, using the operational planning situation of 1996 as our major test instance. It turned out that most of the schedules generated were substantially better than the solution LTT constructed manually, both in terms of profit and computation time. We subsequently developed a fully fledged decision-support system.

Suggested Citation

  • Knut Haase & Jörg Latteier & Andreas Schirmer, 1999. "Course Planning at Lufthansa Technical Training: Constructing More Profitable Schedules," Interfaces, INFORMS, vol. 29(5), pages 95-109, October.
  • Handle: RePEc:inm:orinte:v:29:y:1999:i:5:p:95-109
    DOI: 10.1287/inte.29.5.95
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.29.5.95
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.29.5.95?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
    ---><---

    References listed on IDEAS

    as
    1. Costa, Daniel, 1994. "A tabu search algorithm for computing an operational timetable," European Journal of Operational Research, Elsevier, vol. 76(1), pages 98-110, July.
    2. de Gans, Onno B., 1981. "A computer timetabling system for secondary schools in the Netherlands," European Journal of Operational Research, Elsevier, vol. 7(2), pages 175-182, June.
    3. Kang, Le & White, George M., 1992. "A logic approach to the resolution of constraints in timetabling," European Journal of Operational Research, Elsevier, vol. 61(3), pages 306-317, September.
    4. Cangalovic, Mirjana & Schreuder, Jan A. M., 1991. "Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths," European Journal of Operational Research, Elsevier, vol. 51(2), pages 248-258, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre (Ed.), 2000. "Jahresbericht 1999," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 522, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Kozanidis, George, 2017. "Optimal assignment of aircrew trainees to simulator and classroom training sessions subject to seniority and preference restrictions," Journal of Air Transport Management, Elsevier, vol. 59(C), pages 143-154.
    3. Schirmer, Andreas & Potzahr, Kathrin, 2001. "Lehrgangsplanung für die Ausbildung von Verkehrsflugzeugführern: Ergebnisse einer Studie bei Lufthansa Flight Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 538, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Aslan, Ayse & Ursavas, Evrim & Romeijnders, Ward, 2023. "A Precedence Constrained Knapsack Problem with Uncertain Item Weights for Personalized Learning Systems," Omega, Elsevier, vol. 115(C).
    5. Gang Yu & Julian Pachon & Benjamin Thengvall & Darryal Chandler & Al Wilson, 2004. "Optimizing Pilot Planning and Training for Continental Airlines," Interfaces, INFORMS, vol. 34(4), pages 253-264, August.
    6. M Bazargan-Lari, 2004. "Flexible versus fixed timetabling: a case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 123-131, February.
    7. Schirmer, Andreas & Potzhar, Kathrin, 2001. "Professional course scheduling in airline transport pilot training: A case from Lufthansa flight training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 539, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Schirmer, Andreas & Potzhar, Kathrin, 2001. "Professional course scheduling in airline transport pilot training: A case from Lufthansa flight training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 539, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    2. Haase, Knut & Latteier, Jorg & Schirmer, Andreas, 1998. "The course scheduling problem at Lufthansa Technical Training," European Journal of Operational Research, Elsevier, vol. 110(3), pages 441-456, November.
    3. Haase, Knut & Latteier, Jörg & Schirmer, Andreas, 1997. "The course scheduling problem at Lufthansa Technical Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 441, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Haase, Knut & Latteier, Jörg & Schirmer, Andreas, 1997. "Course planning at Lufthansa technical training: Constructing more profitable schedules," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 442, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    5. Drexl, Andreas & Salewski, Frank, 1997. "Distribution requirements and compactness constraints in school timetabling," European Journal of Operational Research, Elsevier, vol. 102(1), pages 193-214, October.
    6. Schirmer, Andreas & Potzahr, Kathrin, 2001. "Lehrgangsplanung für die Ausbildung von Verkehrsflugzeugführern: Ergebnisse einer Studie bei Lufthansa Flight Training," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 538, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Dimopoulou, M. & Miliotis, P., 2001. "Implementation of a university course and examination timetabling system," European Journal of Operational Research, Elsevier, vol. 130(1), pages 202-213, April.
    8. Hertz, Alain & Robert, Vincent, 1998. "Constructing a course schedule by solving a series of assignment type problems," European Journal of Operational Research, Elsevier, vol. 108(3), pages 585-603, August.
    9. Cangalovic, Mirjana & Kovacevic-Vujcic, Vera & Ivanovic, Lav & Drazic, Milan, 1998. "Modeling and solving a real-life assignment problem at universities," European Journal of Operational Research, Elsevier, vol. 110(2), pages 223-233, October.
    10. Daskalaki, S. & Birbas, T., 2005. "Efficient solutions for a university timetabling problem through integer programming," European Journal of Operational Research, Elsevier, vol. 160(1), pages 106-120, January.
    11. White, George M. & Xie, Bill S. & Zonjic, Stevan, 2004. "Using tabu search with longer-term memory and relaxation to create examination timetables," European Journal of Operational Research, Elsevier, vol. 153(1), pages 80-91, February.
    12. Timothy R. Hinkin & Gary M. Thompson, 2002. "SchedulExpert: Scheduling Courses in the Cornell University School of Hotel Administration," Interfaces, INFORMS, vol. 32(6), pages 45-57, December.
    13. Daskalaki, S. & Birbas, T. & Housos, E., 2004. "An integer programming formulation for a case study in university timetabling," European Journal of Operational Research, Elsevier, vol. 153(1), pages 117-135, February.
    14. Song, Kwonsik & Kim, Sooyoung & Park, Moonseo & Lee, Hyun-Soo, 2017. "Energy efficiency-based course timetabling for university buildings," Energy, Elsevier, vol. 139(C), pages 394-405.
    15. Gerhard Post & Samad Ahmadi & Sophia Daskalaki & Jeffrey Kingston & Jari Kyngas & Cimmo Nurmi & David Ranson, 2012. "An XML format for benchmarks in High School Timetabling," Annals of Operations Research, Springer, vol. 194(1), pages 385-397, April.
    16. Massimiliano Caramia & Stefano Giordani, 2020. "Curriculum-Based Course Timetabling with Student Flow, Soft Constraints, and Smoothing Objectives: an Application to a Real Case Study," SN Operations Research Forum, Springer, vol. 1(2), pages 1-21, June.
    17. P Lara-Velázquez & R López-Bracho & J Ramírez-Rodríguez & J Yáñez, 2011. "A model for timetabling problems with period spread constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 217-222, January.
    18. De Causmaecker, Patrick & Demeester, Peter & Vanden Berghe, Greet, 2009. "A decomposed metaheuristic approach for a real-world university timetabling problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 307-318, May.
    19. Nelishia Pillay, 2014. "A survey of school timetabling research," Annals of Operations Research, Springer, vol. 218(1), pages 261-293, July.
    20. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.

    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:orinte:v:29:y:1999:i:5:p:95-109. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.