Skip to main content
SpringerLink
Log in

A cutting plane approach to capacitated lot-sizing with start-up costs

  • Published:
Mathematical Programming Submit manuscript

Abstract

We consider a mixed integer model for multi-item single machine production planning, incorporating both start-up costs and machine capacity. The single-item version of this model is studied from the polyhedral point of view and several families of valid inequalities are derived. For some of these inequalities, we give necessary and sufficient facet inducing conditions, and efficient separation algorithms. We use these inequalities in a cutting plane/branch and bound procedure. A set of real life based problems with 5 items and up to 36 periods is solved to optimality.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. Barany, T. van Roy and L. Wolsey, “Strong formulations for multi-item capacitated lot-sizing”,Management Science 30 (1984) 1255–1261.

    MATH  MathSciNet  Google Scholar 

  2. I. Barany, T. van Roy and L. Wolsey, “Uncapacitated lot-sizing: The convex hull of solutions”,Mathematical Programming Study 22 (1984) 32–43.

    MATH  Google Scholar 

  3. M. Constantino, “A polyhedral approach to production planning models: Start-up costs and times, upper and lower bounds on production”, Ph.D. Thesis, Université Catholique de Louvain Belgium, 1995.

    Google Scholar 

  4. S. van Hoesel, A. Wagelmand and L. Wolsey, “Polyhedric characterization of economic lot-sizing with start-up costs”,SIAM Journal of Discrete Mathematics 7 (1994) 141–151.

    Article  MATH  Google Scholar 

  5. U. Karmarkar and L. Schrage, “The deterministic dynamic product cycling problem”,Operations Research 33 (1985) 326–345.

    MATH  Google Scholar 

  6. J. Leung, T. Magnanti and R. Vachani, “Facets and algorithms for capacitated lot-sizing”,Mathematical Programming 45 (1989) 331–359.

    Article  MATH  MathSciNet  Google Scholar 

  7. T. Magnanti and R. Vachani, “A strong cutting plane algorithm for production scheduling with changeover costs”,Operations Research 38 (1990) 456–473.

    MATH  MathSciNet  Google Scholar 

  8. Y. Pochet and L. Wolsey, “Solving multi-item lot-sizing problems using strong cutting planes”,Management Science 37 (1991) 53–67.

    MATH  Google Scholar 

  9. Y. Pochet, “Valid inequalities and separation for capacitated economic lot-sizing,”Operations Research Letters 7 (1988) 109–116.

    Article  MATH  MathSciNet  Google Scholar 

  10. Y. Pochet and L. Wolsey, “Lot-sizing with constant batches: Formulation and valid inequalities”,Mathematics of Operations Research 18 (1993) 767–785.

    MATH  MathSciNet  Google Scholar 

  11. Y. Pochet and L. Wolsey, “Polyhedra for lot-sizing with Wagner-Whitin costs”,Mathematical Programming 67 (1994) 297–323.

    Article  MathSciNet  Google Scholar 

  12. L. Wolsey, “Uncapacitated lot-sizing with start-up costs”.Operations Research 37 (1989) 741–747.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Miguel Constantino

    Present address: DEIO, Universidade de Lisboa, Bloco C2, Campo Grande, 1700, Lisboa, Portugal

Authors and Affiliations

  1. CORE, Université Catholique de Louvain, 1348, Louvain-la-Neuve, Belgium

    Miguel Constantino

Authors
  1. Miguel Constantino
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Supported by Fundação Calouste Gulbenkian and Junta Nacional de Investigação Científica e Tecnológica. Research supported in part by Science Program SC1-CT91-620 of the EEC and contract No. 26 of the program “Pôle d'attraction interuniversitaire” of the Belgian Government.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Constantino, M. A cutting plane approach to capacitated lot-sizing with start-up costs. Mathematical Programming 75, 353–376 (1996). https://doi.org/10.1007/BF02592189

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02592189

Keywords

Search

Navigation