1
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:2 Page:151-164

Jacquet-Lagreze E;
Siskos J;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

The purpose of the method presented in this paper is to assess additive utility functions which aggregate multiple criteria in a composite criterion, using the information given by a subjective ranking on a set of stimuli or actions (weak-order comparison judgments) and the multicriteria evaluations of these actions. It is an ordinal regression method using linear programming to estimate the parameters of the utility function. Stability and sensitivity analysis leads to the assessment of a set of utility functions by means of post-optimality analysis techniques in linear programming. Finally, a simple illustrative example is presented and some extensions of the method are proposed. © 1982.

2
European Journal of Operational Research
ISSN:0377-2217 Volume:11 Issue:1 Page:42-47

Carlier Jacques;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

Let and be non-bottleneck machines and a bottleneck machine processing only one job at a time. Suppose that jobs have to be processed on , and (in that order) and job has to spend a time , on , on and on : we want to minimize the makespan. This problem is important since its resolution provides a bound on the makespan of complicated systems such as job shops. It is NP-hard in the strong sense. However, efficient branch and bound methods exist and we describe one of them. Our bound for the tree-search is very close to the bound used by Florian et al., but the principle of branching is quite different. At every node, we construct by an O( log ) algorithm a Schrage schedule; then we define a critical job , a critical set and consider two subsets of schedules; the schedules when procedes every job of and the schedules when follows every job of . We give the results of this method and prove that the difference between the optimum and the Schrage schedule is less than .

3
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:3 Page:294-301

Roubens Marc;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

A non metric clustering algorithm based on a fuzzy objective function which reflects proximity based on some global dissimilarity measure is proposed. The global optimal solution is shown to be difficult to obtain and an alternative iterative procedure is presented. This procedure is easily implemented and converges to a local optimum. Some validity functionals which measure the effectiveness with which cluster structure has been identified are compared in relation with the iterative procedures described in the paper. © 1982.

4
European Journal of Operational Research
ISSN:0377-2217 Volume:11 Issue:4 Page:399-404

Namorado Climaco João Carlos;
Queirós Vieira Martins Ernesto;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

Among the network models, one of the more popular is the so called shortest path problem. This model is used whenever it is intended to minimize a linear function which represents a distance between a predetermined pair of nodes in a given network. Often a single objective function is not sufficient to completely characterize some real-world problems. For instance, in a road network two parameters - as cost and time - can be assigned to each arc. Clearly the fastest path may be too costly. Nevertheless the decision-maker must choose one solution, possibly not the best for both criteria. In this paper we present an algorithm for this problem. With this algorithm a special set of paths (the set of Pareto optimal paths) is determined. One objective for any Pareto optimal path can not be improved without worsening the other one. © 1982.

5
European Journal of Operational Research
ISSN:0377-2217 Volume:11 Issue:1 Page:48-54

Van Wassenhove Luk N;
Baker Kenneth R;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

This paper discusses a bieriterion approach to sequencing with time/cost trade-offs. This approach, which produces an efficient frontier of possible schedules, has the advantage that it does not require the sequencing criteria to be measurable in the same units as the resource allocation cost. The basic single-machine model is used to treat a class of problems in which the sequencing objective is to minimize the maximum completion penalty. It is further assumed that resource allocation costs can be represented by a linear time/cost function.

6
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:3 Page:282-293

Dombi J;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

Starting with an explication of the "aggregative"-concept and deducing a general structure which satisfies a number of minimal requirements (properties of clustering) the main features of a new mathematical theory - called "theory of evaluation" - are developed. The theory sheds new light on such well-known concepts as membership, conjunction and disjunction and seems to be a very promising tool to handle representation problems as they grow from the fields of theory of fuzzy set, and its many applications, of human decision making and of multicriteria analysis. © 1982.

7
European Journal of Operational Research
ISSN:0377-2217 Volume:11 Issue:4 Page:390-398

Altiok Tayfur;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

