Periodic review lost-sales inventory models with compound Poisson demand and constant lead times of any length

In almost all literature on inventory models with lost sales and periodic reviews the lead time is assumed to be either an integer multiple of or less than the review period. In a lot of practical settings such restrictions are not satisfied. We develop new models allowing constant lead times of any length when demand is compound Poisson. Besides an optimal policy, we consider pure and restricted base-stock policies under new lead time and cost circumstances. Based on our numerical results we conclude that the latter policy, which imposes a restriction on the maximum order size, performs almost as well as the optimal policy. We also propose an approximation procedure to determine the base-stock levels for both policies with closed-form expressions.     

How useful is commonality? Inventory and production decisions to maximize survival probability in start-ups

This paper deals with component commonality in start-up manufacturingfirms. We present a two-product Markov decision model that examinesthe implications of the inventory and production strategiesfor the survival probability of the firm. The advantage of usingcomponent commonality is studied for varying costs, demand correlationsand order replenishment lead times. Optimal policies are derived,and minimum stock levels for survival are obtained. Moreover,we state the conditions under which simplified production decisionscan be made. It is shown that commonality is not only usefulas a way of dealing with demand uncertainty, but that its increaseduse is preferred for strongly substitutable products, and shorterreplenishment lead times.     

Demand seasonality in retail inventory management

We investigate the value of accounting for demand seasonality in inventory control. Our problem is motivated by discussions with retailers who admitted to not taking perceived seasonality patterns into account in their replenishment systems. We consider a single-location, single-item periodic review lost sales inventory problem with seasonal demand in a retail environment. Customer demand has seasonality with a known season length, the lead time is shorter than the review period and orders are placed as multiples of a fixed batch size. The cost structure comprises of a fixed cost per order, a cost per batch, and a unit variable cost to model retail handling costs. We consider four different settings which differ in the degree of demand seasonality that is incorporated in the model: with or without within-review period variations and with or without across-review periods variations. In each case, we calculate the policy which minimizes the long-run average cost and compute the optimality gaps of the policies which ignore part or all demand seasonality. We find that not accounting for demand seasonality can lead to substantial optimality gaps, yet incorporating only some form of demand seasonality does not always lead to cost savings. We apply the problem to a real life setting, using Point-of-Sales data from a European retailer. We show that a simple distinction between weekday and weekend sales can lead to major cost reductions without greatly increasing the complexity of the retailer’s automatic store ordering system. Our analysis provides valuable insights on the tradeoff between the complexity of the automatic store ordering system and the benefits of incorporating demand seasonality.     

Inventory model involving controllable backorder rate and variable lead time demand with the mixtures of distribution

In the model of Ouyang and Chuang [Comput. Ind. Eng. 40 (2001) 339], they assume that the backorder rate is dependent on the length of lead time through the amount of shortages and let the backorder rate is a control variable. But, since they only assumed a single distribution for the lead time demand, when the demand of the different customers are not identical in the lead time, then we cannot use a single distribution (such as [Comput. Ind. Eng. 40 (2001) 339]) to describe the demand of the lead time. Hence, in our studies, we first assume that the lead time demand follows a mixtures of normal distribution, and then we relax the assumption about the form of the mixtures of distribution functions of the lead time demand and apply the minimax distribution free procedure to solve the problem. We develop an algorithm procedure, respectively, to find the optimal order quantity and the optimal lead time. Furthermore, two numerical examples are also given to illustrate the results.     

A multi-item mixture inventory model involving random lead time and demand with budget constraint and surprise function

This study deals with a multi-item mixture inventory model in which both demand and lead time are random. A budget constraint is also added to this model. The optimization problem with budget constraint is then transformed into a multi-objective optimization problem with the help of fuzzy chance-constrained programming technique and surprise function. In our studies, we relax the assumption about the demand, lead time and demand during lead time that follows a known distribution and then apply the minimax distribution free procedure to solve the problem. We develop an algorithm procedure to find the optimal order quantity and optimal value of the safety factor. Finally, the model is illustrated by a numerical example.     

