A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs
[chapter]
2012
Operations Research Proceedings
To cite this version: Céline Gicquel, Abdel Lisser, Michel Minoux. Tight lower bounds by semidefinite relaxation for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. 9th International ABSTRACT: We study a production planning problem known as the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. This optimization problem can be formulated as a quadratic integer program. In the present paper, we propose to compute a tight
doi:10.1007/978-3-642-29210-1_67
dblp:conf/or/GicquelL11
fatcat:l4u3qofn3jea5h6xduuebswlvq