DocumentCode
1571997
Title
A forward algorithm for capacitated lot sizing problem with lost sales
Author
Liu, Xiao ; Wang, Chengen ; Chu, Feng ; Chu, Chengbin
Author_Institution
Shenyang Inst. of Autom., Chinese Acad. of Sci., Liaoning, China
Volume
4
fYear
2004
Firstpage
3192
Abstract
This paper addresses a single item dynamic lot sizing problem where the inventory capacity is limited and shortages are allowed. Unsatisfied demand cannot be backlogged, which means lost sales. Costs are assumed to be time-varying. Some new properties are obtained in an optimal solution and a dynamic programming algorithm is developed to solve the problem in strongly polynomial with O(T3logT) time.
Keywords
dynamic programming; inventory management; lot sizing; dynamic programming algorithm; inventory capacity; lost sales; single item dynamic lot sizing; Chemical industry; Cost function; Dynamic programming; Food industry; Heuristic algorithms; Lot sizing; Manufacturing processes; Marketing and sales; Polynomials; Production planning;
fLanguage
English
Publisher
ieee
Conference_Titel
Intelligent Control and Automation, 2004. WCICA 2004. Fifth World Congress on
Print_ISBN
0-7803-8273-0
Type
conf
DOI
10.1109/WCICA.2004.1343111
Filename
1343111
Link To Document