Note—Performance Bounds for Lot Sizing Heuristics
From MaRDI portal
Publication:3753761
DOI10.1287/MNSC.31.5.634zbMATH Open0612.90029OpenAlexW2067926198MaRDI QIDQ3753761FDOQ3753761
Authors: Sven Axsäter 
Publication date: 1985
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.31.5.634
Recommendations
- On heuristics and their performance evaluation for dynamic lot sizing
- scientific article; zbMATH DE number 91753
- Worst-case analysis for a general class of online lot-sizing heuristics
- A Sequential Lot Sizing Heuristic with Optimal Average Performance
- Heuristic Methods for the Multi-product Dynamic Lot Size Problem
Cited In (25)
- Title not available (Why is that?)
- Online lot-sizing problems with ordering, holding and shortage costs
- A perfect information lower bound for robust lot-sizing problems
- The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
- Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
- Title not available (Why is that?)
- Efficient heuristics for dynamic lot sizing
- Heuristic methods and applications: A categorized survey
- A Sequential Lot Sizing Heuristic with Optimal Average Performance
- A combined heuristic approach to dynamic lot sizing problems
- A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
- On the power of lookahead in online lot-sizing
- On heuristics and their performance evaluation for dynamic lot sizing
- Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
- An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
- Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
- Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
- Worst case analysis of relax and fix heuristics for lot-sizing problems
- Eyeballing heuristics for dynamic lot size problems
- A survey of lower bounding methodologies for production/inventory models
- An evaluation of heuristic performance in multi-stage lot-sizing systems
- Worst-case analysis for a general class of online lot-sizing heuristics
- Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand
- Comparative study of dynamic lot sizing heuristics with backlogging
- Facets and algorithms for capacitated lot sizing
This page was built for publication: Note—Performance Bounds for Lot Sizing Heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753761)
