Note—Performance Bounds for Lot Sizing Heuristics

DOI10.1287/MNSC.31.5.634MaRDI QIDQ3753761zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicsworst case performance boundsdynamic lot size

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

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)

• A perfect information lower bound for robust lot-sizing problems
• The Asymptotic Worst-Case Behavior of the FFD Heuristic for Small Items
• A Sequential Lot Sizing Heuristic with Optimal Average Performance
• scientific article; zbMATH DE number 91753 (Why is no real title available?)
• A survey of lower bounding methodologies for production/inventory models
• scientific article; zbMATH DE number 1996460 (Why is no real title available?)
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• An evaluation of heuristic performance in multi-stage lot-sizing systems
• Optimal stationary policies in a 3-stage serial production-distribution logistic chain facing constant and continuous demand
• A combined heuristic approach to dynamic lot sizing problems
• Comparative study of dynamic lot sizing heuristics with backlogging
• Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
• Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
• On the power of lookahead in online lot-sizing
• Worst-case analysis for a general class of online lot-sizing heuristics
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Online lot-sizing problems with ordering, holding and shortage costs
• Facets and algorithms for capacitated lot sizing
• On heuristics and their performance evaluation for dynamic lot sizing
• Eyeballing heuristics for dynamic lot size problems
• A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
• Efficient heuristics for dynamic lot sizing
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior
• Heuristic methods and applications: A categorized survey

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)