Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDiego Klabjanen
dc.contributor.authorBernardo Almada-Loboen
dc.contributor.authorMaria Antónia Carravillaen
dc.contributor.authorJosé Fernando Oliveiraen
dc.description.abstractIn production planning in the glass container industry, machine-dependent setup times and costs are incurred for switch overs from one product to another. The resulting multi-item capacitated lot-sizing problem has sequence-dependent setup times and costs. We present two novel linear mixed-integer programming formulations for this problem, incorporating all the necessary features of setup carryovers. The compact formulation has polynomially many constraints, whereas the stronger formulation uses an exponential number of constraints that can be separated in polynomial time. We also present a five-step heuristic that is effective both in finding a feasible solution (even for tightly capacitated instances) and in producing good solutions to these problems. We report computational experiments.en
dc.titleSingle machine multi-product capacitated lot sizing with sequence-dependent setupsen
Appears in Collections:CESE - Articles in International Journals

Files in This Item:
File Description SizeFormat 
  Restricted Access
599.26 kBAdobe PDFView/Open Request a copy

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.