A single-period inventory placement problem for a serial supply chain

A single-period inventory placement problem for a serial supply chain

0.00 Avg rating0 Votes
Article ID: iaor20021568
Country: United States
Volume: 48
Issue: 6
Start Page Number: 506
End Page Number: 517
Publication Date: Sep 2001
Journal: Naval Research Logistics
Authors: , ,
Keywords: newsboy problem
Abstract:

This article addresses the inventory placement problem in a serial supply chain facing a stochastic demand for a single planning period. All customer demand is served from stage 1, where the product is stored in its final form. If the demand exceeds the supply at stage 1, then stage 1 is resupplied from stocks held at the upstream stages 2 through N, where the product may be stored in finished form or as raw materials or subassemblies. All stocking decisions are made before the demand occurs. The demand is nonnegative and continuous with a known probability distribution, and the purchasing, holding, shipping, processing, and shortage costs are proportional. There are no fixed costs. All unsatisfied demand is lost. The objective is to select the stock quantities that should be placed at different stages so as to maximize the expected profit. Under reasonable cost assumptions, this leads to a convex constrained optimization problem. We characterize the properties of the optimal solution and propose an effective algorithm for its computation. For the case of normal demands, the calculations can be done on a spreadsheet.

Reviews

Required fields are marked *. Your email address will not be published.