Please use this identifier to cite or link to this item: http://hdl.handle.net/10419/41404
Authors: 
Okhrin, Irena
Richter, Knut
Year of Publication: 
2010
Series/Report no.: 
Discussion paper // European University Viadrina, Department of Business Administration and Economics 284
Abstract: 
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.
Subjects: 
production planning
capacitated lot sizing problem
single item
minimum order quantities
capacity constraints
dynamic programming
Document Type: 
Working Paper

Files in This Item:
File
Size
357.42 kB





Items in EconStor are protected by copyright, with all rights reserved, unless otherwise indicated.