Detailed Maintenance Planning for Military Systems with Random Lead Times and Cannibalization

摘要

Detailed maintenance planning under uncertainty is one of the most important topics in military research and practice. As one of the fastest ways to recover failed weapon systems, cannibalization operations are commonly applied by maintenance personnel. Due to the additional complexities introduced by these operations, detailed maintenance and repair decision making with cannibalization was rarely studied in the literature. This paper proposed an analytical model for studying the maintenance planning problem of military systems with random lead times and cannibalization. The objective of the problem is to maximize fleet reliabilities under operating costs constraints. A complementary problem that minimizes total operating costs under fleet reliabilities constraints was also constructed. A polynomial algorithm was proposed to solve the minimization problem and determine optimal decision strategies. This algorithm was also used as a subroutine in a binary-search algorithm to solve the maximization problem.