Im Mittelpunkt der Serien- oder Sortenfertigung steht die Frage, wie häufig der Materialfluss unterbrochen werden muss und welche geschlossene Auftragsmenge eines Produktes jeweils hergestellt wird, es tritt also die Aufgabe auf, die kostenoptimierte Losgröße zu ermitteln. Lagerkosten,...

This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times. The key idea is to solve a series of mixed-integer programs in an iterative fix-and-optimize algorithm. Each of these programs is optimized...

This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production...

When similar patterns of expansion and contraction are observed across sectors, we call this a business cycle. Yet explaining the similarity and synchronization of these cycles across industries remains a puzzle. Whereas output growth across industries is highly correlated, identifiable shocks,...

The paper deals with the analysis of a special dynamic production and inventory model. In this model logical restrictions to fulfill an accepted constant minimal level of the production lot size are incorporated, instead of keeping setup cost in the objective function, as it is common in many...

This paper continues the analysis of a special uncapacitated single item lot sizing problem where a minimum order quantity restriction, instead of the setup cost, guarantees a certain level of production lots. A detailed analysis of the model and an investigation of the particularities of the...

This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is...