Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
From MaRDI portal
Publication:5563833
DOI10.1287/OPRE.17.2.262zbMath0175.17602OpenAlexW1991499568WikidataQ89045154 ScholiaQ89045154MaRDI QIDQ5563833
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.2.262
dynamic programming recursionsminimum concave-cost solution of Leontief substitution modelsmulti-facility inventory systems
Related Items (50)
Capacity expansion with alternative technology choices ⋮ Statistical search methods for lotsizing problems ⋮ Multi-stage lot sizing in a serial production system ⋮ Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem ⋮ The submodular joint replenishment problem ⋮ Scalable methodology for supply chain inventory coordination with private information ⋮ Heuristic approach on dynamic lot-sizing model for durable products with end-of-use constraints ⋮ Coordination mechanisms of supply chain systems ⋮ An optimal lot-sizing model for multi-stage series/assembly systems ⋮ Minimum concave cost production system: A further generalization of multi-echelon model ⋮ Computational complexity of uncapacitated multi-echelon production planning problems ⋮ On the stability region for multi-level inventory problems ⋮ The replenishment problem with multiple articles and an order threshold ⋮ Progress with single-item lot-sizing ⋮ Multiple items procurement under stochastic nonstationary demands ⋮ Combining items for lot sizing in multi-level assembly systems ⋮ Relaxations for two-level multi-item lot-sizing problems ⋮ A bimodal scheme for multi-stage production and inventory control. ⋮ Production scheduling and sequencing for multi-stage production systems ⋮ Improved heuristic methods for multiple stage production planning. ⋮ On the optimality of joint ordering policies in a multi-product dynamic lot size model with individual and joint set-up costs ⋮ A survey of dynamic network flows ⋮ Modeling industrial lot sizing problems: a review ⋮ A note on a deterministic production scheduling model ⋮ A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand ⋮ The one-warehouse multi-retailer problem: reformulation, classification, and computational results ⋮ Progressive hedging as a meta-heuristic applied to stochastic lot-sizing ⋮ Single-point stochastic search algorithms for the multi-level lot-sizing problem ⋮ Models and algorithms for the dynamic-demand joint replenishment problem ⋮ Minimum concave-cost network flow problems: Applications, complexity, and algorithms ⋮ Duality in convex minimum cost flow problems on infinite networks and hypernetworks ⋮ Integrating facility location and production planning decisions ⋮ Comparative analysis of lot-sizing models for multi-stage systems: a simulation study ⋮ Exact algorithms for integrated facility location and production planning problems ⋮ Gainfree Leontief substitution flow problems ⋮ The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs ⋮ A new algorithm for one-warehouse multi-retailer systems under stationary nested policy ⋮ Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic ⋮ Two mixed integer programming formulations arising in manufacturing management ⋮ Integrated production/distribution planning in supply chains: An invited review ⋮ Iterative descent method for generalized Leontief model ⋮ A branch and bound-outer approximation algorithm for concave minimization over a convex set ⋮ APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES ⋮ The coordinated replenishment dynamic lot-sizing problem with quantity discounts ⋮ Facets and algorithms for capacitated lot sizing ⋮ A comparative study of lot sizing procedures for multi-stage assembly systems ⋮ Efficient and effective heuristics for the coordinated capacitated lot-size problem ⋮ On the global minimization of concave functions ⋮ Strongly polynomial algorithm for two special minimum concave cost network flow problems ⋮ On properties of discrete \((r,q)\) and \((s,T)\) inventory systems
This page was built for publication: Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems
