Author(s): Duarte, António ; Carvalho, J.M. Valério de
Date: 2015
Persistent ID: http://hdl.handle.net/10198/17145
Origin: Biblioteca Digital da UPB
Subject(s): Applied mathematics; Optimization; Systems theory
Document details
A column generation approach to the discrete lot sizing and scheduling problem on parallel machines
Description
In this work, we study the discrete lot sizing and scheduling problem (DSLP) in identical parallel resources with (sequence-independent) setup costs and inventory holding costs. We propose a Dantzig-Wolfe decomposition of a known formulation and describe a branch-and-price and column generation procedure to solve the problem to optimality. The results show that the lower bounds provided by the reformulated model are stronger than the lower bounds provided by the linear programming (LP) relaxation of the original model.
Document Type
Conference paper
Language Portuguese
Contributor(s) Biblioteca Digital da UPB
CC Licence
Language Portuguese
Contributor(s) Biblioteca Digital da UPB
CC Licence
