Integrated inventory and inspection policies for stochastic demand

In this paper, we develop integrated inventory inspection models with and without replacement of nonconforming items. Inspection policies include no inspection, sampling inspection, and 100% inspection. We consider a buyer who places an order from a supplier when his inventory level drops to a certain point, due to demand which is stochastic in nature. When a lot is received, the buyer uses some type of inspection policy. The fraction nonconforming is assumed to be a random variable following a beta distribution. The order quantity, reorder point and the inspection policy are decision variables. In the inspection policy involving determining sampling plan parameters, constraints on the buyer and manufacturer risks is set in order to obtain a fair plan for both parties. A solution procedure for determining the operating policies for inventory and inspection consisting of order quantity, sample size, and acceptance number is proposed. Numerical examples are presented to conduct a sensitivity analysis for important model parameters and to illustrate important issues about the developed models.     

Optimal replenishment policies for deteriorating items with stock sensitive demand under two-level trade credit and limited capacity

Recently, Min et al. [18] established an inventory model for deteriorating items under stock-dependent demand and two-level trade credit and obtained the optimal replenishment policy. Their analysis imposed a terminal condition of zero ending-inventory. However, with a stock-dependent demand, it may be desirable to order large quantities, resulting in stock remaining at the end of the cycle, due to the potential profits resulting from the increased demand. As a result, to make the theory more applicable in practice, we extend their model to allow for: (1) an ending-inventory to be nonzero, (2) a maximum inventory ceiling to reflect the facts that too much stock leaves a negative impression on the buyer and the amount of shelf/display space is limited.     

Optimum inventory policies with discrete time proportional demand,discrete replenishment opportunities and different optimizing criteria

This paper extends the deterministic, single product, dynamic E0Q model to the case where demand increases linearly with time but at discrete time points and where the number of replenishments is also discrete. The problem is to find the number of orders and the replenishment schedule that will either maximize the return on the investment on inventory or minimize inventory costs. The proposed solution to either problem requires to first find the replenishment schedule that will minimize the total inventory throughout the planning horizon, for a given number of orders and then find the optimal number of replenishment points. The solution algorithms exploit the discrete nature of the demand and do not require the decomposability property of dynamic programming. This is particularly important in the return on investment case, where decomposability cannot be achieved.     

Optimal ordering policies for periodic-review systems with replenishment cycles

In this paper, we consider inventory models for periodic-review systems with replenishment cycles, which consist of a number of periods. By replenishment cycles, we mean that an order is always placed at the beginning of a cycle. We use dynamic programming to formulate both the backorder and lost-sales models, and propose to charge the holding and shortage costs based on the ending inventory of periods (rather than only on the ending inventory of cycles). Since periods can be made any time units to suit the needs of an application, this approach in fact computes the holding cost based on the average inventory of a cycle and the shortage cost in proportion to the duration of shortage (for the backorder model), and remedies the shortcomings of the heuristic or approximate treatment of such systems (Hadley and Whitin, Analysis of Inventory Systems, Prentice-Hall, Englewood Cliffs, NJ, 1963). We show that a base-stock policy is optimal for the backorder model, while the optimal order quantity is a function of the on-hand inventory for the lost-sales model. Moreover, for the backorder model, we develop a simple expression for computing the optimal base-stock level; for the lost-sales model, we derive convergence conditions for obtaining the optimal operational parameters.     

Optimal replenishment policy for product with season pattern demand

This paper investigates a deterministic inventory model in which demand follows a seasonal pattern that repeats itself after a short time interval. An algorithm is developed for determining an optimal replenishment cycle, a shortage length and an order quantity such that the total profit per unit time is maximized.     

Effective heuristics for the dynamic demand joint replenishment problem

This paper considers the dynamic demand joint replenishment problem where there is a joint setup cost in each time period when any member of the product family is replenished and a separate setup cost for each different item replenished. We present two forward-pass heuristics, a two-phase heuristic, and a simulated annealing metaheuristic (SAM) and investigate their relative effectiveness in solving a comprehensive set of test problems. The experimental results indicate the two-phase heuristic and the SAM perform better than existing approaches for the problem.     

