期刊文献+

延误航班停机坪作业运行控制研究 被引量:7

Study on How To Operate and Control Apron Services When Flights Delayed
下载PDF
导出
摘要 随着航班航次的增加,机场变得越来越繁忙,地面作业操作不当所导致的飞机地面事故日益增加。在介绍航班停机坪作业的基础上,分析了地面作业的特点。在此基础上,根据航班延误时在作业资源充足和不足情况下,研究了航班停机坪作业的一般方法。在资源充足情况下,航班延误的地面作业控制主要采用AOE方法,缩短关键路线的作业时间。而资源不足情况下,除了控制关键路线作业时间外,还要根据排序算法合理分配关键作业的资源,以实现缩短延误时间的目的。 As the frequencies of flights increase,the airport becomes more and more crowded. Apron accidents keep growing as a result of wrong handling. After giving an account of apron services,the paper analyzes the characteristics of the ground operation, Depending on the availability of resources,the paper studies the general practice of flights at the apron. When the resources are enough,the method of AOE can be used to deal with the ground services when the flights delay. The key point is to cut the time of key paths. When the resources are limited,it is necessary, to assign reasonably resources according to permutational algorithm to shorten the delayed time besides controlling the time of key paths.
作者 赵桂红 刘利
出处 《中国民航学院学报》 2006年第4期58-61,共4页 Journal of Civil Aviation University of China
基金 中国民用航空总局科技基金项目
关键词 停机坪作业 航班延误 关键路线 资源分配 apron operating service flight delay key paths resource allocation
  • 相关文献

参考文献3

二级参考文献11

  • 1Gosling G D. Design of an expert system for aircraft gate assignment[J]. Transportation Research A,1990,24(1):59~69.
  • 2Su Y Y,Srihari K. A knowledge-based aircraft-gate assignment advisor[J]. Computers and Industrial Engineering, 1993, 25(2):123~126.
  • 3Babic O, Teodorovic D, Tosic V. Aircraft stand assignment to minimize walking[J]. Journal of Transportation Engineering,1984,110(1):55~66.
  • 4Bihr R A. A conceptual solution to the aircraft gate assignment problem using 0-1 linear programming[J]. Computers and industry Engineering, 1990,19(3):280~284.
  • 5Bolat A.Procedures for providing robust gate assign- ments for arriving aircrafts [J]. European Journal of Operational Research, 2000,120(1):63~80.
  • 6Arkin E M, Silverberg E B. Scheduling jobs with fixed start and end times[J]. Discrete Applied Mathematics, 1987,18:1~8.
  • 7Gupta U I, Lee D T. Leung J Y T. An optimal solution for the channel-assignment problem[J]. IEEE Transactions Computer, 1979, C-28:807~810.
  • 8Fischettim, Martello M S, Toth P. Approximation algorithms for fixed job schedule problems[J]. Operational Research, 1992,40:96~108.
  • 9李文权.[D].成都:西南交通大学,1996.
  • 10唐国春.排序问题的定义、分类和在国内的某些研究进展[J].运筹学杂志,1990,9(2):64-74. 被引量:23

共引文献37

同被引文献36

引证文献7

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部