Abstract
We consider a problem related to industrial production planning, namely the multi-product discrete lot-sizing and scheduling problem with sequence-dependent changeover costs. This combinatorial optimization is formulated as a mixed-integer linear program and solved to optimality by using a standard Branch & Bound procedure. However, the computational efficiency of such a solution approach relies heavily on the quality of the bounds used at each node of the Branch & Bound search tree. To improve the quality of these bounds, we propose a new family of multi-product multi-period valid inequalities and present both an exact and a heuristic separation algorithm which form the basis of a cutting-plane generation algorithm. We finally discuss preliminary computational results which confirm the practical usefulness of the proposed valid inequalities at strengthening the MILP formulation and at reducing the overall computation time.
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
References
Belvaux, G., Wolsey, L.A.: Modelling practical lot-sizing problems as mixed-integer programs. Manage. Sci. 47(7), 993–1007 (2001)
Buschkühl, L., Sahling, F., Helber, S., Tempelmeier, H.: Dynamic capacitated lot-sizing problems: classification and review of solution approaches. OR Spectrum 32, 231–261 (2010)
Ferreira, D., Clark, A.R., Almada-Lobo, B., Morabito, R.: Single-stage formulations for synchronized two-stage lot-sizing and scheduling in soft drink production. Int. J. Prod. Econ. 136, 255–265 (2012)
Fleischmann, B.: The discrete lot sizing and scheduling problem. Eur. J. Oper. Res. 44, 337–348 (1990)
Gicquel, C., Minoux, M., Dallery, Y.: On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. Oper. Res. Lett. 37, 32–36 (2009)
Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur. J. Oper. Res. 177, 1855–1875 (2007)
Jans, R., Degraeve, Z.: Modelling industrial lot sizing problems: a review. Ind. J. Prod. Res. 46(6), 1619–1643 (2008)
Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer Science, New York (2006)
Silva, C., Magalhaes, J.M.: Heuristic lot size scheduling on unrelated parallel machines with applications in the textile industry. Comput. Ind. Eng. 50, 79–89 (2006)
van Eijl, C.A., van Hoesel, C.P.M.: On the discrete lot-sizing and scheduling problem with Wagner-Whitin costs. Oper. Res. Lett. 20, 7–13 (1997)
Salomon, M., Solomon, M., van Wassenhove, L., Dumas, Y., Dauzère-Pérès, S.: Solving the discrete lotsizing and scheduling problem with sequence dependant set-up costs and set-up times using the travelling salesman problem with time windows. Eur. J. Oper. Res. 100, 494–513 (1997)
Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manage. Sci. 5(1), 89–96 (1958)
Acknowledgements
This work was funded by the French National Research Agency (ANR) through its program for young researchers (project ANR JCJC LotRelax).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gicquel, C., Minoux, M. (2015). Solving to Optimality a Discrete Lot-Sizing Problem Thanks to Multi-product Multi-period Valid Inequalities. In: Pinson, E., Valente, F., Vitoriano, B. (eds) Operations Research and Enterprise Systems. ICORES 2014. Communications in Computer and Information Science, vol 509. Springer, Cham. https://doi.org/10.1007/978-3-319-17509-6_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-17509-6_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-17508-9
Online ISBN: 978-3-319-17509-6
eBook Packages: Computer ScienceComputer Science (R0)