Please use this identifier to cite or link to this item: https://hdl.handle.net/10216/99182
Full metadata record
DC FieldValueLanguage
dc.creatorBernardo Almada Lobo
dc.creatorDiego Klabjan
dc.creatorMaria Antónia Carravilla
dc.creatorJosé F. Oliveira
dc.date.accessioned2022-09-16T07:56:31Z-
dc.date.available2022-09-16T07:56:31Z-
dc.date.issued2007
dc.identifier.issn0020-7543
dc.identifier.othersigarra:56439
dc.identifier.urihttps://hdl.handle.net/10216/99182-
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.
dc.language.isoeng
dc.rightsrestrictedAccess
dc.subjectEngenharia civil
dc.subjectCivil engineering
dc.titleSingle machine multi-product capacitated lot sizing with sequence-dependent setups
dc.typeArtigo em Revista Científica Internacional
dc.contributor.uportoFaculdade de Engenharia
dc.identifier.doi10.1080/00207540601094465
dc.identifier.authenticusP-004-DHR
dc.subject.fosCiências da engenharia e tecnologias::Engenharia civil
dc.subject.fosEngineering and technology::Civil engineering
Appears in Collections:FEUP - Artigo em Revista Científica Internacional

Files in This Item:
File Description SizeFormat 
56439.pdf
  Restricted Access
318.25 kBAdobe PDF    Request a copy from the Author(s)


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