Worst case performance for lot sizing heuristics
From MaRDI portal
Publication:1160558
DOI10.1016/0377-2217(82)90176-XzbMath0477.90024OpenAlexW2089450981MaRDI QIDQ1160558
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90176-x
heuristic algorithmcomparison of algorithmsworst case performancedynamic lot size problemno backloggingSilver-Meal algorithm
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Production models (90B30) Inventory, storage, reservoirs (90B05)
Related Items (16)
From Cost Sharing Mechanisms to Online Selection Problems ⋮ Eyeballing heuristics for dynamic lot sizing problems with rolling horizons ⋮ Eyeballing heuristics for dynamic lot size problems ⋮ On the power of lookahead in online lot-sizing ⋮ Supply Chain Management with Online Customer Selection ⋮ A methodology for controlling dispersion in food production and distribution ⋮ Online lot-sizing problems with ordering, holding and shortage costs ⋮ Comparative analysis of lot-sizing models for multi-stage systems: a simulation study ⋮ Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand ⋮ A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters ⋮ Worst case analysis of relax and fix heuristics for lot-sizing problems ⋮ Facets and algorithms for capacitated lot sizing ⋮ Heuristic methods and applications: A categorized survey ⋮ A combined heuristic approach to dynamic lot sizing problems ⋮ Online economic ordering problem for deteriorating items with limited price information ⋮ Sensitivity analysis of the economic lot-sizing problem
Cites Work
This page was built for publication: Worst case performance for lot sizing heuristics
