Online ISSN:1349-8606
Progress in Informatics  
No.9 March 2012  
Page 31-34  
 
A dynamic programming algorithm for lot-sizing problem with outsourcing
Ping ZHAN

LINK [1] C.P.M. van Hoesel and A.P.M. Wagelmans,“An O(T3) Algorithm for the economic lot-sizingproblem with constant capacities,”Manage. Sci., vol.42 the resul, pp.142-150, 1996.

LINK [2] H.C. Hwang, W. Jaruphongsa, S. Cetinkaya, and C.Y. Lee,“Capacited dynamic lot-sizing problem withdelivery/production time windows,”Oper. Res. Lett., vol.38, pp.408-413, 2010.

LINK [3] L.A. Wolsey,“Lot-sizing with production and delivery time windows,”Math. Program.Series A, vol.107, pp.471-489, 2006.

LINK [4] V. Pochet and L.A. Wolsey,Production Planning by Mixed Integer Pregramming,Springer, 2006.