Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand

DOI10.1287/opre.2018.1724zbMath1443.90109OpenAlexW2884330776WikidataQ114967776 ScholiaQ114967776MaRDI QIDQ4971563

Xiuli Chao, Cong Shi, Huanan Zhang

Publication date: 12 October 2020

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2018.1724

zbMATH Keywords

learning algorithmsinventoryperishable productsbase-stock policycensored demand

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Inventory, storage, reservoirs (90B05)

Related Items (6)

A comparison of inventory policies for perishable goods ⋮ A triple \((S, s, \ell)\)-thresholds base-stock policy subject to uncertainty environment, returns and order cancellations ⋮ Inventory policy and heuristic for long-term multi-product perishable inventory routing problem with static demand ⋮ Technical Note—Data-Driven Newsvendor Problem: Performance of the Sample Average Approximation ⋮ Confidence Intervals for Data-Driven Inventory Policies with Demand Censoring ⋮ Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand

Cites Work

• Unnamed Item
• The Sample Average Approximation Method for Stochastic Discrete Optimization
• Non-Stationary Stochastic Optimization
• The Data-Driven Newsvendor Problem: New Bounds and Insights
• Coordinating Inventory Control and Pricing Strategies for Perishable Products
• Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator
• Online Sequential Optimization with Biased Gradients: Theory and Applications to Censored Demand
• An Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
• A Nonparametric Asymptotic Analysis of Inventory Planning with Censored Demand
• An Adaptive Algorithm for Finding the Optimal Base-Stock Policy in Lost Sales Inventory Systems with Censored Demand
• Blood Inventory Management: An Overview of Theory and Practice
• Approximation Algorithms for Perishable Inventory Systems
• Pathwise Properties and Performance Bounds for a Perishable Inventory System
• Robust Stochastic Approximation Approach to Stochastic Programming
• Optimal Ordering Policies for Perishable Inventory—II
• Optimal Ordering Policy for a Perishable Commodity with Fixed Lifetime
• Analysis of Single Critical Number Ordering Policies for Perishable Inventories
• Myopic Approximations for the Perishable Inventory Problem
• A Markovian Model for a Perishable Product Inventory
• On Ordering Perishable Inventory when Both Demand and Lifetime are Random
• The Fixed-Charge Perishable Inventory Problem
• Near Myopic Heuristics for the Fixed-Life Perishability Problem
• Lost-Sales Problems with Stochastic Lead Times: Convexity Results for Base-Stock Policies
• Provably Near-Optimal Sampling-Based Policies for Stochastic Inventory Control Models
• Learning Algorithms for Separable Approximations of Discrete Stochastic Optimization Problems
• Technical Note—Nonparametric Data-Driven Algorithms for Multiproduct Inventory Systems with Censored Demand
• Technical Note—Approximation Algorithms for Perishable Inventory Systems with Setup Costs

This page was built for publication: Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand