摘要:

AbstractThis paper describes the development, structure and use of gaming methodology designed to acquire insights in senior executive decision-processes. The procedure, known as‘expert gaming’, allows a single scenario to be presented to different players in a controlled manner in order to both acquire a rich response and compare them between players.The expert-gaming methodology forms part of a broader methodology developed to establish the characteristics of the senior naval-command process. The broad methodology was also implemented in an industrial setting to establish the generality of the process.Expert gaming combines both low-level data-collection techniques and associated analytical methods with high-level, qualitative techniques.The paper includes a survey of recent literature in the field of scientific gaming.

ISSN:0160-5682    

DOI:10.1057/jors.1987.38

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractThis paper reports an application of vehicle-scheduling algorithms in the collection of refuse. The problem differs from classical vehicle-scheduling applications in that the tipping site and the place where the vehicles are garaged are at different locations. Several algorithms are tested in terms of total route mileage and computational loads. An improvement over the manual method of the order of 8% was obtained using average figures for refuse volume over a period of time. The results appear to be more useful in obtaining a good solution when the main problem parameters change rather than in the day-to-day routeing of vehicles.

ISSN:0160-5682    

DOI:10.1057/jors.1987.39

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractIn this article, we present a specialized algorithm to solve the problem of locating new facilities on the surface of the earth. The set of feasible locations is defined by area and maximum-distance constraints, and the earth's surface is approximated by a sphere and a spheroid. Computational experience with an illustrative example is presented.

ISSN:0160-5682    

DOI:10.1057/jors.1987.40

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractInventory costs for a fixed time period have traditionally been determined by allocating total costs per cycle uniformly throughout that cycle as well as any partial cycles. This procedure for cost allocation has led to the solution of numerous inventory problems, most notable of which is the anticipated price-increase model. When comparing two out-of-phase inventory models, if costs are accounted for when they occur over a fixed planning horizon, inventory policies should be changed to reflect the impact of this different cost-allocation procedure. For the anticipated price-increase model, the‘optimal’order quantity as well as the implied savings in inventory costs will be different when cost models are developed based on these different cost-allocation methods. If the objective is to maximize over a fixed planning horizon the actual savings in inventory costs as they occur, the cost models presented here should be used.

ISSN:0160-5682    

DOI:10.1057/jors.1987.41

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractDecision environments involve the need to solve problems with varying degrees of uncertainty as well as multiple, potentially conflicting objectives. Chance constraints consider the uncertainty encountered. Codes incorporating chance constraints into a mathematical programming model are not available on a widespread basis owing to the non-linear form of the chance constraints. Therefore, accurate linear approximations would be useful to analyse this class of problems with efficient linear codes. This paper presents an approximation formula for chance constraints which can be used in either the single- or multiple-objective case. The approximation presented will place a bound on the chance constraint at least as tight as the true non-linear form, thus overachieving the chance constraint at the expense of other constraints or objectives.

ISSN:0160-5682    

DOI:10.1057/jors.1987.42

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractAcceptance of the adaptive-filtering parameter-estimation process has been mixed. Much of the variability between studies may result from the particular learning factor selected and may be further affected by the type of standardization used. The author presents a modification of the Makridakis and Wheelwright adaptive-filtering algorithm. This modified algorithm provides superior performance and simplifies the selection of the learning factor when used with simple autoregressive processes.

ISSN:0160-5682    

DOI:10.1057/jors.1987.43

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractThe application of compromise solutions to discrete multi-objective problems brings about some technical flexibilities, such as the selection of distance function for computing both normalized attribute ratings and distances between two alternatives, and the choice between the ideal and negative-ideal alternatives for implementing the axiom of choice. These flexibilities are undesirable, since the method may yield conflicting preference-alternative rankings, depending on parameter choice. This paper introduces a credibility measurement of distance function and takes a broader concept of the axiom of choice in order to reconcile disagreement among compromise solutions.

ISSN:0160-5682    

DOI:10.1057/jors.1987.44

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractThe traditional method of estimating mean activity-time in PERT analysis, as a weighted average of the pessimistic, most likely and optimistic activity-times, is examined. Based on properties of the beta distribution, it is shown that there are theoretical grounds for using this estimate for a specified range of modal activity times. Finally, a simple refinement of the estimate is suggested when the modal value lies outside this range.

ISSN:0160-5682    

DOI:10.1057/jors.1987.45

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractIn this note, an example of a lost-sales inventory problem is given for the multi-product single supplier systems, where it might be economical to be out of stock for a fraction of time for the infrequently ordered items.

ISSN:0160-5682    

DOI:10.1057/jors.1987.46

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor

摘要:

AbstractAn interactive method for the vehicle routeing problem has been developed, which attempts to refine routes produced by existing methods. Improvements have been found for some of the standard problems, and the new shortest-distance solutions are reported here.

ISSN:0160-5682    

DOI:10.1057/jors.1987.47

出版商:Taylor&Francis    

年代:1987

数据来源: Taylor