Bitte verwenden Sie diesen Link, um diese Publikation zu zitieren, oder auf sie als Internetquelle zu verweisen: https://hdl.handle.net/10419/41404 
Erscheinungsjahr: 
2010
Schriftenreihe/Nr.: 
Discussion Paper No. 284
Verlag: 
European University Viadrina, Department of Business Administration and Economics, Frankfurt (Oder)
Zusammenfassung: 
This paper explores a single-item capacitated lot sizing problem with minimum order quantity, which plays the role of minor set-up cost. We work out the necessary and suffcient solvability conditions and apply the general dynamic programming technique to develop an O(T³) exact algorithm that is based on the concept of minimal sub-problems. An investigation of the properties of the optimal solution structure allows us to construct explicit solutions to the obtained sub-problems and prove their optimality. In this way, we reduce the complexity of the algorithm considerably and confirm its efficiency in an extensive computational study.
Schlagwörter: 
production planning
capacitated lot sizing problem
single item
minimum order quantities
capacity constraints
dynamic programming
Dokumentart: 
Working Paper

Datei(en):
Datei
Größe
357.42 kB





Publikationen in EconStor sind urheberrechtlich geschützt.