Note—Performance Bounds for Lot Sizing Heuristics
From MaRDI portal
Publication:3753761
DOI10.1287/mnsc.31.5.634zbMath0612.90029OpenAlexW2067926198MaRDI QIDQ3753761
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
Related Items
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches, Eyeballing heuristics for dynamic lot size problems, On the power of lookahead in online lot-sizing, Efficient heuristics for dynamic lot sizing, 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, An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure, Online lot-sizing problems with ordering, holding and shortage costs, Rounding heuristics for multiple product dynamic lot-sizing in the presence of queueing behavior, Comparative analysis of lot-sizing models for multi-stage systems: a simulation study, 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