Reducing lost-sales rate on the stochastic inventory model with defective goods for the mixtures of distributions

In this paper, we assume that the demands of different customers are not identical in the lead time. Thus, we investigate a continuous review inventory model involving controllable lead time and a random number of defective goods in buyer’s arriving order lot with partial lost sales for the mixtures of distributions of the lead time demand to accommodate more practical features of the real inventory systems. Moreover, we analyze the effects of increasing investment to reduce the lost sales rate when the order quantity, reorder point, lost sales rate and lead time are treated as decision variables. In our studies, we first assume that the lead time demand follows the mixture of normal distributions, and then relax the assumption about the form of the mixture of distribution functions of the lead time demand and apply the minimax distribution free procedure to solve the problem. By analyzing the total expected cost function, we develop an algorithm to obtain the optimal ordering policy and the optimal investment strategy for each case. Finally, we provide numerical examples to illustrate the results.     

Solving routing problems with pairwise synchronization constraints

Pairwise route synchronization constraints are commonly encountered in the field of service technician routing and scheduling and in the area of mobile care. Pairwise route synchronization refers to constraints that require that two technicians or home care workers visit the same location at exactly the same time. We consider constraints of this type in the context of the well-known vehicle routing problem with time windows and a generic service technician routing and scheduling problem. Different approaches for dealing with the problem of pairwise route synchronization are compared and several ways of integrating a synchronization component into a metaheuristic algorithm tailored to the original problems are analyzed. When applied to benchmark instances from the literature, our algorithm matches almost all available optimal values and it produces several new best results for the remaining instances.

     

Mixture distributions for modelling demand during lead time

A mixture distribution approach to modelling demand during lead time in a continuous-review inventory model is described. Using this approach, both lead time and demand per unit time can follow state-dependent distributions. By using mixtures of truncated exponentials functions to approximate these distributions, mixture distributions that can be easily manipulated in closed form can be constructed as the marginal distributions for lead time and demand per unit time. These are then used to approximate the mixture of compound distributions for demand during lead time. The technique is illustrated by first applying it to a ‘normal-gamma’ inventory problem, then by modelling a problem with empirical distributions for lead time and demand per unit time.     

Newsvendor with multiple options of expediting

We consider a manufacturer facing single period inventory planning problem with uncertain demand and multiple options of expediting. The demand comes at a certain time in the future. The manufacturer may order the product in advance with a relatively low cost. She can order additional amount by expediting after the demand is realized. There are a number of expediting options, each of which corresponds to a certain delivery lead time and a unit procurement price. The unit procurement price is decreasing over delivery lead time. The selling price is also decreasing over time. In this paper, we assume that the manufacturer must deliver all products to the customer in a single shipment. The problem can be formulated as a profit maximization problem. We develop structural properties and show how the optimal solution can be identified efficiently. In addition, we compare our model with the classical newsvendor model and obtain a number of managerial insights.     

Integrating operations and marketing decisions using delayed differentiation of products and guaranteed delivery time under stochastic demand

In this research, we integrate the issues related to operations and marketing strategy of firms characterized by large product variety, short lead times, and demand variability in an assemble-to-order environment. The operations decisions are the inventory level of components and semi-finished goods, and configuration of semi-finished goods. The marketing decisions are the products price and a lead time guarantee which is uniform for all products. We develop an integrated mathematical model that captures trade-offs related to inventory of semi-finished goods, inventory of components, outsourcing costs, and customer demand based on guaranteed lead time and price.The mathematical model is a two-stage, stochastic, integer, and non-linear programming problem. In the first stage, prior to demand realization, the operation and marketing decisions are determined. In the second stage, inventory is allocated to meet the demand. The objective is to maximize the expected profit per-unit time. The computational results on the test problems provide managerial insights for firms faced with the conflicting needs of offering: (i) low prices, (ii) guaranteed and short lead time, and (iii) a large product variety by leveraging operations decisions.     

Optimal strategies for general price-quality decision models of new products with learning production costs

