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

Celý popis

Podrobná bibliografia

Vydané v:	Operations research letters Ročník 50; číslo 2; s. 168 - 175
Hlavní autori:	Kulkarni, Kartik, Bansal, Manish
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.03.2022
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!