A dynamic analysis of the single-item periodic stochastic inventory system with order capacity

DOI10.1016/S0377-2217(02)00256-4zbMath1036.90003MaRDI QIDQ1869671

Gin Hor Chan, Yuyue Song

Publication date: 28 April 2003

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00256-4

zbMATH Keywords

Dynamic programming; stochastic inventory system; \((\alpha,\beta)\)-convexity

Mathematics Subject Classification ID

90B05: Inventory, storage, reservoirs

90C39: Dynamic programming

Related Items

On the stochastic inventory problem under order capacity constraints, A disruption recovery plan in a three-stage production-inventory system, Cost minimising order schedules for a capacitated inventory system, Stochastic lot-sizing problem with inventory-bounds and constant order-capacities, Fuzzy periodic review system with fuzzy random variable demand, A periodic-review inventory model with application to the continuous-review obsolescence problem, Real time disruption management for a two-stage batch production-inventory system with reliability considerations, NEAR-OPTIMAL MODIFIED BASE STOCK POLICIES FOR THE CAPACITATED INVENTORY PROBLEM WITH STOCHASTIC DEMAND AND FIXED COST

Cites Work

• Unnamed Item
• Unnamed Item
• An Efficient Algorithm for Computing Optimal (s, S) Policies
• Computing optimal (s, S) policies in inventory models with continuous demands
• An Inventory Model with Limited Production Capacity and Uncertain Demands I. The Average-Cost Criterion
• An Inventory Model with Limited Production Capacity and Uncertain Demands II. The Discounted-Cost Criterion
• Evaluating the Effectiveness of a New Method for Computing Approximately Optimal (s, S) Inventory Policies
• Finding Optimal (s, S) Policies Is About As Simple As Evaluating a Single Policy
• X-Y Band and Modified (s, S) Policy
• Computing Optimal (s, S) Inventory Policies