Inventory control for lognormal demand

This paper develops an explicit but approximate solution to the reorder point inventory model for lognormal lead time demand. Solution to the same model under a constraint on fraction of demands backordered is also obtained. Both solutions are extended to cover the three- and four-parameter lognormal families, and the methods are illustrated with hypothetical data.     

A note on defective units in an inventory model with sub-lot sampling inspection for variable lead-time demand with the mixture of free distributions

In a recent paper Wu and Ouyang (2000) assumed that an arriving order lot may contain some defective items and considered that the number of defective items in the sub‐lot sampled to be a random variable. They derived a modified mixture inventory model with backorders and lost sales, in which the order quantity, re‐order point, and the lead‐time were decision variables. In their studies they assumed that the lead‐time demand followed a normal distribution for the first model and relaxed the assumption about the form of the distribution function of the lead‐time demand for the second model. When the demand of the different customers is not identical with regard to the lead‐time, then one cannot use only a single distribution (such as Wu and Ouyang (2000) ) to describe the demand of the lead‐time. Hence, we extend and correct the model of Wu and Ouyang (2000) by considering the lead‐time demand with the mixed normal distributions (see Everitt and Hand (1981) , and Wu and Tsai (2001) ) for the first model and the lead‐time demand with the mixed distributions for the second model. And we also apply the minimax mixed distributions free approach to the second model. Moreover, we also develop an algorithm procedure to obtain the optimal ordering strategy for each case.     

Modelling of the inventory replenishment problem with a two-segment piecewise linear demand

The classical inventory replenishment problem with a linear function in demand uses a ‘single-segment’ linear function as its demand and can be modelled by a simple algorithm. Moreover, this article extends the algorithm to provide a heuristic solution for the inventory replenishment model with a two-segment linear function in demand called the ‘two-segment piecewise linear demand model’. In addition, this article proposes a general procedure for solving both models. Meanwhile, several examples taken from the literature illustrate our algorithm for these two models with convincing results. Furthermore, this study shows that when the demand is a two-segment piecewise linear function over time, it is better to use the proposed algorithm rather than devising a decoupled solution approach by treating segments separately. Finally, a sensitivity analysis of two factors, demand and cost, is performed. The model is highly extensible and applicable, so it can serve as an inventory planning tool to solve the replenishment problem.     

Inventory systems for deteriorating items with shortages and a linear trend in demand-taking account of time value

This paper derives an inventory model for deteriorating items with the demand of linear trend and shortages during the finite planning horizon considering the time value of money. A simple solution algorithm using a line search is presented to determine the optimal interval which has positive inventories. Numerical examples are given to explain the solution algorithm. Sensitivity analysis is performed to study the effect of changes in the system parameters.Scope and purpose The traditional inventory model considers the ideal case in which depletion of inventory is caused by a constant demand rate. However, in real-life situations there is inventory loss due to deterioration. In a realistic product life cycle, demand is increasing with time and eventually reaching zero. Most of the classical inventory models did not take into account the effects of inflation and time value of money. But in the past, the economic situation of most of the countries has changed to such an extent due to large scale inflation and consequent sharp decline in the purchasing power of money. So, it has not been possible to ignore the effects of inflation and time value of money any further. The purpose of this article is to present a solution procedure for the inventory problem of deteriorating items with shortages and a linear trend in demand taking account of time value.     

Lot size reorder point inventory model with controllable lead time and set-up cost

This paper deals with the lead time and set-up cost reductions problem on the modified lot size reorder point inventory model in which the production process is imperfect. We consider that the lead time can be shortened at an extra crashing cost, which depends on the length of lead time to be reduced and the ordering lot size. The option of investing in reducing set-up cost is also included. Two commonly used investment cost functional forms, logarithmic and power, are employed for set-up cost reduction. We assume that the stochastic demand during lead time follows a Normal distribution. The objective is simultaneously to optimize the lot size, reorder point, set-up cost and lead time. An algorithm of finding the optimal solution is developed, and two numerical examples are given to illustrate the results.     

A continuous review inventory model with the controllable production rate of the manufacturer

Optimal operating policy in most deterministic and stochastic inventory models is based on the unrealistic assumption that lead‐time is a given parameter. In this article, we develop an inventory model where the replenishment lead‐time is assumed to be dependent on the lot size and the production rate of the manufacturer. At the time of contract with a manufacturer, the retailer can negotiate the lead‐time by considering the regular production rate of the manufacturer, who usually has the option of increasing his regular production rate up to the maximum (designed) production capacity. If the retailer intends to reduce the lead‐time, he has to pay an additional cost to accomplish the increased production rate. Under the assumption that the stochastic demand during lead‐time follows a Normal distribution, we study the lead‐time reduction by changing the regular production rate of the manufacturer at the risk of paying additional cost. We provide a solution procedure to obtain the efficient ordering strategy of the developed model. Numerical examples are presented to illustrate the solution procedure.     

Mixture inventory model involving variable lead time and controllable backorder rate