Effect of coordinated replenishment policies on quality

Coordinated replenishment is a supply chain policy that affects many operational performance measures, including cost, lead time, and quality. In this paper, we develop a mathematical model of a simplified supply chain in which conformance quality is one of the supplier's decision variables and both the supplier and its customer are trying to minimize expected annual cost. Our expected cost model includes the important quality costs (appraisal, prevention, internal failure, and external failure) as well as holding, set-up, and ordering costs. Our results indicate that coordination leads to a decline in total cost but that coordination does not necessarily lead to an improvement in quality. In other words, buyers who are using coordinated replenishment may be trading higher quality for lower cost.     

Retail replenishment models with display-space elastic demand

We study a single store multi-product inventory problem in which product sales are a composite function of shelf space. Since sales tend to deplete the amount of product on display, the effective shelf space assigned to the product diminishes with time unless replenishment occurs. We consider the problem of optimal replenishment times under these conditions. We assume a linear dependence of sales rate to effective shelf space in all our analysis. We present exact and approximate solutions for the single product and multi-product cases. For the single product case, we study the effect of space elasticity, cross elasticity and empty space elasticity on the optimal replenishment period. For the multi-product case we present a computationally attractive method using matrix exponentials and develop error bounds for this method.     

A partial replenishment model for an inventory with constant demand

An inventory with constant demand is considered. The inventory is checked according to a Poisson process and replenished either fully or partially when the stock is below a threshold. We obtained the stationary distribution of the level of the inventory. After assigning several costs to the inventory, we also derived the long-run average cost per unit time. A numerical example is studied to find the optimal values of the checking rate and threshold, which minimize the long-run average cost.     

On the modeling of demand spill for a stochastic demand system under competition

When customers for a product from N substitutable alternatives find their first choice sold out, they might “spill” to their secondmost preferred product. The existing literature typically assumes an exogenous spill rate. We develop a surprisingly simple model that links the spill rate to economic factors associated with direct demand systems.     

Optimal myopic policies and index policies for stochastic scheduling problems

Stochastic scheduling problems are considered by using discounted dynamic programming. Both, maximizing pure rewards and minimizing linear holding costs are treated in one common Markov decision problem. A sufficient condition for the optimality of the myopic policy for finite and infinite horizon is given. For the infinite horizon case we show the optimality of an index policy and give a sufficient condition for the index policy to be myopic. Moreover, the relation between the two sufficient conditions is discussed.     

A comparison of different quantity discount pricing policies in a two-echelon channel with stochastic and asymmetric demand information

In this paper, we study quantity discount pricing policies in a channel of one manufacturer and one retailer. The paper assumes that the channel faces a stochastic price-sensitive demand but the retailer can privately observe the realization of an uncertain demand parameter. The problem is analyzed as a Stackelberg game in which the manufacturer declares quantity discount pricing schemes to the retailer and then the retailer follows by selecting the retail price and associated quantity. Proposed in the paper are four quantity-discount pricing policies: “regular quantity discount”; “fixed percentage discount”; “incremental volume discount” and “fixed marginal-profit-rate discount”. Optimal solutions are derived, and numerical examples are presented to illustrate the efficiency of each discount policy.     

A dynamic joint replenishment policy with auto-correlated demand

We consider a joint replenishment problem where the product demands are auto-correlated but independent of each other. A dynamic periodic review policy is developed, and its parameters are determined by a heuristic which aims at minimizing the total inventory cost, which includes the holding cost, the set up cost and the shortage cost. The heuristic updates the review interval and the target inventory level of every product at each review point based on the current inventory status and the past demand data. A simulation model is developed to compare the performance of this proposed policy with an existing periodic review policy. The results show that the proposed policy has consistently achieved significant saving in all the different experimental scenarios.     

A multiple replenishment contract with ARIMA demand processes

