ISSN:0160-5682    

DOI:10.1057/jors.1971.29

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

摘要:

AbstractThe paper describes a technique which has been applied in practice to predict the movements of the staff of a large undertaking over the next 20 years. The exercise shows the future promotion pattern and the recruitment required to fill the posts which become vacant as a result of promotion or wastage.By feeding in alternative assumptions about the future demand for staff in each department, corresponding to different levels of business activity, it is possible to see in advance which situations are likely to give rise to the greatest staff problems.It is thought that the same basic technique could be used for manpower planning in other firms.

ISSN:0160-5682    

DOI:10.1057/jors.1971.30

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

摘要:

AbstractThis paper attempts to give an integrated presentation of the application of micro-simulation to the study of markets, based on the purchase behaviour of individual consumers. We emphasize the methodological considerations which should govern the use of the approach, and in particular the need for evolutionary model-building; the technical problems which are only rarely specified in the literature; and the need to be eclectic in the selection of sub-model formulations. Case-studies are reported, and information is given on the scale of resources required for such projects. The presentation is backed with full references to relevant published work, to provide a practical aid to workers in the field. Much of the discussion is also relevant to the simulation of social systems other than markets.

ISSN:0160-5682    

DOI:10.1057/jors.1971.31

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

摘要:

AbstractThe location of a number of service centres on a network (graph) in such a way so that every node (demand point) lies within a critical distance of at least one of the centres appears often in problems involving emergency services. When the numberpof centres is fixed and what is required is their location so that this critical distance is the smallest possible, the resulting location is called "the absolutep-centre of the graph". This paper presents an iterative algorithm for finding absolutep-centres in general (weighted or unweighted) graphs. The algorithm is shown to be computationally efficient for quite large graphs. Results (computing times and numbers of iterations) are given for 15 test graphs varying in size from 10 to 50 nodes and from 20 to 120 links.

ISSN:0160-5682    

DOI:10.1057/jors.1971.32

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

摘要:

AbstractThis paper describes a procedure for generating estimates of the minimum travel times (shortest distances, least cost routes) between pairs of points on a standard map. The procedure exhibits substantial improvements in accuracy over the traditional generation methods involving simple orthogonal and vector-directed distance metrics. These improvements are achieved by combining the traditional methods with algorithms which find shortest routes in networks. The new procedure is particularly appropriate to the analysis of transportation or distribution systems which entail "multiple-mode travel", e.g. surface road vs. expressway travel, or railway vs. air travel. The advantages of the procedure are illustrated with empirical evidence from a simulation study of travel times in a large urban area. Finally, the generality of this procedure to a wide class of problems is discussed.

ISSN:0160-5682    

DOI:10.1057/jors.1971.33

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

摘要:

AbstractThis paper is concerned with the development of a precedence graph algorithm for solving certain combinatorial problems. This algorithm is applied mainly to job-shop scheduling problems; however, the extension of its applicability can be demonstrated by considering project scheduling, travelling salesman and explosion problems. The algorithm employs linear graphs to construct the quantified precedence matrix, a powerful criterion to resolve the conflict between the tied operations, and the use of a quasi-Boolean procedure to evaluate the obtained sequence.Considerable experimentation is conducted to evaluate the performance of the algorithm. Significant results pertaining to the quality of solution, the computation time and the number of iterations and conflicts encountered in obtaining a solution are given.

ISSN:0160-5682    

DOI:10.1057/jors.1971.34

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1971.35

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1971.36

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1971.37

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1971.38

出版商:Taylor&Francis    

年代:1971

数据来源: Taylor