.png){kind=icon}
返回
The course scheduling problem at Lufthansa Technical Training
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(98)00121-0.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Lufthansa Technical Training GmbH (LTT) performs training courses for Lufthansa Technik AC as well as for several other international airlines. Courses of about 670 different types are offered of which several hundred take place each year. The course scheduling problem faced by LTT is to construct a yearly schedule which maximizes the profit margin incurred while meeting a variety of complex precedence, temporal, and resource-related constraints. A good operational schedule should also meet a number of additional subordinate objectives. We formalize the problem and develop a heuristic scheme along with several priority rules, as well as a local search algorithm to determine well-suited weights for weighted composite rules. The operational planning situation of 1996 served as our major test instance; additional test instances were constructed by modifying this data. Several computational experiments were carried out to evaluate the performance of the algorithms. It turned out that the best so-found schedule is substantially better in terms of the profit margin incurred than the solution manually constructed by LTT. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
professional course scheduling
aviation
education
heuristics
local search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏EXACT COLORING ALGORITHM FOR WEIGHTED GRAPHS APPLIED TO TIMETABLING PROBLEMS WITH LECTURES OF DIFFERENT LENGTHS加权图的精确着色算法应用于不同长度的讲课的时间表问题
OAAI
OAAI分享收藏
查看更多内容