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

TL;DR: This review reports on literature which explicitly addresses the strategic nature of facility location problems by considering either stochastic or dynamic problem characteristics, with applications ranging across numerous industries.

TL;DR: The Analytic Hierarchy Process is often used in group settings where group members either engage in discussion to achieve a consensus or express their own preferences, and it is concluded that while this method can be useful, it is applicable only in special circumstances.

TL;DR: This study investigates the performance of eight methods for solving multi-attribute decision making problems (MADM) using a decision matrix input of N criteria weights and ratings of L alternatives on each criterion, and investigates similarities and differences in the behavior of these methods.

TL;DR: A conceptual framework for articulating tentative guidelines to choose an appropriate MCDA method is drawn and the results of the comparison of well known multicriterion aggregation procedures (MCAP) on the basis of these guidelines are presented.

TL;DR: Modelling techniques such as detection and restoration of pareto efficiency, normalisation, redundancy checking, and non-standard utility function modelling are overviewed, and the rationality of ranking Multi-Criteria Decision Making techniques is discussed.

TL;DR: Stochastic multiobjective acceptability analysis is a multicriteria decision support technique for multiple decision makers based on exploring the weight space that produces for each alternative an acceptability index measuring the variety of different valuations that support that alternative.

TL;DR: This paper integrates these elements and their attributes into a strategic assessment and decision tool using the systems with feedback or analytical network process (ANP) technique first introduced by Saaty.

TL;DR: This paper synthesizes the past evolution of location-routing literature and then explores promising research opportunities in incorporation of more realistic aspects, algorithmic design, and model complexity.

TL;DR: This work proposes a two-level location model for the sand problem and considers its optimization using heuristic procedures and the results obtained are summarized.

TL;DR: A branch and bound algorithm is presented for the resource-constrained project scheduling problem (RCPSP) and concepts of immediate selection are developed in connection with this branching scheme.

TL;DR: The problem of producing rosters for nursing staff in a large general hospital is tackled using tabu search with strategic oscillation, a robust and effective method which is able to match the quality of solutions produced by a human expert.

TL;DR: The model is based on an inexact chance-constrained programming method, which improves upon the existing inexact and stochastic programming approaches by allowing both distribution information in B and uncertainties in A and C to be effectively incorporated within its optimization process.

TL;DR: An optimization model is developed to determine the joint optimal selection of these three important decision variables, with an objective of maximizing the average net profit in service industries where demands are sensitive to both price and delivery time.

TL;DR: In this article, new MILP formulations for the multiple allocation p-hub median problem are presented, which require fewer variables and constraints than those traditionally used in the literature, and an efficient heuristic algorithm, based on shortest paths, is described.

TL;DR: How in certain situations two multi-criteria analysis tools, multi-objective programming and data envelopment analysis, can be used together for this selection and negotiation process with vendors who were not selected is described.

TL;DR: The conclusion is that it is better to use several methods for the same problem when possible; when not, the use of ELECTRE III.

TL;DR: The paper analyses recent developments of a number of memory-based metaheuristics such as taboo search, scatter search, genetic algorithms and ant colonies and proposes Adaptive Memory Programming (AMP), a unified presentation of methods recently developed for quadratic assignment, vehicle routing and graph colouring problems.

TL;DR: Two approaches in aggregating multiple inputs and multiple outputs in the evaluation of decision making units (DMUs), data envelopment analysis (DEA) and principal component analysis (PCA) are compared.

TL;DR: A new crossover operation, called continuous uniform crossover, is proposed, such that it produces valid chromosomes given that the parent chromosomes are valid, applied to the problem of multicriteria inventory classification.

TL;DR: A 0–1 column generation model with a resource constrained shortest path auxiliary problem for nurse scheduling that can be viewed as a general scheme for complex personnel scheduling problems, especially in the context of organizations which operate around the clock.

TL;DR: The results show that the new approach improves existing models and performs relatively well, and a new approach is developed that overcomes existing weaknesses.

TL;DR: An exact solution procedure of the branch-and-bound type for solving the multi-mode resource-constrained project scheduling problem is presented and the size of the projects that can be solved to optimality has been nearly doubled.

TL;DR: A theoretical case for using system dynamics and soft system methodology together, and a synthesis of the two called ‘Holon Dynamics' is proposed, with reflections on the proposal and the need for theoretical consistency when mixing tools is emphasised.

TL;DR: This paper presents extensive sets of randomly generated test problems for the problems of minimizing makespan (Cmax) and maximum lateness (Lmax) in flow shops and job shops.

TL;DR: The results of the model indicate that the developed integer goal programming model seems to be an ideal technique that is applicable to the real-world fire-station location problem.

TL;DR: A goal programming model to solve the problem is developed and a small hypothetical example is presented to illustrate how penalty functions can be used to obtain more satisfactory solutions in real life applications.

TL;DR: This paper discusses how cognitive theorists would posit network representations of consumer brand associations, and relies upon several empirical examples of consumer associative networks, based on data from a variety of data collection techniques, to demonstrate the tools available to the brand manager using network analytic techniques.

TL;DR: A simulation model for bed capacity planning in Intensive Care shows that there is a non-linear relationship between numbers of beds, mean occupancy level and the numbers of patients that have to be transferred through lack of bed space.

TL;DR: This paper deals with an extended EOQ-type inventory model for a perishable product where the demand rate is a function of the on-hand inventory and the effects of nonlinearity in holding costs are presented.

TL;DR: A tabu search (TS) heuristic for the undirected Selective Travelling Salesman Problem, which iteratively inserts clusters of vertices in the current tour or removes a chain of Vertices.