Showing papers in "European Journal of Operational Research in 1996"

TL;DR: The use of triangular fuzzy numbers for pairwise comprison scale of fuzzy AHP is introduced, and the use of the extent analysis method for the synthetic extent value S i of the pairwise comparison is used.

TL;DR: In this paper, the authors review the literature addressing coordinated planning between two or more stages of the supply chain, placing particular emphasis on models that would lend themselves to a total supply chain model.

TL;DR: It is shown that fuzzy integrals are able to model interaction between criteria in a flexible way and is one of the aims of this review to disseminate this emerging technology in many industrial fields.

TL;DR: It is shown that the performance-ranking of priority rules does not differ for single-pass scheduling and sampling, that sampling improves the performance of single- pass scheduling significantly, and that the parallel method cannot be generally considered as superior.

TL;DR: Several modifications to the basic genetic procedures are proposed including a new fitness-based crossover operator (fusion), a variable mutation rate and a heuristic feasibility operator tailored specifically for the set covering problem.

TL;DR: The main problems of stochastic vehicle routing are described within a broad classification scheme and the most important contributions are summarized in table form.

TL;DR: This paper provides a review of the literature and a framework for the presentation of prediction models, and relationships and research trends in the prediction of business failure are discussed.

TL;DR: The maintenance of a deteriorating system is often imperfect: the system after maintenance will not as good as new, but younger as discussed by the authors, which indicates a significant breakthrough in reliability and maintenance theory.

TL;DR: A job shop consists of a set of different machines that perform operations on jobs, each job is composed of an ordered list of operations each of which is determined by the machine required and the processing time on it.

TL;DR: The results indicate that customized neural networks offer a very promising avenue for building effective generic models if the measure of performance is percentage of bad loans correctly classified, but logistic regression models are comparable to the neural networks approach.

TL;DR: A fast and effective heuristic is presented and tested on 353 problems ranging in size from 21 to 102 points and the computational results are presented in detail.

TL;DR: Value-focused thinking describes and illustrates concepts and procedures for creating better alternatives for your decision problems, identifying decision opportunities more appealing than the decision problems that confront you, and articulating and using your fundamental values to guide and integrate your decisionmaking activities.

TL;DR: A fast and easily implementable approximation algorithm for the problem of finding a minimum makespan in the permutation flow shop is presented in this article, based on a tabu search technique with a specific neighborhood definition which employs a block of jobs.

TL;DR: New mixed 0 1 linear formulations with tight linear programming relaxations are developed with a potential impact in a number of other problem settings, where efficient heuristic solutions exist and are probably, but not provably optimal.

TL;DR: A genetic algorithm for placing polygons on a rectangular board is proposed and it is shown that the algorithm is improved by combination with deterministic methods.

TL;DR: A Self Organizing Map (SOM) neural network clustering methodology is used and it is demonstrated that it is superior to the hierarchical clustering methods.

TL;DR: In this paper, a simple two-level system composed of a supplier (or component plant) and a single customer (or final assembly plant) is studied, and the changes brought about by the exchange of timely demand information in inventories and service levels at both the supplier and customer are examined.

TL;DR: A survey on methods for solving fuzzy linear programs, first LP models with soft constraints, then LP problems in which coefficients of constraints and/or of the objective function may be fuzzy are outlined.

TL;DR: A bibliography of material concerned with modeling of production and transfer lines using queueing networks, which denotes production lines as flow lines with asynchronous part transfer, while transfer lines have synchronous part transfer.

TL;DR: In this article, the authors proposed a cross-evaluation matrix as the summary of a self- and peer-rating process in which the candidates seek to interpret the voters preferences as favourably for themselves, relative to the other candidates, as possible.

TL;DR: In this paper, a fast and extremely effective heuristic is presented and tested on 67 problems taken from the literature and 40 new test problems and the computational results are presented in detail.

TL;DR: Evidence is provided that the existing Data Envelopment Analysis model will overestimate the level of technical inefficiency and that the modified model developed in this paper does a better job controlling for exogenous factors.

TL;DR: This paper shows how to site limited numbers of emergency vehicles in such a way as to maximize the calls for service which have an ambulance available within a time or distance standard with reliability α — using a queueing theory model for server availability.

TL;DR: In this paper, a tutorial introduction to Simulated Annealing, Tabu Search, and Genetic Algorithms is given, as well as a tentative evaluation and comparison from a pragmatic point of view.

TL;DR: This work presents the state of the art for multiprocessor task scheduling and shows the rationale behind the concept of multip rocessor tasks, and the standard three-field notation is extended to accommodate multi-processor tasks.

TL;DR: In this paper, sensitivity analysis of the CCR model in data envelopment analysis (DEA) is studied by means of modified versions of CCR models based on evaluation of a decision making unit (DMU) relative to a reference set grouped by all other DMUs.

TL;DR: It is suggested that the project quality may be affected by project crashing and linear programming models are developed to study the tradeoffs among time, cost, and quality.

TL;DR: In this paper, the authors extended the EOQ model to the case of variable setup numbers n and m for production and repair within some collection time interval, and the minimum cost was analyzed as a function of this rate and it was shown to be convex for small and medium waste disposal rates and concave for large rates.

TL;DR: This work unify all the discussed concepts as well as the corresponding solution methods into one general framework of the solution of the linear programming problem with interval coefficients in the objective function based on preference relations between intervals.

TL;DR: Schema analysis of the algorithm shows that a sexual reproduction with the generalized mutation operator preserves the global convergence property of a genetic algorithm thus establishing the fundamental theorem of the GA for the algorithm.