scispace - formally typeset
Search or ask a question
Author

Lisbeth Buschkühl

Bio: Lisbeth Buschkühl is an academic researcher from University of Cologne. The author has contributed to research in topics: Heuristic (computer science) & Job shop scheduling. The author has an hindex of 5, co-authored 5 publications receiving 494 citations.

Papers
More filters
Journal ArticleDOI
TL;DR: A review of four decades of research on dynamic lot-sizing with capacity constraints shows that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice.
Abstract: This paper presents a review of four decades of research on dynamic lot-sizing with capacity constraints. We discuss both different modeling approaches to the optimization problems and different algorithmic solution approaches. The focus is on research that separates the lot-sizing problem from the detailed sequencing and scheduling problem. Our conceptional point of reference is the multi-level capacitated lot-sizing problem (MLCLSP). We show how different streams of research emerged over time. One result is that many practically important problems are still far from being solved in the sense that they could routinely be solved close to optimality in industrial practice. Our review also shows that currently mathematical programing and the use of metaheuristics are particularly popular among researchers in a vivid and flourishing field of research.

270 citations

Journal ArticleDOI
TL;DR: In this paper, a fix-and-optimize algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L) is presented.

166 citations

Journal ArticleDOI
TL;DR: A new model formulation for the dynamic multi-level capacitated lotsizing problem with linked lotsizes is introduced and a Lagrangean heuristic is developed and tested in a numerical experiment with a set of invented data and a data set taken from industry.
Abstract: In this paper, a new model formulation for the dynamic multi-level capacitated lotsizing problem with linked lotsizes is introduced. Linked lotsizes means that the model formulation correctly accounts for setup carryovers between adjacent periods if production of a product is continued in the next period. This model formulation is a good compromise between the big-bucket and small-bucket model formulation in that it inherits the stability of a big-bucket model and at least partially includes the precise description of setup operations provided by a small-bucket model. A Lagrangean heuristic is developed and tested in a numerical experiment with a set of invented data and a data set taken from industry. The solutions found show a good quality.

46 citations

Journal ArticleDOI
TL;DR: A new solution approach to a lotsizing and scheduling problem which explicitly includes the simultaneous consideration of a common setup operator is proposed, and significant reductions in setup costs as well as feasible production schedules without backorders are achievable.

44 citations

Posted Content
TL;DR: A new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs is presented.
Abstract: 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 orders in the sense that the first and the last product produced in a period are determined by the model. We solve a model which is applicable to general bill-of-material structures and which includes minimum lead times of one period and multi-period setup carry-overs. Our algorithm solves a series of mixed-integer linear programs in an iterative so-called Fix-and-Optimize approach. In each instance of these mixed-integer linear programs a large number of binary setup variables is fixed whereas only a small subset of these variables is optimized, together with the complete set of the inventory and lot size variables. A numerical study shows that the algorithm provides high-quality results and that the computational effort is moderate.

22 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: This paper presents an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times and its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler.

168 citations

Journal ArticleDOI
TL;DR: In this paper, a fix-and-optimize algorithm for the dynamic multi-level capacitated lot sizing problem with setup carry-overs (MLCLSP-L) is presented.

166 citations

Journal ArticleDOI
TL;DR: This paper provides a survey of literature reviews in the area of lot sizing to show which streams of research emerged from Harris' seminal lot size model, and which major achievements have been accomplished in the respective areas.

166 citations

Posted Content
TL;DR: In this article, an optimization-based solution approach for the dynamic multi-level capacitated lot sizing problem (MLCLSP) with positive lead times is presented. But the solution quality is not as good as those of Tempelmeier/Derstroff and Stadtler.
Abstract: 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 over all real-valued variables, but only a small subset of binary setup variables The remaining binary setup variables are tentatively fixed to values determined in previous iterations The resulting algorithm is transparent, flexible, accurate and relatively fast Its solution quality outperforms those of the approaches by Tempelmeier/Derstroff and by Stadtler

153 citations

Journal ArticleDOI
TL;DR: A classification scheme is introduced, the historical development of research in this area is reviewed, the identification of recent trends are identified and the main contribution of the present review is the discussion of the historicalDevelopment of the body of knowledge.
Abstract: The current paper presents a structured overview over the literature on dynamic simultaneous lotsizing and scheduling problems. We introduce a classification scheme, review the historical development of research in this area and identify recent developments. The main contribution of the present review is the discussion of the historical development of the body of knowledge in the field of simultaneous lotsizing and scheduling and the identification of recent trends. This helps to reveal research opportunities, but it can also be helpful in the selection of appropriate models for industrial applications.

144 citations