scholarly journals The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases

2013 ◽  
Vol 229 (2) ◽  
pp. 353-363 ◽  
Author(s):  
Ayse Akbalik ◽  
Christophe Rapine
Keyword(s):  
Lot Sizing ◽  
Time Dependent ◽  
Np Hard ◽  
Single Item ◽  
Lot Sizing Problem ◽  
Batch Sizes

scholarly journals A cash constrained single item stochastic lot-sizing problem

2019 ◽  
Vol 52 (13) ◽  
pp. 1479-1483
Author(s):  
Zhen Chen ◽  
Roberto Rossi
Keyword(s):  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem

Single Item Lot Sizing Models with Bounded Inventory and Remanufacturing

2010 ◽  
Vol 102-104 ◽  
pp. 791-795
Author(s):  
Neng Min Wang ◽  
Zheng Wen He ◽  
Qiu Shuang Zhang ◽  
Lin Yan Sun
Keyword(s):  
Lot Sizing ◽  
Dynamic Programming Algorithm ◽  
Production Capacity ◽  
Planning Horizon ◽  
Programming Algorithm ◽  
Single Item ◽  
Time Dynamic ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
Finite Planning Horizon

Dynamic lot sizing problem for systems with bounded inventory and remanufacturing was addressed. The demand and return amounts are deterministic over the finite planning horizon. Demands can be satisfied by manufactured new items, but also by remanufactured returned items. In production planning, there can be situations where the ability to meet customer demands is constrained by inventory capacity rather than production capacity. Two different limited inventory capacities are considered; there is either bounded serviceables inventory or bounded returns inventory. For the two inventory case, we present exact, polynomial time dynamic programming algorithm based on the idea of Teunter R, et al. (2006).

Analysis of bounds for a capacitated single-item lot-sizing problem

2007 ◽  
Vol 34 (6) ◽  
pp. 1721-1743 ◽  
Author(s):  
Jill R. Hardin ◽  
George L. Nemhauser ◽  
Martin W.P. Savelsbergh
Keyword(s):  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem
Sign in / Sign up

Export Citation Format

Share Document