A new Silver–Meal based heuristic for the single-item dynamic lot sizing problem with returns and remanufacturing

2011 ◽  
Vol 49 (9) ◽  
pp. 2519-2533 ◽  
Author(s):  
Tobias Schulz
Keyword(s):  
Lot Sizing ◽  
Single Item ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing

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).

scholarly journals Economic lot-sizing problem with remanufacturing option: complexity and algorithms

2021 ◽  
Author(s):  
Ashwin Arulselvan ◽  
Kerem Akartunalı ◽  
Wilco van den Heuvel
Keyword(s):  
Polynomial Time ◽  
Lot Sizing ◽  
Polynomial Time Algorithm ◽  
Time Algorithm ◽  
Single Item ◽  
Inventory Costs ◽  
Time Period ◽  
Lot Sizing Problem ◽  
Dynamic Lot Sizing ◽  
The Cost

AbstractIn a single item dynamic lot-sizing problem, we are given a time horizon and demand for a single item in every time period. The problem seeks a solution that determines how much to produce and carry at each time period, so that we will incur the least amount of production and inventory cost. When the remanufacturing option is included, the input comprises of number of returned products at each time period that can be potentially remanufactured to satisfy the demands, where remanufacturing and inventory costs are applicable. For this problem, we first show that it cannot have a fully polynomial time approximation scheme. We then provide a polynomial time algorithm, when we make certain realistic assumptions on the cost structure.

Sign in / Sign up

Export Citation Format

Share Document