Abstract
In this chapter the multilevel capacitated lotsizing problem (MLCLP) is considered. This problem, which was originally stated by Billington et al. [16] in 1983, occurs when production schedules have to be determined for multilevel production-inventory systems in the presence of capacity constraints on production facilities. It is assumed that time-phased demand is dynamic and deterministic, while backlogging is not allowed. The objective is to determine a time-phased production schedule for end items as well as for components, such that the sum of item-dependent setup costs and item-dependent inventory holding costs is minimized, while period-dependent capacity limitations must not be violated. The problems studied in this chapter are restricted in that neither setup times nor overtime work are considered. Furthermore, as in a second paper by Billington [15], it is assumed that only one bottleneck exists, which is situated at a single level in the product structure.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Salomon, M. (1991). The Capacitated Problem. In: Deterministic Lotsizing Models for Production Planning. Lecture Notes in Economics and Mathematical Systems, vol 355. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-51649-8_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-51649-8_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53701-4
Online ISBN: 978-3-642-51649-8
eBook Packages: Springer Book Archive