欢迎访问《兵工学报》官方网站,今天是

兵工学报 ›› 2021, Vol. 42 ›› Issue (9): 2032-2039.doi: 10.3969/j.issn.1000-1093.2021.09.024

• 论文 • 上一篇    下一篇

资源受限条件下车辆维修工序调度优化

汤润之1,2, 班利明2, 钱乐2, 雷争军2, 宋卫星2,3   

  1. (1.陆军工程大学 国防工程学院, 江苏 南京 210007; 2.32272部队, 甘肃 兰州 730000;3.陆军工程大学石家庄校区 装备指挥与管理系, 河北 石家庄 050003)
  • 上线日期:2021-10-20
  • 作者简介:汤润之(1990—),男,工程师,硕士研究生。E-mail:422657839@qq.con
  • 基金资助:
    军队重点研发计划项目(LJ20191C070656)

Optimization of Vehicle Maintenance Process Scheduling under Limited Resources

TANG Runzhi1,2, BAN Liming2, QIAN Le2, LEI Zhengjun2, SONG Weixing2,3   

  1. (1.College of National Defense Engineering,Army Engineering University of PLA,Nanjing 210007,Jiangsu,China;2.Unit 32272 of PLA,Lanzhou 730000,Gansu,China;3.Department of Equipment Command and Management Engineering,Shijiazhuang Campus, Army Engineering University,Shijiazhuang 050003,Hebei,China)
  • Online:2021-10-20

摘要: 车辆装备战时维修时间紧、任务量大、突发情况多,装备维修调度对部队作战效能快速恢复至关重要。现有维修调度方法主要围绕单一约束条件进行工序优化,难以满足实际保障需求。结合实际维修班组编配,提出融合多工种、多人员技术等级要素的多优化目标函数,以单工序工时、总工时、紧前工序、总人力资源为约束条件建立了改进的带精英策略的非支配排序遗传算法。在传统非支配精英策略的基础上加入二元锦标赛选择算子,重新设计符合多目标函数优化的交叉算子,利用二重编码对一次抢占式维修工序调度模式进行测算求解,并以实际维修案例对算法进行仿真验证。结果表明,该算法在满足战时复杂目标优化的条件下,降低了维修时间,实现了优化人力资源调度效能的目的。

关键词: 车辆维修, 资源受限, 一次抢占, 工序调度, 活动列表编码, 多目标, 非支配排序遗传算法

Abstract: The tight schedules, a large number of tasks, and many emergencies will arise for the maintenance of vehicles during wartime. Vehicle maintenance scheduling has an important effect on the recovery of military combat effectiveness. The existing maintenance scheduling methods mainly focus on a single constraint condition for process optimization, which is difficult to meet the actual support requirements. A multi-objective optimization function that integrates multitiple work types and multi-personnel technical level elements is presented according to the size of actual maintenance team, and an improved non-dominated sorting genetic algorithm (NSGA-Ⅱ) based on elitist strategy is established by taking the single process man-hours, total man-hours, immediate predecessor activity, and total human resources as the constraint conditions. In the proposed algorithm, a binary tournament selection operator is added based on the traditional non-dominant elite strategy, and the crossover operator for the multi-objective function optimization is redesigned, and the double coding is used to calculate and solve the preemptive maintenance process scheduling mode. The simulation verification with actual maintenance cases shows that the proposed method is used to reduce the maintenance time and achieves the goal of optimizing the efficiency of human resource scheduling under the conditions of meeting the optimization of complex objectives in wartime.

Key words: vehiclemaintenance, limitedresource, one-timepreemption, processscheduling, activity-list-basedcoding, multi-objective, non-dominatedsortinggeneticalgorithm

中图分类号: