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

Täydet tiedot

Bibliografiset tiedot

Päätekijät:	Willy Alves de Oliveira, Maristela Oliveira dos Santos
Aineistotyyppi:	Artigo
Kieli:	Inglês
Julkaistu:	Sociedade Brasileira de Matemática Aplicada e Computacional 2018-01-01
Sarja:	Trends in Computational and Applied Mathematics
Aiheet:	Lot Sizing Scheduling Mixed Integer Linear Programming Branch-and-Bound Algorithm
Linkit:	https://tcam.sbmac.org.br/tema/article/view/1065
Tagit:	Lisää tagi Ei tageja, Lisää ensimmäinen tagi!