摘要:

AbstractIn this annual Blackett Lecture the experience of pursuing the challenge of rational planning and decision-making in London Transport is discussed. Secondly, some of the major challenges affecting all large business organizations in the 1990s are described. Thirdly, the characteristics which enable organizations to respond effectively to these challenges, and which help ensure their survival and success, are delineated.

ISSN:0160-5682    

DOI:10.1057/jors.1991.20

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractIn this paper, the problem of optimally locating the numbers around a dartboard is investigated. The objective considered is risk maximization. Under different assumptions, the problem can be formulated as a travelling salesman problem, as a quadratic assignment problem, or as a more general assignment problem without subtours. Various dartboard designs are proposed and compared with the current one.

ISSN:0160-5682    

DOI:10.1057/jors.1991.21

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractThis paper presents a class of models obtained from the logistic curve to forecast stocks of goods. The dynamic approach allows variation of the parameters with time, thus allowing the model to adapt for changes. The observations are kept at the original scale and the model is reformulated in terms of the parameters. On-line estimates, forecasts and measures of performance are obtained. The methodology is applied to the stock of tractors in Spain. Fitted figures are obtained and compared with those from previous work.

ISSN:0160-5682    

DOI:10.1057/jors.1991.22

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractMulti-level programming is characterized as mathematical programming to solve decentralized planning problems. The decision variables are partitioned among ordered levels. A decision-maker at one level of the hierarchy may have his own objective function and decision space, but may be influenced by other levels.During the last 10 years, a special case of the multi-level programming problem, the linear bi-level programming (BLP) problem, has been studied with increasing interest in the area of mathematical programming problems. This paper attempts to review the literature on the linear BLP problems. It presents the basic models and the characterizations of the problem, the areas for application, the existing solution approaches, and the related models and areas for further research.

ISSN:0160-5682    

DOI:10.1057/jors.1991.23

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractManagement must decide whether or not to conduct an operational research study of any vehicle-routeing problems facing the organization. A key component of such a decision is the benefit that will result, e.g. shorter and faster routes, fewer vehicles and lower costs. This paper uses the results of previously published vehicle-routeing studies to forecast the benefits arising from such an operational research investigation. Since previous studies differ in a number of ways, multiple regression analysis is used to identify those factors associated with differences in the, easily quantified, benefits. It is found that, as problem complexity increases, the improvement of the operational research solution over the previous manual solution increases. Depending on the type of routeing problem and the unit of measurement, for an average-sized problem the ex-ante benefits range from 7% to 37%.

ISSN:0160-5682    

DOI:10.1057/jors.1991.24

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractThe paper examines the capacitated warehouse location problem where fixed costs, generally relating to the installation of warehouses and variable costs, consisting mainly of transportation costs, are minimized. The minimization of each kind of cost drives the solution towards opposite directions with respect to the number of warehouses to be opened/closed. Therefore, dominance criteria between fixed and variable costs are examined. This leads to exact tests as well as greedy heuristics, the latter known in the literature as ADD/DROP techniques.

ISSN:0160-5682    

DOI:10.1057/jors.1991.25

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractAnalyses of historical tendering data for a company selling concrete farm buildings have called into question the usual assumption of normality or lognormality for the probability distribution. The desirability of modelling individual competitors' strategies is reinforced. Complex problems of parameter estimation and testing have been overcome by adopting a likelihood approach, with values examined for plausibility.

ISSN:0160-5682    

DOI:10.1057/jors.1991.26

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractThe economic ordering policies for multiple regional wholesalers and the production lot-sizing policy for a single manufacturer have been studied in a joint analysis under the assumption that the yearly demands of each region are functions of their respective retail proces. We obtained optimum EOQs for both linear and constant price elasticity demand functions. Although normally the wholesalers would order in quantities equal to their EOQs, they are encouraged to purchase in different quantities by the producer providing compensation to offset the wholesalers' increased costs. The production lot-size is determined to minimize the overall production cost.

ISSN:0160-5682    

DOI:10.1057/jors.1991.27

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractThis paper deals with the problem of determining the economic operating policy for inventory items which are manufactured jointly but packaged individually. The proposed new approach is very simple and efficient. An extensive simulation study is presented so that the results of several heuristics (based on a wide range of data, measuring the number of optimal solutions, average error and maximum error) can be compared.

ISSN:0160-5682    

DOI:10.1057/jors.1991.28

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor

摘要:

AbstractA non-polynomial algorithm is presented for solving the minimum makespan problem on a set of uniform machines. This algorithm uses the bin-packing technique and provides an approximate solution which turns into an optimal one when the relative error is chosen small enough.

ISSN:0160-5682    

DOI:10.1057/jors.1991.29

出版商:Taylor&Francis    

年代:1991

数据来源: Taylor