Displaying similar documents to “Bottleneck capacity expansion problems with general budget constraints”

MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

Nabil Absi, Safia Kedad-Sidhoum (2007)

RAIRO - Operations Research

Similarity:

We address a multi-item capacitated lot-sizing problem with setup times that arises in real-world production planning contexts. Demand cannot be backlogged, but can be totally or partially lost. Safety stock is an objective to reach rather than an industrial constraint to respect. The problem is NP-hard. We propose mixed integer programming heuristics based on a planning horizon decomposition strategy to find a feasible solution. The planning horizon is partitioned into several sub-horizons...

Variable Neighborhood Search for Solving the Capacitated Single Allocation Hub Location Problem

Maric, Miroslav (2013)

Serdica Journal of Computing

Similarity:

In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...

Multicriteria scheduling problems : a survey

V. T'kindt, J.-C. Billaut (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an...

Verified methods for computing Pareto sets: General algorithmic analysis

Boglárka G. Tóth, Vladik Kreinovich (2009)

International Journal of Applied Mathematics and Computer Science

Similarity:

In many engineering problems, we face multi-objective optimization, with several objective functions f₁,...,fₙ. We want to provide the user with the Pareto set-a set of all possible solutions x which cannot be improved in all categories (i.e., for which f j ( x ' ) ≥ f j ( x ) for all j and f j ( x ) > f j ( x ) for some j is impossible). The user should be able to select an appropriate trade-off between, say, cost and durability. We extend the general results about (verified) algorithmic computability of maxima locations to...

Comparing notions of approximation.

Mario Furnari, Antonio Massarotti (1988)

Stochastica

Similarity:

In this note we discuss some drawbacks of some approaches to the classification of NP-complete optimization problems. Then we analyze the Theory of Analytical Computational Complexity to gain some insight about the notions of approximation and approximate algorithms. We stress the different roles played by these notions within the theories of Analytical and Algebraic Complexity. We finally outline a possible strategy to capture a more useful notion of approximation which is inspired...