In this paper, a case study is carried out concerning the lot-sizing problem involving a single item production planning in several production centers that do not present capacity constraints. Demand can be met with backlogging or not. This problem results from simplifying practical problems, such as the material requirement planning (MRP) system and also lot-sizing problems with multiple items and limited production capacity. First we propose an efficient implementation of a forward dynamic programming algorithm for problems with one single production center. Although this does not reduce its complexity, it has shown to be rather effective, according to computational tests. Next, we studied the problem with a production environment composed of several production centers. For this problem two algorithms are implemented, the first one is an extension of the dynamic programming algorithm for one production center and the second one is an efficient implementation of the first algorithm. Their efficiency are shown by computational testing of the algorithms and proposals for future research are presented.
Lot-sizing problem with several production centers
