An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(200012)47:8<686::AID-NAV6>3.0.CO;2-W" /><686::AID-NAV6>3.0.CO;2-W 10.1002/1520-6750(200012)47:8<686::AID-NAV6>3.0.CO;2-WzbMath0976.90003OpenAlexW2008653511MaRDI QIDQ4526925

Chia-Shin Chung, Sin-Hoon Hum, ömer Kirca

Publication date: 31 January 2001

Full work available at URL: https://doi.org/10.1002/1520-6750(200012)47:8<686::aid-nav6>3.0.co;2-w

zbMATH Keywords

schedulingpurchasinglot sizingquantity discounts

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05)

Related Items (4)

A newsvendor inventory model with an emergency order to supply a non-increasing fraction of shortage ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Modeling industrial lot sizing problems: a review ⋮ A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand

This page was built for publication: An optimal procedure for the coordinated replenishment dynamic lot-sizing problem with quantity discounts