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

TL;DR: In this article, the authors extend TOPSIS to solve a multiple objective decision making problem, and obtain a single-objective programming problem by using the max-min operator for the second-order compromise operation.

TL;DR: In this article, the authors present integer programming formulations for four types of discrete hub location problems: the p-hub median problem, the uncapacitated hub location problem, p -hub center problems and hub covering problems.

TL;DR: In this paper, the authors provide a detailed discussion with references on the fundamentals of the Analytic Hierarchy Process and in particular of relative measurement, and a discussion of rank and a number of citations of rank reversals attributed to a variety of factors ranging from intransitivity to procedure invariance.

TL;DR: In this article, a simple and intuitively appealing eigenvector based method was proposed to intrinsically determine the weightages for group members using their own subjective opinions, which is the most commonly used method for combining individual opinions to form a group opinion.

TL;DR: Two approaches to managing this operation are compared, one in which the production scheduling and vehicle routing problems are solved separately, and another in which they are coordinated within a single model.

TL;DR: The methodology of the rough set analysis of multi-attribute decision problems, depending on the structure of their representation, its interpretation and the kind of questions related, is reviewed.

TL;DR: In this article, the authors provide a base from which issues of equity can be included in facility siting models and discuss approaches that can be used to select an appropriate measure of equity.

TL;DR: A new lower bound and a new branching scheme which are used to design a branch and bound method are described and Computational results show that these techniques permit to drastically reduce the size of the search trees.

TL;DR: In this article, a new heuristic method based on tabu search is developed for the problem of locating p interacting hub facilities among n interacting nodes in a network, which treats equally the problems of locating hub facilities, as well as allocating the nodes to one and only one hub.

TL;DR: In this paper, a branch and bound algorithm and a heuristic procedure partitioning the set of solutions on the basis of hub locations are presented to solve the capacitated hub-and-spoke network design problem.

TL;DR: A maximal expected coverage location model with time variation (TIMEXCLP) is developed and integrated into a decision support system (DSS) to aid EMS planners to allocate vehicles within their service area and response time was decreased.

TL;DR: An algorithm for personnel selection is developed that aggregates decision-makers' linguistic assessments about subjective criteria weightings and ratings to obtain the fuzzy suitability index and its ranking value.

TL;DR: A comparative study of eight different approximation algorithms for the Set Covering Problem, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorithm found the best algorithm was a greedy variant and the neural network performed quite poorly.

TL;DR: A general technique based on tabu search for finding an acceptable timetable is presented and the resulting computerized algorithm is used for constructing different real course schedules.

TL;DR: An interpretative model is proposed that explains firms' dynamic behavior in Multi-Project Management of new product development and could be used as a unique and homogeneous framework supporting the processes of project selection, resource allocation, risk management, priority management and ongoing control.

TL;DR: A structure for batching decisions is provided that can help in positioning batching research and models with respect to issues pertinent to goods-flow management.

TL;DR: This work develops a simple heuristic consisting of pick-up and delivery along the travelling salesman tour along the Cheapest Insertion heuristic and introduces an alternative solution method which is an extension of the well known Cheapest insertion heuristic.

TL;DR: In this paper, an iterative numerical procedure was developed to find the optimal replenishment schedule for the case of discrete time-varying demand without deterioration, and the results of a sample of 1440 problems showed that the extended least cost approach is the most cost effective.

TL;DR: This paper presents a mixed 0–1 model and outlines a practical algorithm to schedule the production quantities and accounts correctly for costs corresponding to period overlapping setups.

TL;DR: This paper develops a model of an integrated production-distribution system comprised of a single station model of a factory, a stockpile of finished goods, and a single retailer, and approximate the distributions of key random variables to compute costs and service levels across the supply chain.

TL;DR: A heuristic procedure is developed to generate a good approximation of the efficient frontier, which provides the decision marker with insight into the magnitudes of the inherent tradeoffs between the two objectives.

TL;DR: In this paper, the authors considered the continuous, deterministic, infinite horizon, single item inventory system, within the setting of a retail sector, in which the demand rate for an item is dependent on the existing inventory level.

TL;DR: In this article, the problem of scheduling several products on a single machine so as to meet the known dynamic demand and to minimize the sum of inventory costs and sequence-dependent setup costs was formulated as a travelling salesman problem with time windows.

TL;DR: In this paper, it was shown that rank reversal in AHP is caused by eigenvector normalization, and the implicit, often unwarranted assumption that the DM's preference structure can be represented by an additive value function was discussed.

TL;DR: In this paper, the problem of co-ordination between a vendor and a buyer is formulated as a two-person fixed threat bargaining game, where the vendor decides on his lot size and the price schedule he is to offer to the buyer.

TL;DR: This work approaches and describes a machine scheduling model for the problem of selecting and scheduling projects to maximize the scientific, military or commercial value of a space mission, and describes two upper bounding procedures, based upon a preemptive relaxation of the problem, and upon the use of Lagragean relaxation.

TL;DR: The paper presents a decision support system (DSS) for multiobjective project scheduling under multiple-category resource constraints that handles quite a general class of nonpreemptive scheduling problems with renewable, nonrenewable and doubly-constrained resources.

TL;DR: A unified algorithm embracing STEM, the Geoffrion-Dyer-Feinberg procedure, interactive goal programming, Wierzbicki's Aspiration Criterion Vector method, and five other prominent procedures are used to illustrate the degree to which the procedures of interactive multiple objective programming can be folded into one another when pursuing the unified strategy.

TL;DR: This paper proves that any feasible solution is associated with a valuation called a conservative height on the graph of constraints, and proposes a branch and bound enumeration procedure and two heuristics solving the problem.

TL;DR: A heuristic method which efficiently solves the Modified Warehouse Location-Routing Problem is presented, based on Perl (1983) and Perl and Daskin (1985) but is more efficient in two important ways.