Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
From MaRDI portal
Publication:3342178
DOI10.1287/mnsc.30.9.1121zbMath0549.90034OpenAlexW2038946023MaRDI QIDQ3342178
Gabriel R. 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
approximation methodsworst case error boundseconomic order quantity heuristicmulti-product multi- facility problemsuncapacitated dynamic lot size problem
Related Items (21)
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Capacitated replenishment and disposal planning for multiple products with resalable returns ⋮ Minimum concave cost production system: A further generalization of multi-echelon model ⋮ Multi-level production scheduling for a class of flexible machining and assembly systems ⋮ An algorithm based on a new sufficient condition of optimality in dynamic lot size model ⋮ An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure ⋮ A methodology for controlling dispersion in food production and distribution ⋮ Online lot-sizing problems with ordering, holding and shortage costs ⋮ Comparative analysis of lot-sizing models for multi-stage systems: a simulation study ⋮ Approximation algorithms for deterministic continuous-review inventory lot-sizing problems with time-varying demand ⋮ ارائه یک روش برنامه ریزی پویا کارا جهت بهینه سازی مسئله اندازه سفارش با محدودیت ظرفیت ⋮ 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 ⋮ Stability of the constant cost dynamic lot size model ⋮ Facets and algorithms for capacitated lot sizing ⋮ Heuristic methods and applications: A categorized survey ⋮ Comparative studies on dynamic programming and integer programming approaches for concave cost production/inventory control problems ⋮ A combined heuristic approach to dynamic lot sizing problems ⋮ A two-echelon inventory optimization model with demand time window considerations ⋮ Sensitivity analysis of the economic lot-sizing problem ⋮ A Lagrangian heuristic for capacitated single item lot sizing problems
This page was built for publication: Approximation Methods for the Uncapacitated Dynamic Lot Size Problem
