An <i>O</i>(<i>T</i>²) Algorithm for the <i>NI</i>/<i>G</i>/<i>NI</i>/<i>ND</i> Capacitated Lot Size Problem

In this paper, we study a class of the capacitated dynamic lot size problem, where, over time, the setup costs are nonincreasing, the unit holding costs have arbitrary pattern, the unit production costs are nonincreasing and the capacities are nondecreasing. We investigate the properties of the optimal solution for the problem and develop the concept of candidate subplan. It is proven that only the candidate subplans need to be examined in searching for an optimal solution. A dynamic programming algorithm, incorporating the concept of candidate subplan, is then devised which has run time complexity of O(T 2 ).

• 저널Management Science · 34(3) · 420–426
• 토픽Supply Chain and Inventory Management · Management Information Systems
• DOI10.1287/mnsc.34.3.420
• 저자Chia‐Shin Chung, Chien-Hua Mike Lin