Installation vs. echelon stock policies for multilevel inventory control
Management Science
The effect of leadtime uncertainty in a simple stochastic inventory model
Management Science
Lower bounds for multi-echelon stochastic inventory systems
Management Science
A multiechelon inventory model with fixed replenishment intervals
Management Science
Managing Supply Chain Demand Variability with Scheduled Ordering Policies
Management Science
Near-Optimal Echelon-Stock (R, Nq) Policies in Multistage Serial Systems
Operations Research
Optimal Policies for Multi-Echelon Inventory Problems with Batch Ordering
Operations Research
Inventory Cost Rate Functions with Nonlinear Shortage Costs
Operations Research
Optimal Control of Serial Inventory Systems with Fixed Replenishment Intervals
Operations Research
Improving Supply Chain Performance: Real-Time Demand Information and Flexible Deliveries
Manufacturing & Service Operations Management
Optimal (r,nQ,T) batch ordering with quantized supplies
Computers and Operations Research
A Multiechelon Inventory Problem with Secondary Market Sales
Management Science
A simple heuristic for echelon (r,nQ, T) policies in serial supply chains
Operations Research Letters
Newsvendor equations for optimal reorder levels of serial inventory systems with fixed batch sizes
Operations Research Letters
Lower Bounds and Heuristics for Supply Chain Stock Allocation
Operations Research
Technical Note---On Optimal Policies for Inventory Systems with Batch Ordering
Operations Research
| Hi-index | 0.00 |
In many production/distribution systems, materials flow in fixed lot sizes (e.g., in full truckloads or full containers) and under regular schedules (e.g., delivery every week). In this paper, we study a multiechelon serial system with batch ordering and fixed replenishment intervals. We derive the optimal inventory control policy, provide a distribution-function solution for its optimal control parameters, and present an efficient algorithm for computing those parameters. Further, we show that the optimal expected system cost is minimized when the ordering times for all stages are synchronized. In contrast to the known approach in the literature that develops a lower bound for the average cost of a given period for the classical serial system, we develop a lower bound for the average total cost over an appropriately defined cycle and then construct a policy that reaches the lower bound. We also discuss its extension to the nonlinear shortage cost case (i.e., the nonlinear cost case). This paper generalizes several recent results on the analysis of multiechelon systems.