Displaying similar documents to “Rounding Strategies for Mixed Integer Programs Arising from Chemical Production Planning”

Strategies for LP-based solving a general class of scheduling problems.

Laureano F. Escudero, Gloria Pérez Sáinz de Rozas (1990)

Trabajos de Investigación Operativa

Similarity:

In this work we describe some strategies that have been proved to be very efficient for solving the following type of scheduling problems: Assume a set of jobs is to be performed along a planning horizon by selecting one from several alternatives for doing so. Besides selecting the alternative for each job, the target consists of choosing the periods at which each component of the work will be done, such that a set of scheduling and technological constraints is satisfied. The problem...

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...