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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of global optimization Jg. 65; H. 2; S. 231 - 259
Hauptverfasser:	Büyüktahtakın, İ. Esra, Liu, Ning
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.06.2016 Springer Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!