scientific article; zbMATH DE number 232493
From MaRDI portal
Publication:5287175
DOI<459::AID-NAV3220400404>3.0.CO;2-8 10.1002/1520-6750(199306)40:4<459::AID-NAV3220400404>3.0.CO;2-8zbMath0804.90037MaRDI QIDQ5287175
Publication date: 15 August 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
New lot sizing heuristics for demand and price uncertainties with service-level constraint ⋮ Single item lot-sizing problems with backlogging on a single machine at a finite production rate ⋮ Dynamic lot sizing with stochastic demand timing ⋮ Constant approximation algorithms for the one warehouse multiple retailers problem with backlog or lost-sales ⋮ Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches ⋮ Mixed integer programming in production planning with backlogging and setup carryover: modeling and algorithms ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Solving single-product economic lot-sizing problem with non-increasing setup cost, constant capacity and convex inventory cost in \(O(N \log N)\) time ⋮ Forecast horizon of dynamic lot size model for perishable inventory with minimum order quantities ⋮ A Polynomial Time Algorithm for the Stochastic Uncapacitated Lot-Sizing Problem with Backlogging ⋮ Modeling industrial lot sizing problems: a review ⋮ Solving a class of simulation-based optimization problems using ``optimality in probability ⋮ A dynamic lot sizing model with production-or-outsourcing decision under minimum production quantities ⋮ Stochastic lot-sizing with backlogging: computational complexity analysis ⋮ An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging ⋮ Uncapacitated lot sizing with backlogging: the convex hull ⋮ A simplex algorithm for minimum-cost network-flow problems in infinite networks ⋮ Lot sizing and scheduling -- survey and extensions
Cites Work
