Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
From MaRDI portal
Publication:3120555
DOI10.1002/nav.21485zbMath1407.90018OpenAlexW2136098776MaRDI QIDQ3120555
Hark-Chin Hwang, Wilco van den Heuvel
Publication date: 5 March 2019
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: http://repub.eur.nl/pub/18591
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Dynamic programming (90C39)
Related Items (13)
The economic lot-sizing problem with perishable items and consumption order preference ⋮ Dynamic lot-sizing model under perishability, substitution, and limited storage capacity ⋮ A note on ``The economic lot sizing problem with inventory bounds ⋮ Combined replenishment and warehousing with contract commitments and flexibilities ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ Capacitated lot sizing problems with inventory bounds ⋮ Erratum: a tight formulation for uncapacitated lot-sizing with stock upper bounds ⋮ Improved algorithms for dynamic lot sizing problems with incremental discount ⋮ Joint optimization of dynamic lot and warehouse sizing problems ⋮ Two-level lot-sizing with inventory bounds ⋮ Multi-item uncapacitated lot sizing problem with inventory bounds ⋮ A branch-and-cut algorithm for an assembly routing problem ⋮ The single-item lot-sizing problem with two production modes, inventory bounds, and periodic carbon emissions capacity
This page was built for publication: Improved algorithms for a lot‐sizing problem with inventory bounds and backlogging
