Dynamic lot sizing with all‐units discount and resales
From MaRDI portal
Publication:3120554
DOI10.1002/nav.21484zbMath1407.90022OpenAlexW1982994256MaRDI QIDQ3120554
Chung-Lun Li, Vernon Ning Hsu, Jinwen Ou
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21484
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (8)
In-house production and outsourcing under different discount schemes on the total outsourcing cost ⋮ Polynomial-time algorithms to solve the single-item capacitated lot sizing problem with a 1-breakpoint all-units quantity discount ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Production lot-sizing with dynamic capacity adjustment ⋮ Procurement strategies for lost-sales inventory systems with all-units discounts ⋮ Improved exact algorithms to economic lot-sizing with piecewise linear production costs ⋮ Polynomial cases of the economic lot sizing problem with cost discounts ⋮ Single Machine Scheduling with Outsourcing Under Different Fill Rates or Quantity Discount Rates
This page was built for publication: Dynamic lot sizing with all‐units discount and resales
