Discrete lot sizing and scheduling on parallel machines: description of a column generation approach

Duarte, António; Carvalho, J.M. Valério de

http://hdl.handle.net/10198/10778

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ProceedingsPagOf.pdf		1.99 MB	Adobe PDF	Download

Send Feedback

Authors

Duarte, António

Carvalho, J.M. Valério de

Abstract(s)

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

Keywords

DLSP Lot sizing Scheduling Setup costs Column generation Branch-and-price

URI

http://hdl.handle.net/10198/10778

Citation

Duarte, António J.S.T.; Carvalho, J.M. Valério de (2013). Discrete lot sizing and scheduling on parallel machines: description of a column generation approach. In IO2013 - XVI Congresso da Associação Portuguesa de Investigação Operacional. Bragança. p.126-134