摘要:

AbstractThis paper describes a successful study which was concerned with identifying appropriate levels of supernumerary staff in a branch network of a national service company. The case study is used to illustrate a number of OR methodology issues relating to problem identification, model design, implementation and choice of modelling approach:

ISSN:0160-5682    

DOI:10.1057/jors.1993.1

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractStrategic logistics chain planning is of great importance within the downstream oil industry. Logistics networks originate at refineries and terminate at the final delivery point—the customer. Types of bulk transportation used and the main product classes are described. The business decisions which need to be addressed are stated. A corresponding model is formulated partly in mathematical and partly in qualitative terms. The cost of road vehicle delivery to customers is modelled. The business risks associated with changes to the logistics infrastructure are indicated.

ISSN:0160-5682    

DOI:10.1057/jors.1993.2

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractSeveral heuristics are presented for the flowshop scheduling problem with the objective of minimizing mean tardiness. We consider the cases in which job sequences on all machines are the same (permutation flowshop) and in which they may be different. For the former case, the various methods that have been devised for minimizing the makespan are modified for our objective, while the list scheduling algorithm is used for the latter case. These heuristics are tested and compared with each other on randomly-generated test problems.

ISSN:0160-5682    

DOI:10.1057/jors.1993.3

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn this paper we consider schedulingnsingle operation jobs with a common due date onmnon-identical machines (in parallel) so as to minimize the sum of the absolute lateness. We reduce the problem to a transportation problem that can be solved by a polynomial time algorithm. Furthermore, we consider the problem in the case of identical machines and we give a heuristic algorithm to minimize makespan among all schedules that minimize the absolute lateness problem.

ISSN:0160-5682    

DOI:10.1057/jors.1993.4

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn recent years much emphasis has been placed on maintenance of transit vehicles. This is due to many reasons: inflation, availability of vehicles for maintenance, reliability of components etc. Many mathematical models have been developed to predict the replacement mileage of the components. These models usually focus on only one criterion for decision-making, namely the minimum replacement cost-rate. This concept tends to oversimplify the situation that is present in the system. In this research, mathematical models were developed for three criteria: (1) minimum replacement cost-rate, (2) maximum availability and (3) bottom-line component reliability. Optimum replacement plans were obtained using different multiple-criteria decision-making methods like Strictest Selection, Lexicographic and Waltz Lexicographic methods.

ISSN:0160-5682    

DOI:10.1057/jors.1993.5

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractArtificial Neural Network (ANN) techniques have recently been applied to many different fields and have demonstrated their capabilities in solving complex problems. In a business environment, the techniques have been applied to predict bond ratings and stock price performance. In these applications, ANN techniques outperformed widely-used multivariate statistical techniques. The purpose of this paper is to compare the ANN method with the Discriminant Analysis (DA) method in order to understand the merits of ANN that are responsible for the higher level of performance. The paper provides an overview of the basic concepts of ANN techniques in order to enhance the understanding of this emerging technique. The similarities and differences between ANN and DA techniques in representing their models are described. This study also proposes a method to overcome the limitations of the ANN approach, Finally, a case study using a data set in a business environment demonstrates the superiority of ANN over DA as a method of classification of observations.

ISSN:0160-5682    

DOI:10.1057/jors.1993.6

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThe authors are currently developing a hierarchical production planning system specifically designed for the‘make-to-order’sector of industry. Its aim is to control the delivery and manufacturing lead times of all orders processed by a firm. Two major decision levels are identified - the customer enquiry stage and the order release stage. Input/output control is exercised at both stages. This paper is concerned with the control mechanisms used at the customer enquiry stage. Two important backlogs of work, along with their associated backlog lengths, are identified. The system aims to maintain these backlogs between predetermined minimum and maximum lengths in order to process all orders within an acceptable length of time. It is shown that the two backlogs are linked in a manner that enables them to be controlled simultaneously. Hence, a procedure for dealing with incoming customer orders is presented.

ISSN:0160-5682    

DOI:10.1057/jors.1993.7

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractThis paper presents a practical approach for resource constrained scheduling within a given project duration. The method ensures a stable project plan when activity durations are reduced to achieve this. It handles all four categories of resource (unconstrained, renewable, non-renewable and doubly-constrained resources), and aims to shorten the project duration at minimum cost. Soft constraints and resource availabilities which vary over time are allowed in the method. Computational experience is reported.

ISSN:0160-5682    

DOI:10.1057/jors.1993.8

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

摘要:

AbstractIn this paper a new method for generating the set of efficient extreme-points for the three-objective linear programming problem is presented. This method successfully exploits the fact that vectors that are strictly efficient in associated multi-objective problems of lower dimensions are also efficient in the full multi-objective problem.

ISSN:0160-5682    

DOI:10.1057/jors.1993.9

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor

ISSN:0160-5682    

DOI:10.1057/jors.1993.10

出版商:Taylor&Francis    

年代:1993

数据来源: Taylor