QR Code

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

Full description

Saved in:
Main Authors: Willy Alves de Oliveira, Maristela Oliveira dos Santos
Format: Artigo
Language:Inglês
Published: Sociedade Brasileira de Matemática Aplicada e Computacional 2018-01-01
Series:Trends in Computational and Applied Mathematics
Subjects:
Lot Sizing
Scheduling
Mixed Integer Linear Programming
Branch-and-Bound Algorithm
Online Access:https://tcam.sbmac.org.br/tema/article/view/1065
Tags: Add Tag
No Tags, Be the first to tag this record!

Similar Items