ISSN:0028-1441    

DOI:10.1002/nav.3800140302

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

年代:1967

数据来源: WILEY

摘要:

AbstractMathematical models of tactical problems in Hntisubmarine Warfare (ASW) are developed. Specifically, a game of pursuit between a hunter‐killer force. player 1, and a possible submarine, player 2 is considered. The game consists of a sequence of moves and terminates when player 2 is tcaught or evades player 1. When the players move they observe the actual tactical configuration of the forces (state) and each player choosa‐s a tactical plan from a finite collection. This joint choice of tactical plans determines an immediate payoff and a transition probability distribution over the states. Hence an expected payoff function is defined, Formally this game is a Terminating Stochastic Game (TSG). Shapley demonstrated the existence of a value and optimal strategies (solution), An iterative technique to approximate the solution to within desired accuracy is proposed. Each iteration of the technique is obtained by solving a set of linear programs. To introduce more realism into the game several variations of the TSG are also considered. One variation is a finite TSG and linear programming techniques are employed to find the solut

ISSN:0028-1441    

DOI:10.1002/nav.3800140303

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

年代:1967

数据来源: WILEY

摘要:

AbstractA special matching problem arising in industry is shown to be solvable by an algorithm of the form: match objects aiand bjif they satisfy a local optirnality criterion based on a ranking of currently unmatched objects. When no aiand biremain that can be matched, the largest number of acceptable matches has been found.

ISSN:0028-1441    

DOI:10.1002/nav.3800140304

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

年代:1967

数据来源: WILEY

摘要:

AbstractSeveral problems in the assignment of parallel redundant components to systems composed of elements subject to failure are considered. In each case the problem is to make an assignment which maximizes the system reliability subject to system constraints. Three distinct problems; are treated. The first is the classical problem of maximizing system reliability under total cost or weight constraints when components are subject to a single type of failure. The second problem deals with components which are subject to two types of failure and minimizes the probability of one mode of system failure subject to a constraint on the probability of the other mode of system failure. The third problem deals with components which may either fail to operate or may operate prematurely. System reliability is maximized subject to a constraint ori system safety.In each case the problem is formulated as an integer linear program. This has an advantage over alternative dynamic programming formulations in that standard algorithms may be employed to obtain numerical results.

ISSN:0028-1441    

DOI:10.1002/nav.3800140305

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

年代:1967

数据来源: WILEY

摘要:

AbstractA sequential decision problem is considered in which N particles have to cross a given field. Two alternative crossing paths are available. An unknown number of absorption points J1and J2are planted at each of the crossing paths. The bivariate prior distribution of (J1,J2) is given. If a particle passes close to an absorption point it may survive with probability s, 0

ISSN:0028-1441    

DOI:10.1002/nav.3800140306

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

年代:1967

数据来源: WILEY

摘要:

AbstractCurrently, both the hardware and software designs of many large computing systems aim at improved system performance through exploitation of parallelism in multiprocessor systems. In studying these systems, mathematical modelling and analysis constitute an important step towards providing design tools that can be used in building such systems. With this view the present paper describes a queueing model of a multiprocessor system operating in a job‐shop environment in which arriving jobs consist of a random number of segments (sub‐jobs). Two service disciplines are considered: one assumes that the sub‐jobs of a given job are capable of parallel operation on different processors while the other assumes that the same sub‐jobs must be operated in a strictly serial sequ'snce. The results (in particular, the mean number in the system and waiting time in queue) obtained for these two disciplines are shown to be bounds for more general job str

ISSN:0028-1441    

DOI:10.1002/nav.3800140307

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

年代:1967

数据来源: WILEY

摘要:

AbstractThis paper studies the congestion problems of the computer core storage units. The principle of storage request interleaving is briefly discussed as means of increasing thruput. An analytic model is proposed to analyze the core storage system with a two‐way interleaving feature. The model, an approximation to the physical system, is an extension of a queueing model with bulk service considered by Bailey in Ref. [1

ISSN:0028-1441    

DOI:10.1002/nav.3800140308

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

年代:1967

数据来源: WILEY

摘要:

AbstractAn algorithm, based upon dynamic programming, is developed for a class of fixed‐cost cargo loading problems. The problems can be formulated as integer programming problems, but cannot be efficiently solved as such because of computational difficulties. The algorithm developed has proved to be very efficient in an actual operations research study involving over 500 different cargo items, more than 40 possible stops and several types of transportation vehicles. A numerical illustration is provide

ISSN:0028-1441    

DOI:10.1002/nav.3800140309

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

年代:1967

数据来源: WILEY

摘要:

AbstractA reparable inventory system has two distinct inventories within it—the inventory of items ready‐for‐issue and the inventory of carcasses available for repair. A reparable item is usually rebuilt upon failure, but the scrap rate in the repair process is generally positive. Consequently, new items must be procured from time to time to replace those item: which were scrapped. The ready‐for‐issue inventory has two input sources—procurement and repair, This paper develops a deterministic inbentory model for the reparable inventory system, and determines the optimal procurement and repair

ISSN:0028-1441    

DOI:10.1002/nav.3800140310

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

年代:1967

数据来源: WILEY

摘要:

AbstractIt has long been an accepted proposition that base level usage df technical repair items for aircraft is related to program elements. The program element most often cited in this connection is flying hours. Evidence of this relationship on a line item basis, however, has been sparse. This study suggests that although the supposed relation is intuitively plausible, for most line items it cannot be effectively utilized in projecting base level requirements. The basis of this conclusion is an analysis of demand characteristics for technical repair items for a variety of naval aircraft.

ISSN:0028-1441    

DOI:10.1002/nav.3800140311

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

年代:1967

数据来源: WILEY