scientific article

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199210)39:6<801::AID-NAV3220390606>3.0.CO;2-1" /><801::AID-NAV3220390606>3.0.CO;2-1 10.1002/1520-6750(199210)39:6<801::AID-NAV3220390606>3.0.CO;2-1zbMath0761.90033MaRDI QIDQ4017556

Rita Vachani

Publication date: 16 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristicsworst-case analysisbounds for the finite-horizon problemuncapacitated lot-size problem

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (6)

Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Single-item dynamic lot-sizing problems: an updated survey ⋮ A methodology for controlling dispersion in food production and distribution ⋮ Online lot-sizing problems with ordering, holding and shortage costs ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems

This page was built for publication: