论文部分内容阅读
以中国国际航空公司北京-成都航班为例,提出一种航空公司制定机组排班计划的新方法。首先以机组异地停留时间最短为目标,应用匈牙利算法生成“机组航班串”;然后,应用人员排班方法求得保证机组每周连休两日的条件下完成“机组航班串”飞行任务的最少机组数;最后,对这些机组制定具体的排班计划。应用该方法制定的机组排班计划使得航空公司在保证机组每周连休两日的条件下能够以最少的机组完成航班飞行任务,且机组在异地的停留时间最短。
Taking Air China Beijing-Chengdu flight as an example, this paper proposes a new method for airlines to formulate crew scheduling plans. First of all, taking the shortest residence time of the unit as the target, the Hungarian algorithm is used to generate the “Flight Number of the Unit”; then, the flight schedule of the crew is completed under the conditions of two consecutive days a week Of the minimum number of units; Finally, the development of these units specific scheduling plans. The scheduling plan made by this method enables airlines to complete the flight mission with the minimum number of flight crew members on the condition of ensuring the flight duration of two days a week, and the shortest stay time of the flight crew in different places.