Single machine multi-product capacitated lot sizing with sequence-dependent setups

dc.contributor.author Diego Klabjan en
dc.contributor.author Bernardo Almada-Lobo en
dc.contributor.author Maria Antónia Carravilla en
dc.contributor.author José Fernando Oliveira en
dc.date.accessioned 2017-11-16T12:30:30Z
dc.date.available 2017-11-16T12:30:30Z
dc.date.issued 2007 en
dc.description.abstract In 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.identifier.uri http://repositorio.inesctec.pt/handle/123456789/1547
dc.language eng en
dc.relation 1297 en
dc.relation 265 en
dc.relation 5428 en
dc.rights info:eu-repo/semantics/embargoedAccess en
dc.title Single machine multi-product capacitated lot sizing with sequence-dependent setups en
dc.type article en
dc.type Publication en
Files