Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount

2021 ◽  
pp. 105373
Author(s):  
Yaser Malekian ◽  
S. Hamid Mirmohammadi ◽  
Mehdi Bijari
Keyword(s):  
Polynomial Time ◽  
Lot Sizing ◽  
Quantity Discount ◽  
Single Item ◽  
Polynomial Time Algorithms ◽  
Lot Sizing Problem ◽  
Capacitated Lot Sizing

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