The question of product quality permeates every level of business and is becoming crucial for the survival of modern manufacturing firms in automotive and high-tech industries. In this paper, we deal with the optimal price and quality policies for the introduction of a new product. On the supply side, the firm wants to determine the unit price and quality level over time given that unit cost declines along a learning curve, and increases if quality is made greater. On the demand side, dynamic demand is related to price and quality, as well as to cumulative sales (which represent diffusion and saturation effects). We will model this problem in a general framework that includes several previous results as special cases.By applying the maximum principle, we will derive the optimal price and quality policies and discover the interactions between these two major strategic marketing instruments, and the diffusion process. Several fundamental theoretical results will be established for the model. Under certain specified conditions higher prices do imply higher quality, and under other conditions the optimal price declines over time while the product quality improves. To illustrate these results, the theoretical results are applied to two specific-cases: the first one is a simple nonseparable demand growth function in price and quality, the other is a separable demand function of price and quality.     

Achieving sharp deliveries in supply chains through variance pool allocation

Variability reduction and business process synchronization are acknowledged as key to achieving sharp and timely deliveries in supply chain networks. In this paper, we develop an approach that facilitates variability reduction and business process synchronization for supply chains in a cost effective way. The approach developed is founded on an analogy between mechanical design tolerancing and supply chain lead time compression. We first present a motivating example to describe this analogy. Next, we define, using process capability indices, a new index of delivery performance called delivery sharpness which, when used with the classical performance index delivery probability, measures the accuracy as well as the precision with which products are delivered to the customers. Following this, we solve the following specific problem: how do we compute the allowable variability in lead time for individual stages of the supply chain so that specified levels of delivery sharpness and delivery probability are achieved in a cost-effective way? We call this the variance pool allocation (VPA) problem. We suggest an efficient heuristic approach for solving the VPA problem and also show that a variety of important supply chain design problems can be posed as instances of the VPA problem. One such problem, which is addressed in this paper, is the supply chain partner selection problem. We formulate and solve the VPA problem for a plastics industry supply chain and demonstrate how the solution can be used to choose the best mix of supply chain partners.     

The Significance of Correlated Demands and Variable Lead Times for Stock Control Policies

The current assumptions in stock control policies of independent demands and constant lead times are relaxed to include the case of first order autoregressive demand patterns and three different distributions of lead time. It is shown that where there is negative serial correlation, assumption of independence might lead to over provision of stock, whereas in cases of positive correlation the under provision will be very significant. This is aggravated as the expected lead time increases. These effects are illustrated by some numerical results.     

An inventory-transportation system with stochastic demand

We study a logistic system in which a supplier has to deliver a set of products to a set of retailers to face a stochastic demand over a given time horizon. The transportation from the supplier to each retailer can be performed either directly, by expensive and fast vehicles, or through an intermediate depot, by less expensive but slower vehicles. At most one time period is required in the former case, while two time periods are needed in the latter case. A variable transportation cost is charged in the former case, while a fixed transportation cost per journey is charged in the latter case. An inventory cost is charged at the intermediate depot. The problem is to determine, for each time period and for each product, the quantity to send from the supplier to the depot, from the depot to each retailer and from the supplier to each retailer, in order to minimize the total expected cost. We first show that the classical benchmark policy, in which the demand of each product at each retailer is set equal to the average demand, can give a solution which is infinitely worse with respect to the optimal solution. Then, we propose two classes of policies to solve this problem. The first class, referred to as Horizon Policies, is composed of policies which require the solution of the overall problem over the time horizon. The second class, referred to as Reoptimization Policies, is composed of a myopic policy and several rolling-horizon policies in which the problem is reoptimized at each time period, once the demand of the time period is revealed. We evaluate the performance of each policy dynamically, by using Monte Carlo Simulation.     

Forecasting demand variation when there are stockouts

