On the determination of the control parameters of the optimal can-order policy

This paper considers the well-known class of can-order policies. This type of coordinated replenishment policies accounts for a joint set-up cost structure, where a major set-up cost is incurred for any order and an individual minor set-up cost is charged for each item in the replenishment. Recent comparative studies have pointed out that the performance of the optimal can-order policy is poor, compared to other coordinated replenishment strategies, when the major set-up cost is high. This paper shows that it is the approximate decomposition method to calculate the optimal canorder parameters which performs bad in such situations and not the policy itself. Attention is focused to a subclass of can-order policies, which is close to the optimal can-order policy for high major set-up costs. A solution procedure is developed to calculate the optimal control parameters of this policy. It is shown that a properly chosen combination of the solution procedures to calculate can-order parameters leads to a can-order strategy which performs as well as other coordinated replenishment policies.     

Multi-item inventory control with full truckloads: A comparison of aggregate and individual order triggering

In this paper, we consider the stochastic joint replenishment problem in an environment where transportation costs are dominant and full truckloads or full container loads are required. One replenishment policy, taking into account capacity restrictions of the total order volume, is the so-called QS policy, where replenishment orders are placed to raise the individual inventory positions of all items to their order-up-to levels, whenever the aggregate inventory position drops below the reorder level. We first provide a method to compute the policy parameters of a QS policy such that item target service levels can be met, under the assumption that demand can be modeled as a compound renewal process. The approximation formulas are based on renewal theory and are tested in a simulation study which reveals good performance. Second, we compare the QS policy with a simple allocation policy where replenishment orders are triggered by the individual inventory positions of the items. At the moment when an individual inventory position drops below its item reorder level, a replenishment order is triggered and the total vehicle capacity is allocated to all items such that the expected elapsed time before the next replenishment order is maximized. In an extensive simulation study it is illustrated that the QS policy outperforms this allocation policy since it results in lower inventory levels for the same service level. Although both policies lead to similar performance if items are identical, it can differ substantially if the item characteristics vary.     

A two-demand-class inventory system with lost-sales and backorders

A periodic review inventory system serves two demand classes with different priorities. Unsatisfied demands in the high-priority class are lost, whereas those in the low-priority class are backlogged. We formulate the problem as a dynamic programming model and characterize the structure of the optimal replenishment policy.     

Two New Heuristic Procedures for the Joint Replenishment Problem

In this paper, we develop two new efficient heuristic procedures for the joint replenishment problem. Each of the two heuristic procedures generates iteratively a near-optimal replenishment policy starting with ordering frequencies that are derived from the solution to a relaxed version of the joint replenishment problem. Both heuristic procedures are illustrated with an example problem involving five jointly ordered items. Seven more illustrative problems, taken from the joint replenishment problem literature, are also solved to assess the cost performance of the two heuristic procedures. They both provide the global optimal replenishment policies for all the illustrative problems.     

A New Optimal Algorithm for the Joint Replenishment Problem

In this paper, we propose a new optimal algorithm for the Joint Replenishment Problem. The proposed algorithm can be used to determine the optimal strict-cyclic policy, as well as the optimal among all cyclic policies for the joint replenishment problem. Computational experiments on randomly generated problems reveal that the proposed algorithm performs better than existing optimal algorithms for the problem.     

On Optimality of a Class of Dynamic Myopic Policies for Continuous-Time Replenishment with Periodic Updates

This paper is motivated by inventory problems arising in supply chains characterized by continuous replenishment programs based on information exchanged (reviewed) only intermittently between a manufacturing system (supplier) and a customer (retailer). When the replenishment is once-per-period, rather than at any point of time, a well-known result is the optimality of the so-called myopic base-stock policy. We generalize the notion of the base-stock policy and study the optimality of the corresponding class of dynamic myopic policies. We identify a myopic policy and prove that although the replenishment rule is dynamic, this policy is optimal when the demands are stationary and the number of review periods tends to infinity.     

A note on inventory policies for products with residual-life-dependent demand

We study inventory ordering policies for products that attract demand at a decreasing rate as they approach the end of their usable lifetime, for example, perishable items nearing expiration. We consider the “product freshness’’, or equivalently, the time until expiration (“residual life”) as a factor influencing the customer demand. In a profit-maximizing framework, we build on the Economic Order Quantity (EOQ) replenishment model and formulate the inventory ordering problem using a deterministic demand function that is concave decreasing in the the age of the product. We provide analytical results on the optimal ordering policy, including an explicit characterization of the decisions in the linear-demand case, and we develop an easy-to-implement adaptive heuristic policy for the general case. Numerical examples show that the optimal policy generates significant profit gains compared to the traditional cost-based policies and the adaptive heuristic policy performs highly satisfactorily in the tested instances.     

