Worst case performance for lot sizing heuristics

DOI10.1016/0377-2217(82)90176-XMaRDI QIDQ1160558zbMATH OpenOpenAlexFDO

Authors Sven Axsäter

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

zbMATH Keywords

comparison of algorithmsdynamic lot size problemheuristic algorithmno backloggingSilver-Meal algorithmworst case performance

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05) Production models (90B30) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• Dynamic version of the economic lot size model
• Performance Guarantees for Scheduling Algorithms
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(17)

• A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
• Eyeballing heuristics for dynamic lot size problems
• Sensitivity analysis of the economic lot-sizing problem
• Eyeballing heuristics for dynamic lot sizing problems with rolling horizons
• Facets and algorithms for capacitated lot sizing
• Heuristic methods and applications: A categorized survey
• Online economic ordering problem for deteriorating items with limited price information
• Online lot-sizing problems with ordering, holding and shortage costs
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
• Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
• From cost sharing mechanisms to online selection problems
• A combined heuristic approach to dynamic lot sizing problems
• Supply chain management with online customer selection
• On the power of lookahead in online lot-sizing
• The impact of initial inventory assumptions on cost performance in lot-sizing models
• A methodology for controlling dispersion in food production and distribution

This page was built for publication: Worst case performance for lot sizing heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1160558)