主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2001, Vol. ›› Issue (3): 43-48.

• 论文 • 上一篇    下一篇

飞行员搭配问题的数学模型初探

叶旭刚   

  1. 中科院科技政策与管理科学研究所, 北京100080
  • 收稿日期:2001-02-21 出版日期:2001-06-28 发布日期:2012-03-06

Initial Exploration of problems in Crews Grouping

YE Xu-gang   

  1. Institute of Policy & Management, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2001-02-21 Online:2001-06-28 Published:2012-03-06

摘要: 给出几种最基本的飞行员搭配问题的数学模型。基于该模型提出问题转换思路,即将所讨论问题转化为已知的已解决问题或易解决问题。

关键词: 搭配, 二部图, 匹配, 单元, 广义匹配

Abstract: Three most elementary types of questions on Crews Grouping are put forward for discussion in this paper.Although rudimentary do they seem,they are gates leading to a series of deeper,harder,and more complex problems.Based on the basic problems explored,a kind of thinking is established in order to reduce the original problems into what have been resolved or what are comparatively easier to resolve

Key words: grouping, bigraph, matching

中图分类号: