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

TL;DR: This paper describes a multicut algorithm to carry out outer linearization of stochastic programs and presents experimental and theoretical justification for reductions in major iterations.

TL;DR: A graph-theoretic framework for large scale transit networks and new insight into the equilibrium traffic assignment methodology is provided and computational techniques for shortest hyperpaths suggested.

TL;DR: A new measure (degree) of consensus is proposed which is more human-consistent in the sense that it better reflects a real human perception of the essence of consensus in practice.

TL;DR: A stochastic model to describe the operation in time of a repairable system which is maintained by a general repair is developed and contains the minimal repair case in which repair restores a system to its functioning condition just prior to failure.

TL;DR: This new approach provides assistance to understand the conflictual aspects of the criteria and to tackle the problem of the weights associated to them to create geometrical representations for multicriteria decision problems.

TL;DR: In this article, a new approach to crew-pairing problems arising in the context of airline companies is proposed, in which the column generation subproblem is shown to be equivalent to a shortest path problem in an associated graph.

TL;DR: Modifications of the savings method are presented which show less CPU time and reduced storage requirements, therefore, the Savings method can be implemented on microcomputers.

TL;DR: The drive for total quality control has strongly enhanced the interest for performance indicators in many companies as mentioned in this paper and the main reason is that all efforts to increase "Customer Satisfaction" are sensible only if progress is measured.

TL;DR: Four major developments in the subject that have brought about change in system dynamics are reviewed, allowing modelers to create computer-based learning environments for policymakers to ‘play-with’ their knowledge of business and social systems and to debate policy and strategy change.

TL;DR: Three aspects of stability are discussed and it is proposed to construct stability intervals for the weights of either single criteria or groups of criteria to improve the stability of a wide class of MCDA methods.

TL;DR: Research and applications of expert systems in production planning and scheduling and relationship between expert system and operations research approaches are presented.

TL;DR: Gardenfors and Sahlin this article introduced the concept of Probability and Utility (PU) to Bayesian decision theory, and proposed a formalization of probability and utility.

TL;DR: In this paper, a lower bound for the capacitated warehouse location problem based upon lagrangean relaxation of a mixed-integer formulation of the problem is presented, together with problem reduction tests derived from both the original problem and the Lagrangan relaxation.

TL;DR: This paper model building evacuations by network flows with side constraints from variable arc capacities on some arcs which are functions of flows in incident arcs and proposes ‘greedy’ algorithms for solving these problems.

TL;DR: The AP-based lower bound on the optimal solution to ATSP is tightened by using some of the procedures given in [1]; a local search for improving the initial FSO is performed; it uses 3- and 4-changed based procedures.

TL;DR: In this article, the authors use the Delphi method and integrate it with the analytic hierarchy process to identify the organizational objectives and then to set priorities among them, based on a case study.

TL;DR: In this article, a model for regional solid waste management as a network flow problem is described, and a special purpose algorithm is developed for waste management and facility siting decisions in the Munich metropolitan area in the Federal Republic of Germany.

TL;DR: In this paper, the authors show that the discrepancies between the payoff table minimums and the minimums over the efficient set can often be large and that the field of multiple objective programming needs a better method than payoff tables for estimating the minimum criterion values over the Efficient Set.

TL;DR: A primal-dual reoptimization method which runs in pseudo-polynomial time is proposed which can solve problems with up to 2500 nodes and reduce the cost of repeatedly solving the shortest path problem with time windows.

TL;DR: A new visual interactive method for solving discrete multiple criteria problems based on the use of a reference direction, which is determined by the aspiration levels for the criteria specified by the decision maker, is proposed.

TL;DR: The problem of weight derivation is shown to be equivalent to that of finding a totally transitive matrix which is a minimum distance from the given matrix, and the uniqueness of the measure is proven.

TL;DR: In this paper, a general mathematical programming approach with four stages is proposed to determine the locations of transfer stations in a city with a population over 6 000 000, where the daily average of solid waste to be transferred is around 6 000 tons and disposal areas are at least 30 kilometres away from the metropolitan area.

TL;DR: Both exact and approximate methods are developed to solve the single machine scheduling problem where the objective is to minimize the total weighted earliness subject to no tardy jobs.

TL;DR: In this paper, the machine mix for a particular FMS, the number of machines performing each of three operations and any machine performing any of the three operations (flexible machines), is input to an FMS simulation, and the throughput predicted by the simulation is analyzed through two different regression models.

TL;DR: In this paper, a decision support system for capacity planning of container terminals is described, which combines a heuristic analysis of these models to a global model to study the interaction between the elements of a container terminal.

TL;DR: In this paper, a model is developed from which an algorithm is derived for an optimal discount schedule, assuming a single incremental discount system, and a numerical example is presented to illustrate the algorithm developed.

TL;DR: The purpose of this paper is to analyse essential features of the maintenance scheduling problem, including imposed constraints and various objectives, and to present the results of the research work done in this field using operational research methods.

TL;DR: This paper gives the author's views on the kind of computer-based modeling environment needed to properly support management science/operations research work, and on the design challenges that need to be met in order to bring such modeling environments into being.

TL;DR: A multicommodity, capacitated distribution planning model as anon-linear, mixed integer program that incorporates strategic decisions on fleet makeup and vehicle numbers of each type is formulated.