This paper allows the backorder rate as a control variable to widen applications of Ouyang et al.'s model [J. Oper. Res. Soc. 47 (1996) 829]. In this study, we assume that the backorder rate is dependent on the length of lead time through the amount of shortages. We discuss two models that are perfect and partial information about the lead time demand distribution, that is, we first assume that the lead time demand follows a normal distribution, and then remove this assumption by only assuming that the first and second moments of the probability distribution of lead time demand are known. For each case, we develop an algorithm to find the optimal ordering strategy. Three numerical examples are given to illustrate solution procedure.     

Some remarks on an optimal order quantity and reorder point when supply and demand are uncertain

In the reports in the literature on inventory control, the effects of the random capacity on an order quantity and reorder point inventory control model have been integrated with lead time demand following general distribution. An iterative solution procedure has been proposed for obtaining the optimal solution. However, the resulting solution may not exist or it may not guarantee to give a minimum to the objective cost function, the expected cost per unit time. The aim of this study was to introduce a complete solution of the order quantity/reorder point problem, optimality, properties and bounds on the optimal order quantity and reorder point. The two most appealing distributions of lead time demand, normal and uniform distributions, in conjunction with an exponentially distributed capacity, are used to illustrate our findings in determining the optimal order quantity and reorder point.     

A minimax distribution free procedure for mixed inventory model involving variable lead time with fuzzy demand

In a recent paper, Ouyang and Wu applied the minimax decision approach to solve a continuous review mixed inventory model in which the lead time demand distribution information is unknown but the annual demand is fixed and given. However, in the practical situation, the annual demand probably incurs disturbance due to various uncertainties. In this article, we attempt to modify Ouyang and Wu's model by considering two fuzziness of annual demand (i.e., fuzzy number of annual demand and statistic-fuzzy number of annual demand) and to investigate a computing schema for the continuous review inventory model in the fuzzy sense. We give an algorithm procedure to obtain the optimal ordering strategy for each case.Scope and purposeIn most of the early literature dealing with inventory problems, either using deterministic or probabilistic models, lead time is viewed as a prescribed constant or a stochastic variable. Recently, some researchers (e.g., Liao and Shyu, Ben-Daya and Raouf, and Ouyang and Wu) incorporated the crashing lead time idea to continuous review inventory models, in which the annual demand is given and fixed. However, in the real situation, the annual demand will probably have a little disturbance due to various uncertainties. The purpose of this article is to modify the Ouyang and Wu's model to accommodate this reality, specifically, we apply the fuzzy set concepts to deal with the uncertain annual demand. We first consider a case where the annual demand is treated as the triangular fuzzy number. Then, we employ the statistical method to construct a confidence interval for the annual demand, and through it to establish the corresponding fuzzy number (namely, the statistic-fuzzy number). For each fuzzy case, we investigate a computing schema for the new model and develop an algorithm to find the optimal ordering strategy.     

The gravity multiple server location problem

Models for locating facilities and service providers to serve a set of demand points are proposed. The number of facilities is unknown, however, there is a given number of servers to be distributed among the facilities. Each facility acts as an M/M/k queuing system. The objective function is the minimization of the combined travel time and the waiting time at the facility for all customers. The distribution of demand among the facilities is governed by the gravity rule. Two models are proposed: a stationary one and an interactive one. In the stationary model it is assumed that customers do not consider the waiting time at the facility in their facility selection decision. In the interactive model we assume that customers know the expected waiting time at the facility and consider it in their facility selection decision. The interactive model is more complicated because the allocation of the demand among the facilities depends on the demand itself. The models are analyzed and three heuristic solution algorithms are proposed. The algorithms were tested on a set of problems with up to 1000 demand points and 20 servers.     

一种需求率随时间变化且允许缺货的库存模型

针对库存管理和控制中存在的实际问题,在最大程度降低库存运营成本的前提下,综合考虑了货物损坏率以及缺货率引起的损失等多种影响,提出了一个需求率为一般连续函数的库存模型,并进一步建立了该模型的两阶段优化方法.该方法通过简单的求解过程,就能够找到最优订货策略,从而有效的降低了库存成本.最后运用一个简单的数据实验,证明了该模型和方法的有效性和准确性.该库存成本函数模型及其求解方法也可以适用于需求率是非单调的随时间变化函数的模型.     

Periodic review fuzzy inventory model with variable lead time and fuzzy demand

This paper investigates a periodic review fuzzy inventory model with lead time, reorder point, and cycle length as decision variables. The main goal of this study is to minimize the expected total annual cost by simultaneously optimizing cycle length, reorder point, and lead time for the whole system based on fuzzy demand. Two models are considered in this paper: one with normal demand distribution and another with a distribution‐free approach. The model assumes a logarithmic investment function for lost‐sale rate reduction. Furthermore, two separate efficient computational algorithms are explained to obtain the optimal solution. Some numerical examples are given to illustrate the model.     

An economic production lot size model with increasing demand, shortages and partial backlogging

