ISSN:0160-5682    

DOI:10.1057/jors.1963.19

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractThe last 10 years have seen an immense amount of effort, both here and abroad, concentrated on the development of war games that can be used for the study of many of the important problems that arise in military operational research. The first part of this paper describes in general terms the background to such operational problems, their difficulties and complexities, and explains why war gaming is regarded as a particularly appropriate technique in their examination.On this basis, the fundamental conceptual development of a war game representing a land battle is described, and is illustrated by reference to the Army Operational Research Establishment (AORE) War Game. Practical experience with this and other hand-played games allows some of the advantages and disadvantages of this type of war game to be enumerated, and leads naturally to a discussion of computer-assisted games, and of the relationship between games and analytical models of combat. It is concluded that each of these approaches has its own particular advantages, and that it will usually be appropriate to use combinations of them in the study of major problems.

ISSN:0160-5682    

DOI:10.1057/jors.1963.20

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1963.21

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1963.22

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractA definition and history of the statistics of multiple correspondences are given including some existing results. Incomplete one-spread correspondences are defined and the probability of full service for these arrangements is studied.

ISSN:0160-5682    

DOI:10.1057/jors.1963.23

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractThe transportation method of linear programming is extended to a more general class of problem, for which the "stepping-stone method" of Charnes and Cooper fails. The method is applicable to various problems in the optimum scheduling of production and transport.This paper reviews the relevant theory, and then describes an efficient computational method, applicable to computers of moderate capacity. Many features of the transportation method are retained. In particular, the amount of information which must be retained, at each stage of calculation, is much less, for a large problem, than is required for the simplex or revised simplex methods.

ISSN:0160-5682    

DOI:10.1057/jors.1963.24

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractComponents of a system function for a time and then fail. A central problem is to decide whether a strategy of scheduled replacement is preferable to the running of all components until failure. This is considered by comparing some simple strategies for component replacement. Considerations from probability theory and renewal theory are used to obtain expressions for the average cost of replacements per unit time for each strategy. After obtaining some general conditions for one strategy to be preferable to another, a detailed comparison is made when the interfailure times are independent samples from a gamma distribution.

ISSN:0160-5682    

DOI:10.1057/jors.1963.25

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractThere is a class of assignment problems where the cost function depends on the assignment of pairs of variables. A method of finding the optimum solution by a systematic exploration of a limited part of the solution space is presented by means of a numerical example. It is not possible to give a formula for the length of the computation since this will depend on the actual costs of the particular problem being solved.

ISSN:0160-5682    

DOI:10.1057/jors.1963.26

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

摘要:

AbstractWhen articles are made by a sequence of processes, it is often necessary to make discrete batches for each process. These may not be the same size for each stage in the sequence. Two procedures are given for determining the optimum batch sizes, i.e. the batch sizes giving the lowest total for the set-up and investment costs.

ISSN:0160-5682    

DOI:10.1057/jors.1963.27

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1963.28

出版商:Taylor&Francis    

年代:1963

数据来源: Taylor