The Capacitated Problem

  • Marc Salomon
Part of the Lecture Notes in Economics and Mathematical Systems book series (LNE, volume 355)


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.


Simulated Annealing Tabu Search Product Structure Simulated Annealing Algorithm Production Schedule 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Marc Salomon
    • 1
  1. 1.Rotterdam School of ManagementErasmus UniversityRotterdamThe Netherlands

Personalised recommendations