In this paper, an economic production quantity model is developed for a production–inventory system where the demand rate increases with time, the production rate is finite and adjustable in each cycle over an infinite planning horizon and shortages are permitted. The cost of adjusting the production rate depends linearly on the magnitude of the change in the production rate. During the stock‐out period, a known fraction of the unsatisfied demands is backordered while the remaining fraction is lost. The model is formulated taking the demand rate as a general increasing function of time and the optimal production policy is obtained for the special case of a linearly increasing demand rate. The proposed model is also shown to be suitable for a prescribed time horizon. A procedure to find approximately the minimum total cost of the system over a finite time horizon is suggested. A numerical example is taken to illustrate the solution procedure of the developed model.     

The vehicle routing problem with multiple prioritized time windows: A case study

This paper addresses Multi-objective Vehicle Routing Problem with Multiple Prioritized Time Windows (VRPMPTW) in which the distributer proposes a set of all non-overlapping time windows with equal or different lengths and the customers prioritize these delivery time windows. VRPMPTW aims to find a set of routes of minimal total traveling cost and maximal customer satisfaction (with regard to the prioritized time windows), starting and ending at the depot, in such a way that each customer is visited by one vehicle given the capacity of the vehicle to satisfy a specific demand. This problem is inspired from a real life application. The contribution of this paper lies in its addressing the VRPMPTW from a problem definition, modeling and methodological point of view. We developed a mathematical model for this problem. This model can simply be used for a wide range of applications where the customers have multiple flexible time windows and violation of time windows may drop the satisfaction levels of customers and lead to profit loss in the long term. A Cooperative Coevolutionary Multi-objective Quantum-Genetic Algorithm (CCMQGA) is also proposed to solve this problem. A new local search is designed and used in CCMQGA to reach an appropriate pareto front. Finally, the proposed approach is employed in a real case study and the results of the proposed CCMQGA are compared with the current solution obtained from managerial experience, the results of NSGA-II and the multi-objective quantum-inspired evolutionary algorithm.     

可控前置时间的连续盘点联合库存策略研究

鉴于控制前置时间对精益生产系统的重要性,在考虑买方与卖方合作的同时,扩展Goyal生产批量交货的假设,假设需求服从正态分布,以订购数量、运送次数与前置时间为决策变量,建立前置时间可控制的联合库存模型以确定适当的库存水平,使得库存总成本最小化,且可以通过协商在买卖双方之间进行节省成本的分配。进行了数值范例,并将联合库存模型与Banerjee模型、Goyal模型进行了比较。     

An EPQ model for deteriorating items with inventory-level-dependent demand and permissible delay in payments

This article develops an inventory model for exponentially deteriorating items under conditions of permissible delay in payments. Unlike the existing related models, we assume that the items are replenished at a finite rate and the demand rate of the items is dependent on the current inventory level. The objective is to determine the optimal replenishment policies in order to maximise the system's average profit per unit of time. A simple method is shown for finding the optimal solution of the model based on the derived properties of the objective function. In addition, we deduce some previously published results as the special cases of the model. Finally, numerical examples are used to illustrate the proposed model. Some managerial insights are also inferred from the sensitive analysis of model parameters.     

Computational procedure of optimal inventory model involving controllable backorder rate and variable lead time with defective units

This article considers that the number of defective units in an arrival order is a binominal random variable. We derive a modified mixture inventory model with backorders and lost sales, in which the order quantity and lead time are decision variables. In our studies, we also assume that the backorder rate is dependent on the length of lead time through the amount of shortages and let the backorder rate be a control variable. In addition, we assume that the lead time demand follows a 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. Furthermore, we develop an algorithm procedure to obtain the optimal ordering strategy for each case. Finally, three numerical examples are also given to illustrate the results.     

Joint pricing and replenishment policies for non-instantaneous deteriorating items with imprecise deterioration free time and credibility constraint

This study develops an inventory model for non-instantaneous deteriorating items with imprecise deterioration free time and credibility constraint. The model assumes price sensitive demand when the product has no deterioration and price and time dependent demand when the product has deterioration. Under these considerations, the study attempts to offer best policy for selling price and replenishment cycle for the retailer that aims at maximizing the total profit per unit time. Making use of nearest interval approximation and interval arithmetic, the single objective problem is transformed to multi objective problem. Employing Weighted Sum Method, an analytical approach along with simple algorithm is developed to identify Pareto optimal solution. Finally, the behavior of the model with varied parameters is illustrated in numerical examples.     

Storage space allocation to maximize inter-replenishment times

Given a set of storage spaces and a set of products, with specific space requirements and demand rates, we find the optimal product assignment that will lead to the longest time before any product is depleted. When demand rates are known with certainty, the assignment is found through the solution of a max–min integer program. When demand rates are stochastic with a common law, the assignment is found by solving an integer programme the objective of which is a non-homogeneous partial difference equation of first order. Unlike what common rules of thumb would dictate, our results show that the proportion of spaces assigned to a product is not necessarily equal to its demand frequency. Numerical computations show that employing the latter policy would result in inter-replenishment times that are about 24% shorter than the optimal solution.