This paper is concerned with a multiple replenishment contract with a purchase price discount in a supply chain. The chain is composed of one supplier, one buyer and consumers for a product. The replenishment contract is based upon the well-known (s, Q) policy, but allows us to contract replenishments at a future time with a price discount. Owing to the larger forecast error of future demand, the buyer should keep a higher level of safety stock to provide the same level of service as the usual (s, Q) policy. However, the buyer can reduce his purchase cost by ordering a larger quantity at a discounted price. Hence, there exists a trade-off between the price discount and the inventory holding cost. For the ARIMA demand processes, we present a model for the contract and an algorithm to find the number of the future replenishments. Computational experiments show that the algorithm finds the global optimum solution very quickly.     

Linear preselective policies for stochastic project scheduling

In the context of stochastic resource-constrained project scheduling we introduce a novel class of scheduling policies, the linear preselective policies. They combine the benefits of preselective policies and priority policies; two classes that are well known from both deterministic and stochastic scheduling. We study several properties of this new class of policies which indicate its usefulness for computational purposes. Based on a new representation of preselective policies as and/or precedence constraints we derive efficient algorithms for computing earliest job start times and state a necessary and sufficient dominance criterion for preselective policies.  A computational experiment based on 480 instances empirically validates the theoretical findings.     

Optimal greedy policies for stochastic control models

We introduce the notion of a greedy policy for general stochastic control models. Sufficient conditions for the optimality of the greedy policy for finite and infinite horizon are given. Moreover, we derive error bounds if the greedy policy is not optimal. The main results are illustrated by Bayesian information models, discounted Bayesian search problems, stochastic scheduling problems, single-server queueing networks and deterministic dynamic programs.     

Suboptimal policies for stochastic cash balance problems

Summary For a cash balance model having piecewise linear costs and an exponentially correlated sequence of demand two suboptimal solutions are compared. The first approach derives the bestlinear transfer policy reducing the information needed essentially to a sequence of demand forecasts.The second approach which is usually to be met in practice takes forecasts of demand from the outset and then uses a rolling horizon optimization procedure not restricting the class of feasible solutions to be linear. It turns out that the linear approach is for all cost and demand parameters better than the deterministic one.

---

Zusammenfassung Für ein Kassenhaltungsmodell mit stückweise linearen Kosten und exponentiell korrelierter Nachfrage werden zwei suboptimale Lösungsverfahren verglichen. Beim ersten Ansatz wird die bestelineare Transferpolitik ermittelt, wobei die benötigte Information sich im wesentlichen auf die Folge der Nachfrageprognosen reduzieren läßt.Der zweite Ansatz, der gewöhnlich in der Praxis angewendet wird, beruht auf der direkten Verwendung von Nachfrageprognosen und benutzt im Rahmen rollender Planung ein deterministisches Optimierungsverfahren. Hierbei wird die Klasse der möglichen Transferentscheidungen nicht auf lineare Politiken eingeschränkt.Es stellt sich heraus, daß das lineare Lösungsverfahren für alle Kosten- und Nachfrageparameter besser ist als das deterministische.

---

---

This paper has partly been supported by the Deutsche Forschungsgemeinschaft (Schn 159/1).     

Modelling and computing (Rn, Sn) policies for inventory systems with non-stationary stochastic demand

This paper addresses the single-item, non-stationary stochastic demand inventory control problem under the non-stationary (R, S) policy. In non-stationary (R, S) policies two sets of control parameters—the review intervals, which are not necessarily equal, and the order-up-to-levels for replenishment periods—are fixed at the beginning of the planning horizon to minimize the expected total cost. It is assumed that the total cost is comprised of fixed ordering costs and proportional direct item, inventory holding and shortage costs. With the common assumption that the actual demand per period is a normally distributed random variable about some forecast value, a certainty equivalent mixed integer linear programming model is developed for computing policy parameters. The model is obtained by means of a piecewise linear approximation to the non-linear terms in the cost function. Numerical examples are provided.