A New Branching Rule to Solve the Capacitated Lot Sizing and Scheduling Problem with Sequence Dependent Setups

In this paper, we deal with the Capacitated Lot Sizing and Scheduling Problem with sequencedependent setup times and costs - CLSD model. More specifically, we propose a simple reformulation for the CLSD model that enables us to define a new branching rule to be used in Branch-and-Bound (or Branch-an...

Descripció completa

Dades bibliogràfiques

Autors principals:	Willy Alves de Oliveira, Maristela Oliveira dos Santos
Format:	Artigo
Idioma:	Inglês
Publicat:	Sociedade Brasileira de Matemática Aplicada e Computacional 2018-01-01
Col·lecció:	Trends in Computational and Applied Mathematics
Matèries:	Lot Sizing Scheduling Mixed Integer Linear Programming Branch-and-Bound Algorithm
Accés en línia:	https://tcam.sbmac.org.br/tema/article/view/1065
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!