Skip to main content

2008 | Buch

Multi-Level Capacitated Lotsizing with Setup Carryover

insite
SUCHEN

Über dieses Buch

Lotsizing problems are found in every company, which produces various items on resources with scarce capacities. In general, the objective is to find production plans, which meet demand with the resources` given capacities and at minimal costs. However, there is a great variety of company-specific lotsizing problems due to the complexity of the underlying production processes. Both standard MRP-systems and modern Advanced Planning Systems fail to provide adequate solutions. Instead, they most often compute production plans, which are not feasible in practice.
In this book new lotsizing models are presented for multi-stage production systems with general product structures, dynamic demand, setup times and lead times. They are extended to cover production on parallel machines. An iterative solution procedure is presented, which generates feasible production plans within seconds of computation time.
Potential readership includes scholars of supply chain management and production planning, interested students in these areas as well as practitioners involved in production planning.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Introduction and Outline
Abstract
Lotsizing problems are found in every company, which produces various items on a given set of resources with scarce capacities. In general the objective is to find a production plan, which meets demand with the resources’ given capacities and at minimal costs. However, the specific lotsizing problem is highly dependent on the characteristics of the underlying production process.
Lisbeth Buschkühl
Chapter 2. Literature Review
Abstract
Research on lotsizing is extensive. Therefore, we will restrain our review to the class of models, to which the MLCLSPL introduced later belongs, i. e. to dynamic big-bucket capacitated lotsizing problems of the CLSP type. For further research on lotsizing we refer to the numerous existing reviews. These include Bahl et al. (1987), who introduce and cover subsets of unconstrained and constrained single- and multi-level lotsizing.
Lisbeth Buschkühl
Chapter 3. Test Instances
Abstract
In order to evaluate the different model formulations presented in chapter D, as well as the parameter combinations and the performance of the overall heuristic presented in chapter F, we introduce a set of new test instances. Similar to e. g. Derstroff (1995) and Sürie (2005b) we generated various differing instances as to diminish the effect of the characteristics of the test set on the results.
Lisbeth Buschkühl
Chapter 4. Model Formulations
Abstract
In this chapter we will present model formulations for the MLCLSPL with single setup carryover, with consecutive setup carryover and with parallel (identical) machines.
Lisbeth Buschkühl
Chapter 5. Solution Procedure based on Lagrangean Relaxation
Abstract
Lagrangean relaxation based heuristics have been presented in section B.3.2. The basic idea is to solve a complex optimization problem with the help of more easily tractable subproblems. To do so, complicating constraints of the original (primal) problem are relaxed and accounted for through a penalty cost term - the Lagrangean multipliers - in the objective function.
Lisbeth Buschkühl
Chapter 6. Computational Study
Abstract
Our computational tests were carried out on the instances presented in chapter C. To evaluate the performance of our heuristic, we used the benchmark results described in section D.1.5.
Lisbeth Buschkühl
Chapter 7. Conclusions and Future Work
Abstract
In this work, we presented new model formulations for the well-known MLC- SLP with setup time and positive lead time, which also account for setup carryovers and parallel machines. We presented different reformulations as well as a heuristic solution procedure.
Lisbeth Buschkühl
Backmatter
Metadaten
Titel
Multi-Level Capacitated Lotsizing with Setup Carryover
verfasst von
Dr. Lisbeth Buschkühl
Copyright-Jahr
2008
Electronic ISBN
978-3-658-24034-9
Print ISBN
978-3-658-24033-2
DOI
https://doi.org/10.1007/978-3-658-24034-9