Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Combinatorial Optimization

ISCO 2016: Combinatorial Optimization pp 123–134Cite as

MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover

  • Conference paper
  • First Online:

  • 1015 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9849))

Abstract

A rich lot-sizing problem is studied in this manuscript which comes from a real-world application. Our new lot-sizing problem combines several features, i.e., parallel machines, production time windows, backlogging, lost sale and setup carryover. Three mixed integer programming formulations are proposed. We theoretically and computationally compare these different formulations, testing them on real-world and randomly generated instances. Our study is the first step for efficiently tackling and solving this challenging real-world lot-sizing problem.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Absi, N., Kedad-Sidhoum, S., Dauzère-Pérès, S.: Uncapacitated lot-sizing problem with production time windows, early productions, backlogs and lost sales. Int. J. Prod. Res. 49(9), 2551–2566 (2011)

    Article  MATH  Google Scholar 

  2. Brahimi, N., Dauzère-Pérès, S., Wolsey, L.A.: Polyhedral and lagrangian approaches for lot sizing with production time windows and setup times. Comput. Oper. Res. 37(1), 182–188 (2010)

    Article  MATH  Google Scholar 

  3. Dauzère-Pérès, S., Brahimi, N., Najid, N., Nordli, A.: The single-item lot sizing problem with time windows. Technical report 02/4/AUTO, École des Mines de Nantes, France (2002)

    Google Scholar 

  4. Dillenberger, C., Escudero, L.F., Wollensak, A., Zhang, W.: On solving a large-scale resource allocation problem in production planning. In: Fandel, G., Gulledge, T., Jones, A. (eds.) Operations Research in Production Planning and Control, pp. 105–119. Springer, Heidelberg, Berlin (1993)

    Chapter  Google Scholar 

  5. Fiorotto, D.J., Araujo, S.A.D.: Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines. Ann. Oper. Res. 217(1), 213–231 (2014)

    MathSciNet  MATH  Google Scholar 

  6. Gopalakrishnan, M.: A modified framework for modelling set-up carryover in the capacitated lotsizing problem. Int. J. Prod. Res. 38(14), 3421–3424 (2000)

    Article  MATH  Google Scholar 

  7. Gören, H.G., Tunal, S.: Solving the capacitated lot sizing problem with setup carryover using a new sequential hybrid approach. Appl. Intell. 42(4), 805–816 (2015)

    Article  Google Scholar 

  8. Haase, K.: Lotsizing and Scheduling for Production Planning. LNEM, vol. 408. Springer, Berlin (1994)

    MATH  Google Scholar 

  9. Hwang, H.: Dynamic lot-sizing model with production time windows. Nav. Res. Log. 54(6), 692–701 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mittelmann, H.D., Pruessner, A.: A server for automated performance analysis of benchmarking data. Optim. Method Softw. 21(1), 105–120 (2006)

    Article  MATH  Google Scholar 

  11. Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)

    MATH  Google Scholar 

  12. Sandbothe, R.A., Thompson, G.L.: A forward algorithm for the capacitated lot size model with stockouts. Oper. Res. 38(3), 474–486 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  13. Sox, C.R., Gao, Y.: The capacitated lot sizing problem with setup carry-over. IIE Trans. 31(2), 173–181 (1999)

    Google Scholar 

  14. Suerie, C., Stadtler, H.: The capacitated lot-sizing problem with linked lot sizes. Manage. Sci. 49(8), 1039–1054 (2003)

    Article  MATH  Google Scholar 

  15. Toledo, F.M.B.: Dimensionamento de Lotes em Máquinas Paralelas. Tese (Doutorado), Faculdade de Engenharia Elétrica e Computaç\(\tilde{a}\)o, Universidade Estadual de Campinas, Campinas (1998)

    Google Scholar 

  16. Toledo, F.M.B., Armentano, V.A.: A lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines. Eur. J. Oper. Res. 175(2), 1070–1083 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  17. Wolsey, L.A.: Lot-sizing with production and delivery time windows. Math. Program. 107(3), 471–489 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  18. Zangwill, W.I.: A backlogging model and a multi-echelon model of a dynamic economic lot size production system - a network approach. Manage. Sci. 15(9), 506–527 (1969)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DecisionBrain, 18 rue Yves Toudic, 75010, Paris, France

    Filippo Focacci, Daniel Godard & Xueying Shen

  2. PSL, CNRS, LAMSADE UMR 7243, Université Paris-Dauphine, 75775, Paris Cedex 16, France

    Fabio Furini, Virginie Gabrel & Xueying Shen

Authors
  1. Filippo Focacci
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabio Furini
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Virginie Gabrel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Daniel Godard
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xueying Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fabio Furini .

Editor information

Editors and Affiliations

  1. University of Salerno , Fisciano, Italy

    Raffaele Cerulli

  2. Kyoto University , Kyoto, Japan

    Satoru Fujishige

  3. LAMSADE, Université Paris-Dauphine , Paris , France

    A. Ridha Mahjoub

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Focacci, F., Furini, F., Gabrel, V., Godard, D., Shen, X. (2016). MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover. In: Cerulli, R., Fujishige, S., Mahjoub, A. (eds) Combinatorial Optimization. ISCO 2016. Lecture Notes in Computer Science(), vol 9849. Springer, Cham. https://doi.org/10.1007/978-3-319-45587-7_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-45587-7_11

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-45586-0

  • Online ISBN: 978-3-319-45587-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation