Approximation Methods for the Uncapacitated Dynamic Lot Size Problem

DOI10.1287/MNSC.30.9.1121MaRDI QIDQ3342178zbMATH OpenOpenAlexFDO

Authors Gabriel Bitran, Thomas L. Magnanti, Horacio Hideki Yanasse

Publication date 1984

Published in Management Science (Search for Journal in Brave)

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

zbMATH Keywords

approximation methodseconomic order quantity heuristicmulti-product multi- facility problemsuncapacitated dynamic lot size problemworst case error bounds

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05)

Recommendations

• Heuristic Methods for the Multi-product Dynamic Lot Size Problem
• Note—Performance Bounds for Lot Sizing Heuristics
• scientific article; zbMATH DE number 91753
• Minimizing the error bound for the dynamic lot size model
• Efficient heuristics for dynamic lot sizing

Cited in

(23)

• A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters
• Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems
• Minimum concave cost production system: A further generalization of multi-echelon model
• An algorithm based on a new sufficient condition of optimality in dynamic lot size model
• Sensitivity analysis of the economic lot-sizing problem
• Stability of the constant cost dynamic lot size model
• Facets and algorithms for capacitated lot sizing
• Heuristic methods and applications: A categorized survey
• Online lot-sizing problems with ordering, holding and shortage costs
• Worst case analysis of relax and fix heuristics for lot-sizing problems
• A Lagrangian heuristic for capacitated single item lot sizing problems
• Capacitated replenishment and disposal planning for multiple products with resalable returns
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure
• Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand
• A two-echelon inventory optimization model with demand time window considerations
• Comparative analysis of lot-sizing models for multi-stage systems: a simulation study
• Polynomial-Time Algorithms for Stochastic Uncapacitated Lot-Sizing Problems
• An efficient dynamic programming approach to optimize capacitated lot-sizing problem
• A combined heuristic approach to dynamic lot sizing problems
• An \(O(N^2)\)-time algorithm for the stochastic uncapacitated lot-sizing problem with random lead times
• A methodology for controlling dispersion in food production and distribution
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Multi-level production scheduling for a class of flexible machining and assembly systems

This page was built for publication: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem

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