Course Planning at Lufthansa Technical Training: Constructing More Profitable Schedules

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.

[1]  Mirjana Cangalovic,et al.  Modelling and solving an acyclic multi-period timetabling problem , 1992, Discret. Appl. Math..

[2]  Mirjana Cangalovic,et al.  Exact colouring algorithm for weighted graphs applied to timetabling problems with lectures of different lengths , 1991 .

[3]  William G. Sullivan,et al.  The use of multimedia support materials in engineering education , 1995 .

[4]  Mark Guzdial,et al.  Students as multimedia composers , 1994 .

[5]  R. Alvarez-Valdes,et al.  Constructing Good Solutions for the Spanish School Timetabling Problem , 1996 .

[6]  Pierre Ndilikilikesha,et al.  Potential influence diagrams , 1994, Int. J. Approx. Reason..

[7]  D. Costa,et al.  A tabu search algorithm for computing an operational timetable , 1994 .

[8]  Jacques A. Ferland,et al.  A large scale timetabling problem , 1989, Comput. Oper. Res..

[9]  Arthur M. Geoffrion,et al.  An Introduction to Structured Modeling , 1987 .

[10]  Onno B. de Gans,et al.  A computer timetabling system for secondary schools in the Netherlands , 1981 .

[11]  A. Tripathy School Timetabling---A Case in Large Binary Integer Linear Programming , 1984 .

[12]  Alain Hertz,et al.  Finding a feasible course schedule using Tabu search , 1992, Discret. Appl. Math..

[13]  Knut Haase,et al.  The course scheduling problem at Lufthansa Technical Training , 1998, Eur. J. Oper. Res..

[14]  Colin Eden,et al.  Cognitive mapping and problem structuring for system dynamics model building , 1994 .

[15]  Richard W. Eglese,et al.  Conference Seminar Timetabling , 1987 .

[16]  Giampiero E. G. Beroggi Decision Modeling in Policy Management , 1999 .

[17]  Dennis M. Buede,et al.  Convergence in problem solving: a prelude to quantitative analysis , 1993, IEEE Trans. Syst. Man Cybern..

[18]  Elliott N. Weiss,et al.  Class Scheduling to Maximize Participant Satisfaction , 1995 .

[19]  Ross D. Shachter Evaluating Influence Diagrams , 1986, Oper. Res..

[20]  David Abramson,et al.  Constructing school timetables using simulated annealing: sequential and parallel algorithms , 1991 .

[21]  George M. White,et al.  A logic approach to the resolution of constraints in timetabling , 1992 .