基于可用度的机群维修作业调度  

Availability-constrained Maintenance Scheduling for Military Aircraft Fleet

作　　者：李军亮[1] 滕克难[1] 夏菲[2] 孙媛[1] 

机构地区：[1]海军航空工程学院,山东烟台264001 [2]国网辽阳供电公司信息通信分公司,辽宁辽阳111000

出　　处：《数学的实践与认识》2017年第22期154-163,共10页Mathematics in Practice and Theory

基　　金：国防预研基金资助项目(9140A27020212JB14311);全军军事类研究生资助课题(2015JY397)

摘　　要：针对面向多波次飞行任务的机群维修作业调度问题,以装备保障人员、保障时间为主要约束,以非机组保障方式为主要保障方式,以机群最大可用度为目标,用网络流结构模式表述机群处于飞行、停机和修理的流程,建立了机群维修作业的混合整数规划模型,采用分支界定法求解,通过实例分析验证,所建模型和方法可以有效的实现机群维修作业的调度,以满意的人员配置方案满足任务的可用度要求.The paper research on the problem of multi-wave flight mission oriented fleet maintenance job scheduling,a mixed-integer mathematical programming model was established in which the network flow structure is used to simulate the flow of aircraft between missions,hanger and repair shop.The objective of the model is to schedule the jobs in such a way that sufficient number of aircrafts is available for each flight wave,and considering maintenance staff and work time as main constraint,as well as the main maintenance mode is not unit support mode as usual.The proposed model is solved using the classical Branch-and-Bound method and its performance is verified and analyzed in terms of two test problems adopted from the real data.The results empirically supported practical utility of the proposed model.

关 键 词：机群 维修 调度 混合整数规划 网络工作流 

分 类 号：V267[航空宇航科学与技术—航空宇航制造工程]