This paper addresses the common problem of forecasting demand when there are a large number of stockouts. The well-known single period stochastic inventory (or ‘newsboy’) problem provides the optimum, single period, stocking level for a product subject to stochastic demand. There are many situations where repetitive ‘newsboy’ solutions are implemented to guide stocking of repeat, but related, products, such as newspapers, magazines, or perishable groceries. Implementation of the ‘newsboy’ solution requires forecasts of the distribution of demand, although there are many plausible cost parameters that lead to optimum stocking policies where there is a high probability of a stockout. The company is, therefore, faced with the problem of attempting to forecast demand when a high percentage of the available sales data reflects the stock available for sale, rather than the true demand.A procedure has been developed¹ to improve estimates of the mean and variance of the distribution of demand when there are stockouts, but this procedure fails when the percentage of stockouts increases above 50%. A modified stockout adjustment procedure is presented in this paper, and it is shown that use of this new procedure can lead to greatly improved estimates of demand parameters, and greatly improved profitability, when there are a high percentage of stockouts.     

An inventory model: What is the influence of the shape of the lead time demand distribution?

In this paper the influence of the shape of the lead time demand distribution is studied for a specific inventory model which is described in a preceding paper by Heuts and van Lieshout [4]. This continuous review inventory model uses as lead time demand distribution a Schmeiser-Deutsch distribution (S-D distribution) [9]. In a previous paper [4] an algorithm was given to solve the decision problem.In the literature attention is given to the following problem: what information on the demand during the lead time is necessary and sufficient to obtain good decisions. Using a (s, S) policy; Naddor [8] concluded that thespecific form of the lead time demand distribution is negligible, and that only its first two moments are essential. For a simple (s, q) control system Fortuin [3] comes to the same conclusion. Both authors analysed the case with known lead times and with given demand distributions from the class of two parameter distributions. So in fact their results are obvious, as the lead time demand distributions resulting from their suppositions are all nearly symmetric. We shall demonstrate that the skewness of the lead time demand distribution in our inventory model is also an important measure, which should be taken into account, as the cost differences with regard to the case where this skewness measure is not used, can be considerable.     

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.     

A perishable inventory model with positive order lead times

In this paper we will derive the necessary equations to determine the single period, periodic review, optimal incoming quantity for a single product with a useful lifetime of two periods, subject to a known positive order lead time and a lost sales policy. Generalization to the multiperiod, finite horizon or the constrained optimization problem can be easily accomplished. Optimal order quantities for lead times up to four periods are computed for different levels of demands and for different demand distributions. The experimental results indicate that the order quantity is a function of the order lead time and the quantity of goods on-hand and on order.     

Fuzzy mixture two warehouse inventory model involving fuzzy random variable lead time demand and fuzzy total demand

This paper considers a two-warehouse fuzzy-stochastic mixture inventory model involving variable lead time with backorders fully backlogged. The model is considered for two cases—without and with budget constraint. Here, lead-time demand is considered as a fuzzy random variable and the total cost is obtained in the fuzzy sense. The total demand is again represented by a triangular fuzzy number and the fuzzy total cost is derived. By using the centroid method of defuzzification, the total cost is estimated. For the case with fuzzy-stochastic budget constraint, surprise function is used to convert the constrained problem to a corresponding unconstrained problem in pessimistic sense. The crisp optimization problem is solved using Generalized Reduced Gradient method. The optimal solutions for order quantity and lead time are found in both cases for the models with fuzzy-stochastic/stochastic lead time and the corresponding minimum value of the total cost in all cases are obtained. Numerical examples are provided to illustrate the models and results in both cases are compared.     

Service network design with management and coordination of multiple fleets

We present a new optimization model for the tactical design of scheduled service networks for transportation systems where several entities provide service and internal exchanges and coordination with neighboring systems is critical. Internal exchanges represent border crossings necessitating changes of vehicles, while the coordination with neighboring systems represents intermodal operations. For a given demand, the model determines departure times of the services such that throughput time of the demand in the system is minimized. The model is an extension of the design-balanced capacitated multicommodity network design model that we denote service network design with asset management and multiple fleet coordination to emphasize the explicit modeling of different vehicle fleets. Data from a real-world problem addressing the planning of new rail freight services across borders serves to illustrate the capabilities of the formulation. We analyze how synchronization with collaborating services and removal of border-crossing operations impact the throughput time for the freight. We identify a significant potential for system performance enhancement from synchronization among collaborating services for the problem studied.