Level of Repair Analysis and Minimum Cost Homomorphisms of Graphs
Level of Repair Analysis (LORA) is a prescribed procedure for defence logistics support planning. For a complex engineering system containing perhaps thousands of assemblies, sub-assemblies, components, etc. organized into several levels of indenture and with a number of possible repair decisions, LORA seeks to determine an optimal provision of repair and maintenance facilities to minimize overall life-cycle costs. For a LORA problem with two levels of indenture with three possible repair decisions, which is of interest in UK and US military and which we call LORA-BR, Barros (1998) and Barros and Riley (2001) developed certain branch-and-bound heuristics. The surprising result of this paper is that LORA-BR is, in fact, polynomial-time solvable. To obtain this result, we formulate the general LORA problem as an optimization homomorphism problem on bipartite graphs, and reduce a generalization of LORA-BR, LORA-M, to the maximum weight independent set problem on a bipartite graph. We prove that the general LORA problem is NP-hard by using an important result on list homomorphisms of graphs. We introduce the minimum cost graph homomorphism problem and provide partial results. Finally, we show that our result for LORA-BR can be applied to prove that an extension of the maximum weight independent set problem on bipartite graphs is polynomial time solvable.
KeywordsPolynomial Time Bipartite Graph Interval Graph Input Graph Complex Engineering System
Unable to display preview. Download preview PDF.
- 5.Barros, L.L.: Private communications with M. Tso (2001)Google Scholar
- 7.Brightwell, G.: Private communications with G. Gutin (January 2005)Google Scholar
- 9.Crabtree, J.W., Sandel, B.C.: Army level of repair analysis (LORA). Logistics Spectrum, 27–31 (Summer 1989)Google Scholar
- 11.Frahling, G., Faigle, U.: Combinatorial algorithm for weighted stable sets in bipartite graphs. To appear in Discrete Appl. Math.Google Scholar