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.
[1]
Alf Kimms,et al.
Lot Sizing and Scheduling with Sequence Dependent Setup Costs and Times and Efficient Rescheduling O
,
2000
.
[2]
Horst Tempelmeier,et al.
Solving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
,
2009,
Comput. Oper. Res..
[3]
Abraham P. Punnen,et al.
The traveling salesman problem and its variations
,
2007
.
[4]
E. Lawler,et al.
Erratum: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization
,
1986
.
[5]
G. Reinelt.
The traveling salesman: computational solutions for TSP applications
,
1994
.
[6]
Knut Haase,et al.
Capacitated lot-sizing with sequence dependent setup costs
,
1996
.
[7]
Keld Helsgaun,et al.
An effective implementation of the Lin-Kernighan traveling salesman heuristic
,
2000,
Eur. J. Oper. Res..