Optimal inventory replenishment policy for a queueing system with finite waiting room capacity

We treat an inventory control problem in a facility that provides a single type of service for customers. Items used in service are supplied by an outside supplier. To incorporate lost sales due to service delay into the inventory control, we model a queueing system with finite waiting room and non-instantaneous replenishment process and examine the impact of finite buffer on replenishment policies. Employing a Markov decision process theory, we characterize the optimal replenishment policy as a monotonic threshold function of reorder point under the discounted cost criterion. We present a simple procedure that jointly finds optimal buffer size and order quantity.     

Minimizing the Total Cost in an Integrated Vendor—Managed Inventory System

In this paper we consider a complex production-distribution system, where a facility produces (or orders from an external supplier) several items which are distributed to a set of retailers by a fleet of vehicles. We consider Vendor-Managed Inventory (VMI) policies, in which the facility knows the inventory levels of the retailers and takes care of their replenishment policies. The production (or ordering) policy, the retailers replenishment policies and the transportation policy have to be determined so as to minimize the total system cost. The cost includes the fixed and variable production costs at the facility, the inventory costs at the facility and at the retailers and the transportation costs, that is the fixed costs of the vehicles and the traveling costs. We study two different types of VMI policies: The order-up-to level policy, in which the order-up-to level quantity is shipped to each retailer whenever served (i.e. the quantity delivered to each retailer is such that the maximum level of the inventory at the retailer is reached) and the fill-fill-dump policy, in which the order-up-to level quantity is shipped to all but the last retailer on each delivery route, while the quantity delivered to the last retailer is the minimum between the order-up-to level quantity and the residual transportation capacity of the vehicle. We propose two different decompositions of the problem and optimal or heuristic procedures for the solution of the subproblems. We show that, for reasonable initial values of the variables, the order in which the subproblems are solved does not influence the final solution. We will first solve the distribution subproblem and then the production subproblem. The computational results show that the fill-fill-dump policy reduces the average cost with respect to the order-up-to level policy and that one of the decompositions is more effective. Moreover, we compare the VMI policies with the more traditional Retailer-Managed Inventory (RMI) policy and show that the VMI policies significantly reduce the average cost with respect to the RMI policy.     

Optimal retailer's ordering policies in the EOQ model under trade credit financing

The main purpose of this note is to modify the assumption of the trade credit policy in previously published results to reflect the real-life situations. All previously published models implicitly assumed that the supplier would offer the retailer a delay period, but the retailer would not offer the trade credit period to his/her customer. In most business transactions, this assumption is debatable. In this note, we assume that the retailer also adopts the trade credit policy to stimulate his/her customer demand to develop the retailer's replenishment model. Furthermore, we assume that the retailer's trade credit period offered by supplier M is not shorter than the customer's trade credit period offered by retailer N(M?N). Under these conditions, we model the retailer's inventory system as a cost minimization problem to determine the retailer's optimal ordering policies. Then a theorem is developed to determine efficiently the optimal ordering policies for the retailer. We deduce some previously published results of other researchers as special cases. Finally, numerical examples are given to illustrate the theorem obtained in this note.     

Periodic pricing and replenishment policy for continuously decaying inventory with multivariate demand

This paper deals with the joint decisions on pricing and replenishment schedule for a periodic review inventory system in which a replenishment order may be placed at the beginning of some or all of the periods. We consider a single product which is subject to continuous decay and a demand which is a function of price and time, without backlogging over a finite planning horizon. The proposed scheme may adjust periodically the selling price upward or downward that makes the pricing policy more responsive to structure changes in supply or demand. The problem is formulated as a dynamic programming model and solved by numerical search techniques. An extensive numerical study is conducted to attend qualitative insights into the structures of the proposed policy and its sensitivity with respect to major parameters. The numerical result shows that the solution generated by the periodic policy outperforms that by the fixed pricing policy in maximizing discount profit.     

Optimal ordering policies for periodic-review systems with a refined intra-cycle time scale

Chiang [C. Chiang, Optimal ordering policies for periodic-review systems with replenishment cycles, European Journal of Operational Research 170 (2006) 44–56] recently proposed a dynamic programming model for periodic-review systems in which a replenishment cycle consists of a number of small periods (each of identical but arbitrary length) and holding and shortage costs are charged based on the ending inventory of small periods. The current paper presents an alternative (and concise) dynamic programming model. Moreover, we allow the possibility of a positive fixed cost of ordering. The optimal policy is of the familiar (s, S) type because of the convexity of the one-cycle cost function. As in the periodic-review inventory literature, we extend this result to the lost-sales periodic problem with zero lead-time. Computation shows that the long-run average cost is rather insensitive to the choice of the period length. In addition, we show how the proposed model is modified to handle the backorder problem where shortage is charged on a per-unit basis irrespective of its duration. Finally, we also investigate the lost-sales problem with positive lead-time, and provide some computational results.     

