Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
verfasst von : Celine Gicquel, Abdel Lisser
Erschienen in: Operations Research Proceedings 2011
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
We study a production planning problem known as the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs.We discuss two alternative QIP formulations for this problem and propose to compute lower bounds using a semidefinite relaxation of the problem rather than a standard linear relaxation. Our computational results show that for a certain class of instances, the proposed solution approach provides lower bounds of significantly better quality.