Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benajam, W, 2005. Relaxations semid´efinies pour les problemes d’affectation de fr´equences dans les r´eseaux mobiles et de l’affectation quadratique, PhD thesis, Laboratoire de Recherche en Informatique, Orsay, France.
Bilde O. and Krarup J., 1977. Sharp lower bounds and efficient algorithms for the simple plant location problem. Annals of Discrete Mathematics, 1, 79-97, 1977.
Borchers B, 1999. CSDP, A C Library for Semidefinite Programming. Optimization Methods and Software, 11(1), 613-623.
Eppen G.D. and Martin R.K, 1987. Solving multi-item capacitated lot-sizing problems using variable redefinition. Operations Research, 35(6), 832-848.
Fleischmann B., 1990. The discrete lot sizing and scheduling problem. European Journal of Operational Research, 44, 337-348.
Gicquel C., Miegeville N., Minoux M. and Dallery Y., 2009. Discrete lot-sizing and scheduling using product decomposition into attributes. Computers and Operations Research,36, 2690-2698.
Helmberg C, 2002. Semidefinite programming. European Journal of Operational Research, 137 (3), 461-482.
Jans R. and Degraeve Z., 2007. Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, European Journal of Operational Research, 177, 1855-1875.
Pochet Y. and Wolsey L.A., 2006. Production planning by mixed integer programming, Springer Science.
van Eijl C.A. and van Hoesel C.P.M., 1997. On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs, Operations Research Letters 20, 7-13..
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gicquel, C., Lisser, A. (2012). Tight lower bounds by semidefinite relaxations for the discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. In: Klatte, D., Lüthi, HJ., Schmedders, K. (eds) Operations Research Proceedings 2011. Operations Research Proceedings. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29210-1_67
Download citation
DOI: https://doi.org/10.1007/978-3-642-29210-1_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29209-5
Online ISBN: 978-3-642-29210-1
eBook Packages: Business and EconomicsBusiness and Management (R0)