Skip to main content

MIP-Based Heuristics for Capacitated Lot-Sizing with Sequence-Dependent Setups and Substitutions

  • Chapter
  • First Online:
Production and Inventory Management with Substitutions

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 636))

  • 2283 Accesses

Abstract

In this section, we consider a single-level capacitated lot-sizing problem with substitutions and sequence-dependent setups. The model was designed to map the industrial optimization problem in windshield interlayer production planning described in Sect. 3.1. Rather than building a specific model for this application, we aimed at devising a model and appropriate solution approach for a more general model that can capture the characteristics of this application as well as those of similar production planning problems. Why should it make sense to consider substitutions and sequence-dependent changeovers in one model, rather than treating each of the two aspects in separate subproblems that decompose the overall problem? The idea is that substitutions affect the optimal production sequencing and vice versa, as it might be beneficial to save setup times by refraining from producing certain products and substituting them by others, at least in some settings. This reduces the time spent with “worthless” changeovers, and thereby increases the total capacity available for production.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

References

  • Gutin, G., & Punnen, A. (2002). The Traveling Salesman Problem and its variations. Boston: Kluwer.

    Google Scholar 

  • Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spectrum, 18(1), 51–59.

    Google Scholar 

  • Haase, K., & Kimms, A. (2000). Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of Production Economics, 66(2), 159–169.

    Article  Google Scholar 

  • Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106–130.

    Article  Google Scholar 

  • Lawler, E., Lenstra, J. K., Kan, A. H. G. R., & Shmoys, D. B. (1985). The Traveling Salesman Problem: A guided tour of combinatorial optimization. Wiley Series in Discrete Mathematics & Optimization. New York: Wiley.

    Google Scholar 

  • Reinelt, G. (1994). Lecture Notes in Computer Science: Vol. 840. The Traveling Salesman: Computational solutions for TSP applications. Berlin: Springer.

    Google Scholar 

  • Sahling, F., Buschkühl, L., Tempelmeier, H., & Helber, S. (2009). Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a Fix-and-Optimize heuristic. Computers & Operations Research, 36(9), 2546–2553.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to J. Christian Lang .

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Lang, J.C. (2010). MIP-Based Heuristics for Capacitated Lot-Sizing with Sequence-Dependent Setups and Substitutions. In: Production and Inventory Management with Substitutions. Lecture Notes in Economics and Mathematical Systems, vol 636. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04247-8_6

Download citation

Publish with us

Policies and ethics