Exact methods for the single-item multi-plant capacitated lot sizing problem coupled with transportation

Ayse Akbalik and Bernard Penz

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

Abstract: In this paper we study the integration of production, transportation and storage decisions in a multi plant-distribution center supply structure. Multiple plants produce one type of item, each of them with different production capacity and costs, and send finished goods to the distribution center (DC) using capacitated vehicles. Customer demand is known at DC level and has to be satisfied without backlogging. This problem contains classical capacitated lot sizing problem as a subpart, which, in the general case, is NP-hard. We propose an exact pseudo-polynominal dynamic programming algorithm and show that the problem is NP-hard in the ordinary sense. We then compare the computational time of this dynamic program to that of a mixed integer linear program (MILP) which is selected among 4 different MILP formulations based on its lower computational time.

Keywords: multi-plant production; transportation; single-item capacitated lot sizing problem; dynamic program (search for similar items in EconPapers)
Date: 2007-07-01
References: Add references at CitEc
Citations:

Downloads: (external link)
https://sites.uclouvain.be/core/publications/coredp/coredp2007.html (application/pdf)

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:2007049

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 ().