In this paper, an approximate method for the analysis of open networks of queues in tandem and with blocking is proposed. The network consists of M single server queuing stations with exogenous Poisson arrival processes and exponentially distributed service times. The analysis is based on the method of decomposition where the total network is broken down into queues which are analyzed as M/C /1/N queues assuming Poisson arrival and departure processes to find the steady-state probabilities of the number of customers at each station. The procudure reduces the problem to a number of elementary operations which can be performed efficiently with the aid of a computer. We also compare different definitions of blocking. Numerical results are given to demonstrate the accuracy of the new method. © 1982.

8
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:1 Page:51-55

Roubens Marc;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

Let A be a finite set of feasible actions which are judged following several criteria. An outranking relation is defined on A by considering preference of the decision maker as a weak order on each criterion and the relation among criteria as a semi-order on the given set of criteria. Several ways of constructing outranking relations have been proposed. One of the most popular, introduced by B. Roy, for instance ELECTRE(s), is based on the use of weights related to criteria. In our approach, the knowledge of weights is replaced by the existence of a semi-order. A case study is developed. It deals with a computer selection problem. © 1982.

9
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:2 Page:196-204

Christofides N;
Beasley J.E;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

In this paper we present two lower bounds for the p-median problem, the problem of locating p facilities (medians) on a network. These bounds are based on two separate lagrangean relaxations of a zero-one formulation of the problem with subgradient optimisation being used to maximise these bounds. Penalty tests based on these lower bounds and a heuristically determined upper bound to the problem are developed and shown to result in a large reduction in problem size. The incorporation of the lower bounds and the penalty tests into a tree search procedure is described and computational results are given for problems with an arbitrary number of medians and having up to 200 vertices. A comparison is also made between these algorithms and the dual-based algorithm of Erlenkotter. © 1982.

10
European Journal of Operational Research
ISSN:0377-2217 Volume:11 Issue:4 Page:367-379

Sherali Hanif D;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

A recent paper [19] demonstrated the existence of a set of equivalent weights for which the optimal solution set of a preemptive priority multi-objective program is precisely equal to the set of optimal solutions to the resulting nonpreemptive program with the objective function given as a linear weighting of the multiple objectives. This paper addresses two further issues. Firstly, for some important special cases or applications, it is demonstrated that not only is the computation of a set of equivalent weights feasible, but it is also highly desirable. Two algorithms are presented to compute a set of equivalent weights. One method is a direct specialization of the approach adopted in [19], whereas the second approach is an alternative technique. The latter method is shown to yield weights of uniformly smaller values than the former method, while being of the same computational complexity, and is hence preferable. Secondly, as opposed to constructing one vector of equivalent weights, a characterization is provided for the entire set of equivalent weights. © 1982.

12
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:1 Page:56-60

Weiss Howard J;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

We consider a generalization of the classical Economic Order Quantity Model. The traditional parameters of unit cost, selling price, demand rate and set-up cost are constant but the holding cost per unit is a non-linear function of the length of time the item is held in stock. The application is to any inventory system where the value of the item decreases non-linearily the longer it is held in stock. For the case of deterministic demands we present the cost formula and the optimal order quantity for both finite and infinite horizons. For the case of stochastic demands the cost function is examined and the optimal order amount is presented. Computational results are presented indicating the effect of the non-linearity in holding costs. © 1982.

13
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:1 Page:83-89

Volgenant Ton;
Jonker Roy;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

In 1970 Held and Karp introduced the Lagrangean approach to the symmetric traveling salesman problem. We use this 1-tree relaxation in a new branch and bound algorithm. It differs from other algorithms not only in the branching scheme, but also in the ascent method to calculate the 1-tree bounds. urthermore we determine heuristic solutions throughout the computations to provide upperbounds. We present computational results for both a depth-first and a breadth-first version of our algorithm. On the average our results on a number of Euclidean problems from the literature are obtained in about 60% less 1-trees than the best known algorithm based on the 1-tree relaxation. For random table problems (up to 100 cities) the average results are also satisfactory. © 1982.

14
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:3 Page:270-281

