A hybrid polynomial-time algorithm for the dynamic quantity discount lot size model with resale
From MaRDI portal
Publication:1762169
DOI10.1016/j.cor.2011.10.018zbMath1251.90033MaRDI QIDQ1762169
Hamid S. Mirmohammadi, Kourosh Eshghi
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.10.018
dynamic programming; branch-and-bound; all-units discount; dynamic quantity discount; lot sizing with resale; time complexity function
90C60: Abstract computational complexity for mathematical programming problems
90B06: Transportation, logistics and supply chain management
90B05: Inventory, storage, reservoirs
90C39: Dynamic programming
Related Items
An optimal \((r,Q)\) policy in a stochastic inventory system with all-units quantity discount and limited sharable resource, Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount, Polynomial-Time Solvability of Dynamic Lot Size Problems
Cites Work
- A branch and bound algorithm for a single item nonconvex dynamic lot sizing problem with capacity constraints
- Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time
- Exact algorithms for procurement problems under a total quantity discount structure
- An efficient optimal algorithm for the quantity discount problem in material requirement planning
- An efficient algorithm for the dynamic economic lot size problem
- A classification of literature on determining the lot size under quantity discounts
- A dynamic quantity discount lot size model with resales
- An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem
- The dynamic lot size model with quantity discount
- On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
- The dynamic lot size model with quantity discount: Counterexamples and correction
- An economic production lot size model with increasing demand, shortages and partial backlogging
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities