Cover Image

A Geometric Algorithm to solve the NI/G/NI/ND Capacitated Lot-Sizing Problem in O(T^2) Time

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. We derive a backward algorithm, based on the forward algorithm by Chen et al. (1994), to solve the general CLSP. By adapting this backward algorithm, we arrive at a new O(T^2) algorithm for the CLSP with non-increasing setup cost, general holding cost, non-increasing production cost and non-decreasing capacities over time. Numerical tests show the superior performance of our algorithm compared to the algorithm proposed by Chung and Lin (1988). We also analyze why this is the case.
Year of publication:
2003-09-25
Authors: Heuvel, W. van den ; Wagelmans, A.P.M.
Institutions: Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
Subject: production | capacitated lot-sizing problem | inventory
Extent:
application/pdf
Series:
Research Paper. - ISSN 1566-5283.
Type of publication: Book / Working Paper
Notes:
The text is part of a series RePEc:dgr:eureri Number ERS-2003-066-LIS
Source:
Persistent link: https://ebvufind01.dmz1.zbw.eu/10005288473
Similar items by subject
Similar items by person