摘要:

AbstractThis paper discusses computer based support systems for the task of creating timetables in an educational establishment. In particular, we consider the use of a database management system for the‘book-keeping’aspects of timetable development. The system described has been implemented at Loughborough University Business School and has proved to be a very effective means of assisting the production of high quality timetables as well as related teaching lists and forms.

ISSN:0160-5682    

DOI:10.1057/jors.1993.79

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThe international spot-market, risk-exposed, trading of a cotton merchant was studied. A price model for estimating a market price for cotton with varying characteristics was constructed. This formed the input for a trading decision model which predicted the outcome of the merchant taking risky positions.

ISSN:0160-5682    

DOI:10.1057/jors.1993.80

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThis paper considers the trade-offs that may be made in the risk and uncertainty associated with various performance criteria of a project activity. Specifically, duration, cost and quality are the criteria considered, and the uncertainties in them are regarded as manifestations of the intrinsic risk of the activity. Three complementary approaches to conceptualizing and modelling risk trade-offs, as an aid to project planning, are presented in the context of a single activity. A cognitive mapping approach encourages articulation and exploration of ideas about risk trade-offs. A contingency-response analysis approach aids detailed risk contingency planning. A risk-level approach provides a picture of risk exposure options. This last approach, in particular, is developed in the context of projects consisting of sequences of activities.

ISSN:0160-5682    

DOI:10.1057/jors.1993.81

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThe paper is concerned with establishing dominance in linear decision models, either multiattribute models or models of decision making under uncertainty. It argues that a simple procedure, based on an ordered metric concept, provides a straightforward way of increasing the chance of locating patterns of dominance among alternatives. One particular application which is explored is the appraisal of competing investments.

ISSN:0160-5682    

DOI:10.1057/jors.1993.82

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn recent years we have witnessed remarkable progress in the development of the topological design of computer communication networks. One of the important aspects of the topological design of computer communication networks is the concentrator location problem. This problem is a complex combinatorial problem that belongs to the difficult class of NP-complete problems where the computation of an optimal solution is still a challenging task. This paper extends the standard capacitated concentrator location problem to a generalization of multitype capacitated concentrator location problems and presents an efficient algorithm based on cross decomposition. This algorithm incorporates the Benders decomposition and Lagrangean relaxation methods into a single framework and exploits the resulting primal and dual structure simultaneously. Computational results are quite satisfactory and encouraging and show this algorithm to be both efficient and effective. The use of cross decomposition as a heuristic algorithm is also discussed.

ISSN:0160-5682    

DOI:10.1057/jors.1993.83

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractMany sequencing and scheduling problems can be formulated as 0-1 integer programs and, in theory, solved using a branch-and-bound approach. In practice, real-world instances of these problems are usually solved using heuristics. In this paper we demonstrate the benefits of incorporating an intuitive, user-controlled variable-tolerance into a depth-first branch-and-bound algorithm. The tolerance comprises two components: a variable depth tolerance and a variable breadth tolerance. A sample scheduling problem is thoroughly analysed to illustrate empirically parameter impact on solution quality and execution time. Then, results based on several real-world problems are discussed.

ISSN:0160-5682    

DOI:10.1057/jors.1993.84

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractUsing a modified Lanchester model, this article demonstrates that the policy of constant advertising spending is superior to a cyclic counterpart, provided that the advertising response functions of competing firms are concave. The competitive model is estimated using filter and non-filter cigarette data. The empirical results suggest the presence of over-advertising and that the relative effectiveness and elasticity of filter cigarette advertising are both higher than those of non-filter cigarette advertising.

ISSN:0160-5682    

DOI:10.1057/jors.1993.85

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThis paper describes a problem, known as the Personnel Assignment Problem, for assigning personnel into positions in a military setting. Part of the challenge of the assignment is in determining a number that measures the‘fit’of an individual in a position. A value is constructed from the data for each pairing of an individual with a position.

ISSN:0160-5682    

DOI:10.1057/jors.1993.86

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn this paper, the expected distance between two uniformly distributed random points in a rectangle or in a rectangular parallelepiped is computed under three different metrics: the Manhattan metric, the Euclidean metric, and the Chebychev metric.

ISSN:0160-5682    

DOI:10.1057/jors.1993.87

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn this paper it is shown, through computational results, that a schedule generation algorithm originally designed for the traditional job shop model can still provide good results, in terms of CPU time and solution accuracy, when applied to the flexible manufacturing system (FMS) model. For this, we use two algorithms, for the job shop and the FMS, that generate all active schedules. Both algorithms are improved, by adding to them a branch-and-bound approach, and their behaviour is compared.

ISSN:0160-5682    

DOI:10.1057/jors.1993.88

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor