摘要:

AbstractUsing the theory of Hirsch, Meisner, and Boll, we study the consequences of interchanging parts within a generalized coherent structure. This procedure has been termed “cannibalization.” The theory of cannibalization is extended to the case where each component can operate at several levels of partial performance and a representation theorem is derived, which expresses the state of a system as a function of the number of working parts at each level. The stochastic theory of these systems is then investiga

ISSN:0028-1441    

DOI:10.1002/nav.3800200402

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractThis article addresses the problem of explicitly taking into account uncertainty about the demand for spare parts in making inventory procurement and stockage decisions. The model described provides for a unified treatment of the closely related problems of statistical estimation of demand and resource allocation within the inventory system, and leads to an easily implemented, efficient method of determining requirements for spare parts both in the early provisioning phase and in later periods of operations when demand data have accumulatedAnalyses of the model's theoretical foundations and of sample outcomes of the model based upon data on parts intended for use in the F‐14 lead to conclusions of great importance to both support planners and operations plannersFinally, of particular significance is the ability afforded the planner by this model to quantify the impact on inventory system costs of varying levels of system reliability or management uncertainty as to projected system performance. This will provide an economic basis for analysis of such alternatives as early deployment, operational testing, and equipment redesig

ISSN:0028-1441    

DOI:10.1002/nav.3800200403

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractThis paper considers the problem of the optimal redeployment of a resource among different geographical locations. Initially, it is assumed that at each locationi, i= 1,…,n, the level of availability of the resource is given bya1≧ 0. At timet>0, requirementsRf(t) ≧ 0 are imposed on each location which, in general, will differ from thea1. The resource can be transported from any one location to any other in magnitudes which will depend ontand the distance between these locations. It is assumed that ΣRj>ΣatThe objective function consideis, in addition to transportation costs incurred by reallocation, the degree to which the resource availabilities after redeployment differ from the requirements. We shall associate the unavailabilities at the locations with the unreadiness of the system and discuss the optimal redeployment in terms of the minimization of the following functional forms:\documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_{j = 1}^n {kj(Rj - yj) + } $\end{document}transportation costs, Max\documentclass{article}\pagestyle{empty}\begin{document}$ \mathop {Max}\limits_j \,[kj(Rj - yj)] + $\end{document}transportation costs, and\documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_{j = 1}^n {kj(Rj - yj)^2 + } $\end{document}transportation costs. The variablesyjrepresent the final amount of the resource available at locationj. No benefits are assumed to accrue at any location ifyj>Rj.A numerical three location example is given and solved for the linear ob

ISSN:0028-1441    

DOI:10.1002/nav.3800200404

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractNecessary and sufficient conditions for max‐min problems are given here. In addition to characterization of directional derivatives of the relevant functions, subdifferentiability set for such functions is characterize

ISSN:0028-1441    

DOI:10.1002/nav.3800200405

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractDetailed combat simulations can produce effectiveness tables which measure the effectiveness of each weapon class on one side of an engagement, battle, or campaign to each weapon class on the other. Effectiveness tables may also be constructed in other waysThis paper assumes that effectiveness tables are given and shows how to construct from them a system of weapon weights each of which is a weighted average of the effects of a given weapon against each of the enemy's weapons. These weights utilize the Perron‐ Frobenius theory of eigenvectors of nonnegative matrices. Methods of calculation are discussed and some interpretations are given for both the irreducible and reducible case

ISSN:0028-1441    

DOI:10.1002/nav.3800200406

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractFrequently in warfare, a force is required to attack a perishable enemy target system ‐ a target system where the targets are detected seemingly at random, and if not immediately attacked, will shortly escape from detection. A conflicting situation arises when an attack element detects a target of relatively low value and has to decide whether to expend his resources on that particular target or to wait for a more lucrative one, hoping one will be found. This paper provides a decision rule giving the least valued target that should be attacked as well as the resources that should be expended as a function of the attack element's remaining mission tim

ISSN:0028-1441    

DOI:10.1002/nav.3800200407

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractWe develop the solution to a simple problem of target selection in Lanchester combat against two enemy force types each of which undergoes a “linear‐law” attrition process. In addition to the Pontryagin maximum principle, the theory of singular extremals is required to solve this problem. Our major contribution is to show how to synthesize the optimal target selection policies from the basic optimality conditions. This solution synthesis methodology is applicable to more general dynamic (tactical) allocation problems. For constant attrition‐rate coefficients we show that whether or not changes can occur in target priorities depends solely on how survivors are valued and is independent of the type of attrition

ISSN:0028-1441    

DOI:10.1002/nav.3800200408

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

摘要:

AbstractThe component placement problem is a specialization of the quadratic assignment problem that has been extensively studied for a decade and which is of considerable practical value. Recently, interest in component placement algorithms has risen primarily as a result of increased activity in the field of computer‐aided design automation. This paper deals with the methodology of component placement and is based on the results of considerable operational experience. A tutorial presentation of tree search placement algorithms is provided, and an improved placement procedure is described which is demonstrated to be effective in generating near optimal solutions to the component placement problem. These solutions are completely reproducible and are obtained at an acceptable expenditure of computational resources. An additional objective is an assessment of performance of the class of near optimal algorithms. In particular, the question‐ how close to optimal are the near optimal solutions‐ is exa

ISSN:0028-1441    

DOI:10.1002/nav.3800200409

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800200410

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY

ISSN:0028-1441    

DOI:10.1002/nav.3800200411

出版商:Wiley Subscription Services, Inc., A Wiley Company    

年代:1973

数据来源: WILEY