A Sequential Lot Sizing Heuristic with Optimal Average Performance

DOI10.1287/MNSC.34.11.1324MaRDI QIDQ3812002zbMATH OpenOpenAlexFDO

Authors Sven Axsäter

Publication date 1988

Published in Management Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/mnsc.34.11.1324

zbMATH Keywords

dynamic lot sizeheuristicsoptimal average performanceproduction planningsequence lot sizing rulewithout backlogging

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• scientific article; zbMATH DE number 4204085
• Note—Performance Bounds for Lot Sizing Heuristics
• Efficient heuristics for dynamic lot sizing
• Heuristic Methods for the Multi-product Dynamic Lot Size Problem
• On heuristics and their performance evaluation for dynamic lot sizing

Cited in

(10)

• Comparative study of dynamic lot sizing heuristics with backlogging
• Extensions of simple eyeballing dynamic lot sizing heuristics.
• Heuristic procedures for a stochastic lot-sizing problem in make-to-order manufacturing
• A fast heuristic for minimising total average cycle stock subject to practical constraints
• Two Modifications Of The Silver-Meal Lot Sizing Heuristic
• scientific article; zbMATH DE number 4204085 (Why is no real title available?)
• Note—Performance Bounds for Lot Sizing Heuristics
• Comparison of EOQ-independent lot-sizing heuristic rules
• Another heuristic for minimizing total average cycle stock subject to practical constraints
• Sequential-analysis Based Randomized-regret-methods for Lot-sizing and Scheduling

This page was built for publication: A Sequential Lot Sizing Heuristic with Optimal Average Performance

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