A branch and price algorithm for the robust WSOS scheduling problem

To analyze and optimize the weapon system of systems (WSOS) scheduling process, a new method based on robust 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 designed based on the model of the WSOS scheduling problem (WSOSSP). The algorithm uses the shortest resource-constrained path planning to generate robust activity flows that meet the capability requirements. Finally, we discuss this method in several test cases. The results show that the solution can reduce the makespan of the mission remarkably.