The Trended Inventory Lot Sizing Problem with Shortages Under a New Replenishment Policy

In the past few years, considerable attention has been given to the inventory lot sizing problem with trended demand over a fixed horizon. The traditional replenishment policy is to avoid shortages in the last cycle. Each of the remaining cycles starts with a replenishment and inventory is held for a certain period which is followed by a period of shortages. A new replenishment policy is to start each cycle with shortages and after a period of shortages a replenishment should be made. In this paper, we show that this new type of replenishment policy is superior to the traditional one. We further propose four heuristic procedures that follow the new replenishment policy. These are the constant demand approximation method, the equal cycle length heuristic, the extended Silver approach, and the extended least cost solution procedure. We also examine the cost and computation time performances of these heuristic procedures through an empirical study. The number of test problems solved to optimality, average and maximum cost deviation from optimum were used as measures of cost performance. The results of the 10 000 test problems reveal that the extended least cost approach is most cost effective.     

Controlled Markov set-chains under average criteria

In this paper, applying an interval arithmetic analysis, we consider the average case of controlled Markov set-chains, whose process allows for fluctuating transition matrices at each step in time. We introduce a v-step contractive property for the average case, under which a Pareto optimal periodic policy is characterized as a maximal solution of optimality equation. Also, in the class of stationary policies, the behavior of the expected reward over T-horizon as T approaches ∞ is investigated and the left- and right-hand side optimality equations are given, by which a Pareto optimal stationary policy is found. As a numerical example, the Taxicab problem is considered.     

A Simple and Effective Component Procurement Policy for Stochastic Assembly Systems

We examine the component procurement problem in a single-item, make-to-stock assembly system. The suppliers are uncapacitated and have independent but non-identically distributed stochastic delivery lead times. Assembly is instantaneous, product demand follows a Poisson process and unsatisfied demand is backordered. The objective is to minimize the sum of steady-state holding and backorder costs over a pre-specified class of replenishment policies. To keep the analysis tractable, we impose a synchronization assumption that no mixing occurs between sets of component orders. Combining existing results from queueing theory with original results concerning distributions that are closed under maximization and translation, we derive a simple approximate solution to the problem when lead time variances are identical. In simulations, our derived policy is within 2% of optimal and significantly outperforms policies that ignore either component dependence or lead time stochasticity. It is also quite robust with respect to various model assumptions, except the synchronization one.     

Separate vs. joint replenishment policies with maximum storage requirement costs

Multi-item inventory problems give rise to the possibility of time-phasing the replenishments of different items over the inventory cycle. Such a policy reduces the peak storage requirement, compared to a policy of simultaneous replenishment. This, in turn, increases the amount of warehouse space which is permanently available for leasing throughout the cycle. However, where cost savings may be achieved through combining setups of different items, as in the well known joint replenishment problem, such a time-phasing policy may increase total setup costs. This paper considers the two item joint replenishment problem, where a cost (equivalent to the opportunity cost of warehouse space) attaches to the peak storage requirement which occurs within the inventory cycle. Existing joint replenishment models do not consider such costs, but their consideration suggests that joint replenishment is not always optimal. We analyze possible policies under both joint and separate replenishment, and provide optimal closed form solutions. A numerical example to illustrate the tradeoff between joint and separate replenishment is provided.     

A semi-Markov model with holdout transshipment policy and phase-type exponential lead time

In this paper, a semi-Markov decision model of a two-location inventory system with holdout transshipment policy is reviewed under the assumption of phase-type exponential replenishment lead time rather than exponential lead time. The phase-type exponential lead time more closely approximates fixed lead time as the number of phases increases. Unlike past research in this area which has concentrated on the simple transshipment policies of complete pooling or no pooling, the research presented in this paper endeavors to develop an understanding of a more general class of transshipment policy. In addition, we propose an effective method to approximate the dynamic holdout transshipment policy.     

The production–inventory problem of a product with time varying demand,production and deterioration rates

In this paper, we consider the production–inventory problem in which the demand, production and deterioration rates of a product are assumed to vary with time. Shortages of a cycle are allowed to be backlogged partially. Two models are developed for the problem by employing different modeling approaches over an infinite planning horizon. Solution procedures are derived for determining the optimal replenishment policies. A procedure to find the near-optimal operating policy of the problem over a finite time horizon is also suggested.