A branch and price algorithm for the robust WSOS scheduling problem

• 作者: LI Ruiyang HE Ming HE Hongyue WANG Zhixue YANG Cheng
• 来源期刊: 系统工程与电子技术（英文版）
• 年，卷（期）: 2021,（3）
• 所属期刊栏目: SYSTEMS ENGINEERING
• 页码范围: 658-667
• 页数: 10页
• 语种: 英文
• DOI: 10.23919/JSEE.2021.000056

摘要

To analyze and optimize the weapon system of sys-tems(WSOS)scheduling process,a new method based on ro-bust capabilities for WSOS scheduling optimization is proposed.First,we present an activity network to represent the military mission.The member systems need to be reasonably assigned to perform different activities in the mission.Then we express the problem as a set partitioning formulation with novel columns(activity flows).A heuristic branch-and-price algorithm is de-signed based on the model of the WSOS scheduling problem(WSOSSP).The algorithm uses the shortest resource-con-strained path planning to generate robust activity flows that meet the capability requirements.Finally,we discuss this meth-od in several test cases.The results show that the solution can reduce the makespan of the mission remarkably.