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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gutin, G., & Punnen, A. (2002). The Traveling Salesman Problem and its variations. Boston: Kluwer.
Haase, K. (1996). Capacitated lot-sizing with sequence dependent setup costs. OR Spectrum, 18(1), 51–59.
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.
Helsgaun, K. (2000). An effective implementation of the Lin–Kernighan traveling salesman heuristic. European Journal of Operational Research, 126(1), 106–130.
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.
Reinelt, G. (1994). Lecture Notes in Computer Science: Vol. 840. The Traveling Salesman: Computational solutions for TSP applications. Berlin: Springer.
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.
Author information
Authors and Affiliations
Corresponding author
Rights 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
DOI: https://doi.org/10.1007/978-3-642-04247-8_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04246-1
Online ISBN: 978-3-642-04247-8
eBook Packages: Business and EconomicsBusiness and Management (R0)