Fix and Relax Heuristic for a Stochastic Lot-Sizing Problem

Authors:
P. Beraldi;G. Ghiani;A. Grieco;E. Guerriero
Affiliations:
Dipartimento di Elettronica, Informatica e Sistemistica, Università degli Studi della Calabria, Rende (CS), Italy 87036;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, Lecce, Italy 73100;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, Lecce, Italy 73100;Dipartimento di Ingegneria dell'Innovazione, Università degli Studi di Lecce, Lecce, Italy 73100
Venue:
Computational Optimization and Applications
Year:
2006

Citing 5
Cited 3

A Multi-Stage Stochastic Integer Programming Approach for Capacity Expansion under Uncertainty

Journal of Global Optimization
Mathematical Programming Models and Formulations for Deterministic Production Planning Problems

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
An Approximation Scheme for Stochastic Integer Programs Arising in Capacity Expansion

Operations Research
A Branch-and-Price Algorithm for Multistage Stochastic Integer Programming with Application to Stochastic Batch-Sizing Problems

Management Science
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

A Lagrangian heuristic for satellite range scheduling with resource constraints

Computers and Operations Research
Relax-and-fix decomposition technique for solving large scale grid-based location problems

Computers and Industrial Engineering
Risk-averse two-stage stochastic programs in furniture plants

OR Spectrum

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses a particular stochastic lot-sizing and scheduling problem. The evolution of the uncertain parameters is modelled by means of a scenario tree and the resulting model is a multistage stochastic mixed-integer program. We develop a heuristic approach that exploits the specific structure of the problem. The computational experiments carried out on a large set of instances have shown that the approach provides good quality solutions in a reasonable amount of time.