Algorithms for single item constant capacity lotsizing problems

Mathieu van Vyve

No 2003007, LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE)

Abstract: The main result of this paper is to provide an O(n3) algorithm for the single item constant capacity lotsizing problem with backlogging and a general number of installable batches, i.e in each time period t we may install up to mt multiples of the batch capacity, where the mt are given and are time-dependent. This generalizes earlier results [12, 16] as we consider backlogging and a general number of installable batches. We also give faster algorithms for three special cases of this general problem. When backlogging is not allowed and the costs satisfy the Wagner-Whitin property the problem is solvable in O(n2logn) time. In the discrete case it is possible to solve the problem with and without backlogging in O(n2) and O(n2logn) time respectively.

Keywords: lotsizing; complexity; constant capacity; backlogging (search for similar items in EconPapers)
Date: 2003-02
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2003.html (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:cor:louvco:2003007

Access Statistics for this paper

More papers in LIDAM Discussion Papers CORE from Université catholique de Louvain, Center for Operations Research and Econometrics (CORE) Voie du Roman Pays 34, 1348 Louvain-la-Neuve (Belgium). Contact information at EDIRC.
Bibliographic data for series maintained by Alain GILLIS ().