In this work, we face a variant of the capacitated lot sizing problem. This is a classical problem addressing the issue of aggregating lot sizes for a finite number of discrete periodic demands that need to be satisfied, thus setting up production resources and eventually creating inventories, while minimizing the overall cost. In the proposed variant we take into account lifetime constraints, which model products with maximum fixed shelflives due to several possible reasons, including regulations or technical obsolescence. We propose four formulations, derived from the literature on the classical version of the problem and adapted to the proposed variant. An extensive experimental phase on two datasets from the literature is used to test and compare the performance of the proposed formulations.
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations
Raiconi Andrea
;
2017
Abstract
In this work, we face a variant of the capacitated lot sizing problem. This is a classical problem addressing the issue of aggregating lot sizes for a finite number of discrete periodic demands that need to be satisfied, thus setting up production resources and eventually creating inventories, while minimizing the overall cost. In the proposed variant we take into account lifetime constraints, which model products with maximum fixed shelflives due to several possible reasons, including regulations or technical obsolescence. We propose four formulations, derived from the literature on the classical version of the problem and adapted to the proposed variant. An extensive experimental phase on two datasets from the literature is used to test and compare the performance of the proposed formulations.File | Dimensione | Formato | |
---|---|---|---|
ComparisonNFM_Postprint_IRIS.pdf
Open Access dal 30/06/2018
Tipologia:
Documento in Post-print
Licenza:
Creative commons
Dimensione
327.84 kB
Formato
Adobe PDF
|
327.84 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.