EconStor >
Europa-Universität Viadrina Frankfurt (Oder) >
Wirtschaftswissenschaftliche Fakultät, Europa-Universität Viadrina >
Diskussionspapiere, Wirtschaftswissenschaftliche Fakultät, Europa-Universität Viadrina  >

Please use this identifier to cite or link to this item:
Title:An O(Tˆ3) algorithm for the capacitated lot sizing problem with minimum order quantities PDF Logo
Authors:Okhrin, Irena
Richter, Knut
Issue Date: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
Appears in Collections:Diskussionspapiere, Wirtschaftswissenschaftliche Fakultät, Europa-Universität Viadrina

Files in This Item:
File Description SizeFormat
623985543.pdf357.42 kBAdobe PDF
No. of Downloads: Counter Stats
Download bibliographical data as: BibTeX
Share on:

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