Discrete multi-module capacitated lot-sizing problems with multiple items

We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal to the summation of binary multiples of the capacities of n available different modules (or machines). For fixed n≥2, we develop fixed-parame...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Operations research letters Jg. 50; H. 2; S. 168 - 175
Hauptverfasser:	Kulkarni, Kartik, Bansal, Manish
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.03.2022
Schlagworte:	Concave production and holding costs Dynamic programming Fixed-parameter tractable algorithm Multi-item discrete lot-sizing problem Multi-module capacitated lot-sizing with backlogging Multi-module capacitated lot-sizing with backlogging Dynamic programming Concave production and holding costs Multi-item discrete lot-sizing problem Fixed-parameter tractable algorithm
ISSN:	0167-6377, 1872-7468
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We study single-item discrete multi-module capacitated lot-sizing problems without and with backlogging where the amount produced in each time period is equal to the summation of binary multiples of the capacities of n available different modules (or machines). For fixed n≥2, we develop fixed-parameter tractable (polynomial) exact algorithms that generalize the algorithms of van Vyve (2007) for n=1. We utilize these algorithms within a Lagrangian decomposition framework to solve their multi-item versions. Our algorithms are computationally efficient and stable, in comparison to Gurobi 9.0.
ISSN:	0167-6377 1872-7468
DOI:	10.1016/j.orl.2022.01.002