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

TL;DR: This paper surveys verification and validation of models, especially simulation models in operations research, and discusses general good programming practice (such as modular programming), and checking intermediate simulation outputs through tracing and statistical testing per module.

TL;DR: In this article, the authors consider a one-vendor multi-buyer integrated inventory model, where the vendor seeks to minimize his total annual cost subject to the maximum costs which buyers are prepared to incur.

TL;DR: In this paper, the role of time in nonparametric efficiency analysis is examined using both FDH and DEA technologies, and it is shown how each observation in a panel can be characterized in efficiency terms vis-a-vis three different kinds of frontiers: (i) "contemporaneous", (ii) "sequential", and (iii) "intertemporal".

TL;DR: In this paper, the authors study the macroeconomic performance of 19 OECD countries over the period 1970-1990 and find that performance rankings do change, and that the relative performance of the European countries declines, when the environmental disamenities are added to the service list.

TL;DR: In this article, grey integer programming (GIP) is used for facility expansion planning under uncertainty, by incorporating the concepts of grey number and grey mathematical programming into a mixed integer linear programming optimization framework.

TL;DR: This review is to examine how the needs of utility planners for optimization models have changed in response to environmental concerns, increased competition, and growing uncertainty.

TL;DR: This study finally identifies the most efficient FMS system by applying weight flexibility restriction and cross efficiency methods to rectify the difficulty.

TL;DR: This paper considers the problem of loading containers with cartons of non-uniform size and presents an analytical model to capture the mathematical essence of the problem and extended to formulate some special container loading problems.

TL;DR: In this article, the authors presented inventory models for perishable items with stock dependent selling rate, where the selling rate is assumed to be a function of current inventory level and rate of deterioration is taken to be constant.

TL;DR: A simple O(n) partitioning algorithm for deriving the optimal linear solution to the Multiple-Choice Knapsack Problem is presented, and it is shown how it may be incorporated in a dynamic programming algorithm such that a minimal number of classes are enumerated, sorted and reduced.

TL;DR: Estimates of most productive output scale suggest that locally decreasing returns to scale set in at higher output levels for physicians who treat higher proportions of high severity patients.

TL;DR: A review of the various solution methods for the capacitated plant location problem is provided in this article, where heuristic and exact procedures that have appeared in the literature are covered, and two innovative concepts, the Lagrangian heuristic, and variable splitting, are examined.

TL;DR: In this article, the possibilities of incorporating environmental issues when analyzing industrial supply chains and to inform environmental scientists more generally of the value of using OR models and techniques in environmental research are discussed. And the authors aim to inform Operational Researchers of the possibilities and benefits of using environmental models and tools in their work.

TL;DR: The conclusions show that the GA based heuristic can always give the best results in a short time on a SUN workstation.

TL;DR: In this article, the authors propose an interactive process of preference programming which allows the decision maker to enter ambiguous preference statements by indicating the relative importance of factors as intervals of values on a ratio scale, and synthesize the interval judgments into dominance relations on the alternatives by solving a series of linear programming problems.

TL;DR: This work formally describes the time-cost tradeoff problem, discusses the difficulties associated with its solution, and presents network decomposition/reduction as a convenient basis for solving the problem and analyzing its difficulty.

TL;DR: After providing a formal definition of semi-active, active, and non-delay schedules for the RCPSP, some of these problems occurring within the disjunctive arc concept are outlined.

TL;DR: A detailed literature survey of multiple and bicriteria problems in scheduling can be found in this article, where the authors provide a broad classification scheme for scheduling problems and discuss the trade-offs involved in considering several different criteria.

TL;DR: This document considers how success or failure can be defined for a project (more than simple time/cost/technical target achievement), and looks at the historical evidence of projects, illustrating failure to achieve targets.

TL;DR: In this paper, a new approach is proposed by introducing the minimax regret criterion as used in decision theory, and a method of solution by a relaxation procedure is proposed, which is shown that the solution is obtained by repetitional use of the simplex method.

TL;DR: This third special issue of EJOR reports current research that addresses a variety of cutting, packing and related problems where classical, as well heuristic approaches are applied.

TL;DR: This research is the first to use Cascade-Correlation for corporate health estimation, and it solves the hidden architecture enigma encountered using other types of neural networks.

TL;DR: In this paper, the authors present a heuristic approach to the multilevel generalized assignment problem (MGAP) which consists of a novel application of tabu search (TS), which employs neighborhoods defined by ejection chains, that produce moves of greater power without significantly increasing the computational effort.

TL;DR: By computer simulations on randomly generated test problems, it is shown that the performance of the proposed algorithms is less sensitive to the choice of a cooling schedule than that of the standard simulated annealing algorithm.

TL;DR: The simulated annealing-based improvement methods are compared against their descent alternatives as well as other metaheuristics implementations on a set of classical test problems.

TL;DR: In this article, an assessment of police forces in England and Wales using Data Envelopment Analysis (DEA) is presented, which contributed to a study of crime management carried out by the Audit Commission, an independent body, set up by Act of Parliament to encourage the economic, effective and efficient provision of public services.

TL;DR: In this article, a new exact tree search procedure for solving two-dimensional knapsack problems is presented, in which a number of small rectangular pieces, each of a given size and value, are required to be cut from a large rectangular stock plate.

TL;DR: In this article, the problem of fitting pipes of different diameters into a shipping container is formulated as a nonlinear mixed integer programming problem and a number of heuristic procedures for solving this problem are developed.

TL;DR: In this article, a new heuristic approach is described which aims to generate efficient loading arrangements which at the same time also provide a high degree of inherent stability, and a series of possible modifications of the basic method, together with a detailed performance analysis of their relative merits.