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

TL;DR: This paper proposes 260 randomly generated scheduling problems whose size is greater than that of the rare examples published, and the objective is the minimization of the makespan.

TL;DR: In this article, a multiobjective approach is presented to systematically analyze the inherent tradeoffs involved in multicriteria vendor selection problems, motivated by an actual purchasing problem facing a division of a Fortune 500 company.

TL;DR: This paper describes an insertion algorithm for the Vehicle Routing and Scheduling Problem with Time Windows that builds routes in parallel and uses a generalized regret measure over all unrouted customers to select the next candidate for insertion.

TL;DR: A ‘decision science’ can only be rooted in the path of realism, which implies accepting postulates and hypotheses which have proved unusable in the practice of OR-DA, and how by shifting the object of the quest for knowledge it nonetheless appears possible to speak in terms of a decision-aid science.

TL;DR: In this article, a survey of studies that investigate behavioral influences on weight judgments is presented, which is of importance for the prescriptive use of decision analysis, since only if we know about behavioral influences might we be able to avoid or reduce them.

TL;DR: In this article, a framework for developing Lagrangean heuristics with respect to location problems is presented, and the results indicate that the framework presented in this paper is robust, i.e. it gives good quality solutions for each of these different location problems.

TL;DR: This work summarizes trends and published research during the last decade in ship scheduling and related problems, and identifies issues which require further investigation.

TL;DR: A concise review of the literature on cell formation aspects of design of cellular manufacturing systems and the usefulness and limitations of existing approaches are identified.

TL;DR: The analysis presented here reevaluates how scenario development is converging with contemporary forecasting practice and offers some practical guidelines and a more integrative perspective on using scenarios to support strategic planning.

TL;DR: In this paper, the authors study the problem of vendor selection where a buyer must choose order quantities to place with vendors in a multiple-sourcing network, and the selection process is influenced by the price, delivery, and quality objectives of the buyer, as well as by the production or rationing constraints of the vendors.

TL;DR: An efficient computational implementation of a path deletion K shortest paths algorithm and a new algorithm for the same problem that avoids the last K−1 executions of a shortest path algorithm are presented, resulting in a suprising and very substantial reduction in the execution time.

TL;DR: It is shown that if the authors define risk and value in appropriate ways, the rank order produced by the risk-value model will be consistent with a suitably chosen expected utility or non-expected utility model.

TL;DR: In this paper, the coordination of production planning among multiple plants in a vertically integrated firm is addressed, and the authors identify important issues that managers and researchers must address so that production and inventory decisions can be determined for all plants.

TL;DR: The results of an experiment with simulated data that compares the estimation accuracy of two simple and very different production frontier methods: corrected ordinary least squares and data envelopment analysis are reported in this article.

TL;DR: In the past several years, there has been growing interest in scheduling problems where jobs are penalized both for being early and for being tardy as mentioned in this paper, and a number of excellent surveys on these problems have appeared over the last four years.

TL;DR: An attempt to evaluate some of the more known techniques in ratio-scale matrices scaling, which includes random generation of a large number of representative matrices to evaluate the various scaling methods according to the specified criteria.

TL;DR: This work concerns the development of a location-allocation model for planning USWMS and some heuristic techniques for solving it, specifying the number and the location of waste disposal plants, and the results.

TL;DR: In this paper, the authors apply the simulated annealing approach to packing problems and describe a series of experiments carried out to ascertain the effectiveness of the method for such problems and the most appropriate neighbourhood structure to use and the best parameters to apply.

TL;DR: In this article, the authors consider the case of random yield and diversification in two different inventory models, where two sources (suppliers) exist who ship an amount which is a random function of the amount requisitioned.

TL;DR: This paper presents a model of a simple integrated production-distribution system and examines its performance characteristics, and presents an algorithm for obtaining near-optimal solutions.

TL;DR: Two new approaches for priority derivation when preferences are expressed as interval judgments are explored, one based on a simulation approach and the other based on mathematical programming.

TL;DR: In this paper, the authors present a model for continuous multiobjective optimal design of a transportation network, which explicitly incorporates user equilibrium constraints and takes the form of a difficult nonlinear, nonconvex mathematical program.

TL;DR: This paper updates an earlier review of multiobjective network design and routing problems and addresses the variety of problems addressed, which reflects the importance and complexity of transportation network analysis.

TL;DR: A model-based approach to nonpreemptive multi-project management problems, based on a hierarchical two-stage decomposition of the planning and scheduling process, resulting in a hierarchy of integer programming models aimed at assisting the planners in understanding the interrelations among the allocation of resources, the timing of the activities, the cash flows.

TL;DR: In this paper, the authors analyzed the performance of constraint-expanded and multi-objective zero-one programming problems from facility siting and from other settings and analyzed for common features.

TL;DR: The traditional PPC concept and its critique is described, then the new PPC concepts which are available for practical application are reviewed together with OR models which are relevant to these new concepts.

TL;DR: This study presents and illustrates the DP optimizing procedure, which is easily seen to be still plagued by the ‘curse of dimensionality’ despite the drastic reduction in complexity, and presents an elementary approximating procedure which provides an upper bound on the optimum and is computationally more economical.

TL;DR: A model that allows for differentiating travellers by means of an attribute, ‘value-of-time’, that is continuously distributed over a real interval is designed and used to carry on a small numerical experiment that emphasizes the importance of considering continuously distributed values- of-time in the evaluation of toll highway projects.

TL;DR: An efficient and effective means of generating low cost schedules for multiple projects requiring multiple resources by developing a ‘cost-benefit’ scheduling policy which balances the marginal cost of delaying the start of an eligible activity with the marginal benefit of such a delay.

TL;DR: In this article, it was shown that this procedure is inefficient when multiple constrained resources exist and that linear-integer programming is a much better planning tool and comes closder to achieving the TOC goal of maximizing throughput.