The stochastic dynamic production/inventory lot-sizing problem with service-level constraints

2004 ◽  
Vol 88 (1) ◽  
pp. 105-119 ◽  
Author(s):  
S.Armagan Tarim ◽  
Brian G Kingsman
2013 ◽  
Vol 13 (3) ◽  
pp. 1332-1339 ◽  
Author(s):  
Ercan Şenyiğit ◽  
Muharrem Düğenci ◽  
Mehmet E. Aydin ◽  
Mithat Zeydan

2010 ◽  
Vol 102-104 ◽  
pp. 920-925
Author(s):  
Neng Min Wang ◽  
Zheng Wen He ◽  
Lin Yan Sun

This paper addresses a dynamic lot sizing problem with mixed returning items and disposals and bounded inventory. The returning items mean that returns are in good enough condition to re-enter the inventory supply stream. The producing, the holding, backlogging and disposals cost functions are concave cost functions. Furthermore, backlogging level and inventory level at each period is limited. The goal is to minimize the total cost of production, inventory holding/backlogging and disposal. A dynamic programming algorithm with complexity O(T3) is developed to solve this model, where T is the length of the planning horizon.


2014 ◽  
Vol 42 (2) ◽  
pp. 161-165 ◽  
Author(s):  
Huseyin Tunc ◽  
Onur A. Kilic ◽  
S. Armagan Tarim ◽  
Burak Eksioglu

Sign in / Sign up

Export Citation Format

Share Document