Dynamic programming approximation algorithms for the capacitated lot-sizing problem

This paper provides a new idea for approximating the inventory cost function to be used in a truncated dynamic program for solving the capacitated lot-sizing problem. The proposed method combines dynamic programming with regression, data fitting, and approximation techniques to estimate the inventor...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Journal of global optimization Ročník 65; číslo 2; s. 231 - 259
Hlavní autori:	Büyüktahtakın, İ. Esra, Liu, Ning
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.06.2016 Springer Springer Nature B.V
Predmet:	Algorithms Approximation Computation Computer Science Costs Dynamic programming Dynamics Integer programming Inventories Inventory control Mathematical analysis Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Production capacity Production planning Real Functions Stockpiling Studies Supply chain management Approximate dynamic programming Approximation algorithms Production and inventory control Data fitting Mixed-integer programming Capacitated lot-sizing
ISSN:	0925-5001, 1573-2916
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!