Template-Type: ReDIF-Paper 1.0
Author-Name: van den Heuvel, W.J.
Author-Name-Last: van den Heuvel
Author-Name: Wagelmans, A.P.M.
Author-Name-Last: Wagelmans
Author-Name-First: Albert
Title: A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time
Abstract: In this paper we consider the capacitated lot-sizing problem (CLSP) with linear costs. It  is known that this problem is NP-hard, but there exist special cases that can be solved in  polynomial time. The purpose of this paper is twofold. First, we derive a backward algorithm  based on the forward algorithm by Chen et al. (1994), which solves the general CLSP. We  give a problem instances that requires exponential running time using the backward algo-  rithm. Second, we provide a new O(T2) algorithm for the CLSP with non-increasing setup  cost, general holding cost, non-increasing production cost and non-decreasing capacities over  time. This is done by adapting the backward algorithm. Numerical tests show the better  performance of our algorithm compared to the algorithm proposed by Chung and Lin (1988).
Creation-Date: 2003-01-01
File-URL: https://repub.eur.nl/pub/18017/feweco20030806162625.pdf
File-Format: application/pdf
Series: RePEc:ems:eureir
Number: EI 2003-24
Keywords: capacitated lot-sizing problem, inventory, production
Handle: RePEc:ems:eureir:18017