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

TL;DR: A heuristic algorithm is stated that improves a public transportation network using the average transportation cost as the objective and some experiences with real world problems are reported.

TL;DR: This paper gives a comparison of three different procedures for designing a suitable heuristic for solving the problem of a combined location/routing problem in the process of distributing newspapers.

TL;DR: A taxonomy of trim-loss and trim-cutting problems can be found in this paper, where a variety of methods, both exact and heuristic, have been applied to these problems.

TL;DR: A pseudo-polynomial algorithm is given to enumerate all these efficient points to minimize the holding cost and the maximum tardiness of n jobs to be sequenced on a single machine.

TL;DR: In this paper, a method for strengthening cutting planes for pure and mixed integer programs is presented, which improves the coefficients of the integer-constrained variables, while leaving unchanged those of the continuous variables.

TL;DR: A number of new location models which utilize the notion of coverage were developed in a study of the Baltimore City Fire Protection system, augment the typical analysis to include multiple performance criteria such as population and property value coverage.

TL;DR: This paper treats multicriteria questions in the framework of a model for selecting a subset of M sites at which to establish public facilities in order to serve client groups located at N distinct points and shows that for some combinations of specific criteria, parametric solutions of a generalized assignment problem (GAP) will yield all efficient solution.

TL;DR: This paper defines a heuristic method as a procedure for solving a well-defined mathematical problem by an intuitive approach in which the structure of the problem can be interpreted and exploited intelligently to obtain a reasonable solution.

TL;DR: In this paper, game theoretic relations between families of games and linear programs are established by means of a family of games related to a linear programming problem, and the games-to-programming relations also open new possibilities for further relations.

TL;DR: In this paper, the authors briefly sketch Saaty's priority theory which has been developed to assign weights (priorities) to a multiple of decision criteria via pairwise comparison of the criteria.

TL;DR: In this article, a branch-and-bound algorithm is presented for the permutation flow-shop problem, in which the objective is to minimize the maximum completion time, and a branching procedure is used in which jobs both at the beginning and at the end of the schedule have been fixed.

TL;DR: This paper critically evaluates past contributions to the problem, suggests that the objective of analysis of the network is a determining factor in the process of measurement, and proposes the form of the measure of network complexity for each objective.

TL;DR: This paper presents a branch and bound scheme for the solution of the zero-one multiple knapsack problem and algorithms are obtained by utilizing different branching strategies and bounding procedures.

TL;DR: In this paper the computational complexity of spanning tree problems is studied with the aim of identifying a borderline between easy and hard problems.

TL;DR: In this article, the computational complexity of deterministic sequencing problems with chain-like precedence constraints was investigated, and it was established that the problem is NP-hard for the cases in which the number of late jobs or the total weighted tardiness is to be minimized.

TL;DR: In this paper, a branch and bound procedure is used to find the global optimum for a class of network flow problems with concave costs, where the enumeration scheme is based on a characterization of the optimal solution set, while linear relaxations of the original problem provide lower bounds.

TL;DR: In this article, the authors solved the machine interference problem in a G/M/r model, where repair times are assumed to follow a negative exponential distribution, and running times for each of the machines are independently and identically distributed.

TL;DR: In this paper, the marginal cost of a planned replacement in terms of the policy parameter is defined and computed for any one of these policies, with respect to two common objective functions: the expected cost per unit time and the expected total discounted costs, and the existence of a unique finite solution.

TL;DR: In this paper, a process orientation is adopted as an alternative to an end-oriented view of effectiveness, and twelve attributes of effectiveness for strategic planning systems are proposed, including the following:

TL;DR: In this paper, a branch and bound algorithm is presented to produce the global optimal schedule by using elimination rules obtainable from theorems, which eliminate branching to a significant extent.

TL;DR: In this paper, a modification to the classical EOQ formula is presented, which takes into account the disproportionate change in cost that may be incurred in holding stocks, as the average value of the stock held increases.

TL;DR: A theorem, which enables the determination of the necessary and sufficient conditions for the feasibility of jobs sequences, is proposed and an iterative procedure is presented which permits to define the characteristics of the feasible schedules.

TL;DR: A discrete event interactive simulation system which allows a user to watch the progress of a simulation model on a visual display terminal and interact with the model in a flexible manner, in order to explore the consequence of alternative decisions or strategies.

TL;DR: A technique for dividing the policy space into regions of optimal { v, N } is developed so that the best strategy for any combination of costs is immediately visible to the decision maker.

TL;DR: This article points out the analogy of the dynamic lot size problem to a certain vehicle scheduling problem and obtains by analogy a simple heuristic algorithm for the dynamic lots size problem.

TL;DR: Exact and approximate bounds for the mean blocking time in exponential open queue networks with finite intermediate waitingroom and the condition for stability in the two-stage networks are derived.

TL;DR: In this article, a bounding technique based on the extraction from the Koopmans Beckmann quadratic assignment (QAP) formulation is proposed to solve a large linear assignment problem (which can then be solved optimally), leaving as a residual problem as small as possible.

TL;DR: An interactice, computer based procedure for solving the variant of the vehicle loading problem encountered when loading containers and pallets into an aircraft is described.