Carlsson Christer;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

The problem to be addressed and tackled in this paper arose as a byproduct from some efforts at solving problems involving multiple goals by linking linear and goal programming models. The critical issue was that some forms for interdependence among the goals could not be handled in the programming models. Here we will deal with a set of goals - with realistic counterparts in a Finnish plywood industry - in which a subset of the goals are (i) conflicting, another subset (ii) unilaterally supporting and a third subset (iii) mutually supporting. It is furthermore observed that the elements of a studied set of goals may be partly independent and partly interdependent, which makes the context a fullfledged MCDM-problem. It is tackled with a technique which is based on the theory of fuzzy sets, the conceptual framework for fuzzy decisions and the algorithms developed for fuzzy mathematical programming. The resulting fuzzy multiobjective programming model is simplified and tested with the help of a fairly complex numerical example. © 1982.

15
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:2 Page:205-209

Rubinstein R.Y;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

An acceptance-rejection algorithm for generating random vectors uniformly distributed over (inside or on the surface of) a complex region inserted in a minimal multidimensional rectangle is considered. For regions having simple forms (simplex, hypersphere, hyperellipsoid) several algorithms are presented as well. © 1982.

16
European Journal of Operational Research
ISSN:0377-2217 Volume:10 Issue:3 Page:314-324

Siskos J;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

This paper presents a special multiple criteria decision making approach for solving problems in context with fuzzy individual preferences. At first we briefly expose the proposed methodology. The individual preferences are explicitly given by a complete transitive relation R on a set of reference actions. The modelling of the decision-maker's preferences is obtained by means of fuzzy outranking relations. These fuzzy relations are based on a system of additive utility functions which are estimated by means of ordinal regression methods analysing the preference relation R. This is followed by a presentation of two real multicriteria problems which the proposed methodology has been applied to, i.e. a highway plan choice problem and a problem in marketing research dealing with the launching of a new product. In each application we tried to specify this method according to the specific structure of the problem considered. © 1982.

17
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:1 Page:61-63

Aucamp Donald C;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

This note gives a solution to a qualification of the standard EOQ problem in which freight costs are at least partially determined by the integer number of carloads required to fill the order. The model also applies to a broad class of problems in which there are multiple set-up costs. © 1982.

18
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:1 Page:64-70

Mulvey John M;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

Typically, university classroom space is grossly underutilized as measured by factor such as the number of vacant classroom slots and the percentage of empty seats. This inefficiency is caused, in part, by the propensity of faculty and students to select classes in the prime periods (9 A.M. - 12 and 1 P.M. - 3 P.M.) to the exclusion of alternative time slots. However, another difficulty is the combinatorial size of realistic scheduling problems; most optimization models cannot cope with even example problems. The trend has been to develop pure heuristic techniques. The author has devised a network-based optimizing approach to the classroom/time model which rapidly approximates the solutions. This model combines the insight of the scheduler with combinatorial and searching ability of a computer via a transshipment optimization network model. © 1982.

19
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:4 Page:369-377

Kaul R.N;
Kaur Surjeet;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

The concept of semilocally convexity was recently introduced by Ewing [2]. This paper defines semilocally quasiconvex, semi-locally pseudoconvex and other related functions and investigates some of their properties. © 1982.

20
European Journal of Operational Research
ISSN:0377-2217 Volume:9 Issue:4 Page:386-396

Sakawa Masatoshi;

来源数据库：Scopus

文摘信息
获取全文
问图书馆员

In this paper, we propose a new interactive multiobjective decision making technique, which we call the Sequential Proxy Optimization Technique (SPOT), in order to overcome the drawbacks of the conventional multiobjective decision making methods. Our method combines the desirable features of both the Surrogate Worth Trade-off (SWT) method and the Multiattribute Utility Function (MUF) method. We can interactively derive the preferred solution of the decision maker efficiently by assessing his marginal rate of substitution and maximizing sequentially the local proxy preference function. A numerical example illustrates the feasibility and efficiency of the proposed method. © 1982.