Inventory policies with quantized ordering

DOI<285::AID-NAV3220390302>3.0.CO;2-T 10.1002/1520-6750(199204)39:3<285::AID-NAV3220390302>3.0.CO;2-TzbMath0749.90023OpenAlexW2027262040MaRDI QIDQ3989980

Yu-Sheng Zheng, Fangruo Chen

Publication date: 28 June 1992

Full work available at URL: https://doi.org/10.1002/1520-6750(199204)39:3<285::aid-nav3220390302>3.0.co;2-t

zbMATH Keywords

optimal \((nQ,r)\) policyoptimal \((s,S)\) policy

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (13)

Pack size effects on retail store inventory and storage space needs ⋮ Fractional programming approach to two stochastic inventory problems ⋮ Optimal inventory management using retail prepacks ⋮ Sensitivity analysis of an \((s,S)\) inventory model ⋮ Continuous-Review (R, nQ) Policies for Inventory Systems with Dual Delivery Modes ⋮ Optimizing constant pricing and inventory decisions for a periodic review system with batch ordering ⋮ Inventory control with indivisible units of stock transfer ⋮ Decision support for selecting the optimal product unpacking location in a retail supply chain ⋮ Optimal \((r,nQ,T)\) batch ordering with quantized supplies ⋮ Optimal and Near-Optimal (s,S) Inventory Policies for Levy Demand Processes ⋮ Inventory models with general backorder costs ⋮ Optimal (r, nQ, T) batch-ordering policy under stationary demand ⋮ Integrated inventory replenishment and temporal shipment consolidation: a comparison of quantity-based and time-based models

Cites Work

• Inventory models with general backorder costs
• An Efficient Algorithm for Computing an Optimal (r, Q) Policy in Continuous Review Stochastic Inventory Systems
• Unnamed Item
• Unnamed Item

This page was built for publication: Inventory policies with quantized ordering