A multi-product continuous review inventory system in stochastic environment with budget constraint

Common characteristics of inventory systems include uncertain demand and restrictions such as budgetary and storage space constraints. Several authors have examined budget constrained multi-item stochastic inventory systems controlled by continuous review policies without considering marginal review shortage costs. Existing models assume that purchasing costs are paid at the time an order is placed, which is not always the case since in some systems purchasing costs are paid when order arrive. In the latter case the maximum investment in inventory is random since the inventory level when an order arrives is a random variable. Hence payment of purchasing costs on delivery yields a stochastic budget constraint for inventory. In this paper with mixture of back orders and lost sales, we assume that mean and variance of lead time demand are known but their probability distributions are unknown. After that, we apply the minimax distribution free procedure to find the minimum expected value of the random objective function with budget constraint. The random budget constraint is transformed to crisp budget constraint by chance-constraint technique. Finally, the model is illustrated by a numerical example.     

An inventory control system for products with optional components under service level and budget constraints

Modularization and customization have made enterprises face the multi-item inventory problems and the interactions among those items. A powerful, affordable information technology system can make the continuous review inventory policy more convenient, efficient, and effective. In this study, a (Q, r) model is developed to find the optimal lot size and reorder point for a multi-item inventory with interactions between necessary and optional components. In order to accurately approximate costs, the service cost is introduced and defined in proportion to the service level. In addition, the service cost and purchasing cost are taken simultaneously, and are treated as a budget constraint for executives to consider because the firm’s strategy could influence the choice of service level. The proposed model is formulated as a nonlinear optimization problem, as the service level is nonlinear. Thus, some known procedures are revised to solve this problem and the results are compared with other models. The results show that the revised procedure performs better than the N–R procedure, leading to important insights about inventory control policy.     

Inventory policy for an item with inflation induced purchasing price,selling price and demand with immediate part payment

In this paper, an inventory policy for an item is presented with inflation and selling price dependent demand under deterministic and random planning horizons allowing and not allowing shortages. In addition, there is a provision for (i) an immediate part payment (variable) to the wholesaler, (ii) borrowing some money from money lending source for the immediate part payment, (iii) earning a discount on purchasing price and relaxation on credit period from the wholesaler against the advance payment and (iv) delay in payment for the rest allowed by wholesaler. The payment to the source is made at the end of the business period with some interest charged. Against the above conjectures, inventory models under the finite (crisp) and random planning horizons have been formulated with respect to the retailer’s point of view for maximum profit. The nonlinear optimization method – Generalized Reduced Gradient (GRG) method is used to find the optimal solutions and the corresponding maximum profits for the different sets of given numerical data. Some sensitivity analyses are made and presented graphically. As particular cases, the results of the crisp models and the case without shortages are obtained from those of the stochastic model and the case with shortages respectively.     

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.     

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.     

The optimality of myopic stocking policies for systems with decreasing purchasing prices

This paper studies the stocking/replenishment decisions for inventory systems where the purchasing price of an item decreases overtime. In a periodic review setting with stochastic demands, we model the purchasing prices of successive periods as a stochastic and decreasing sequence. To minimize the expected total discounted costs (purchasing, inventory holding and shortage penalty) for systems with backlogging and lost sales, we derive conditions, regarding the cost parameters, under which myopic stocking policies are optimal.     

Towards a normative model for inventory cost management in a generalized ABC classification system

This paper establishes a general ABC inventory classification system as the foundation for a normative model of the maintenance cost structure and stock turnover characteristics of a large, multi-item inventory system with constant demand. For any specified number of inventory classes, the model allows expression of the overall system combined ordering and holding cost in terms of (i) the re-ordering frequencies for the items in each inventory class and (ii) the inventory class structure, that is, the proportion of the total system's items that are in each inventory class. The model yields a minimum total maintenance cost function, which reflects the effect of class structure on inventory maintenance costs and turnover. If the Pareto curve (a.k.a. Distribution-by-value function) for the inventory system can be expressed (or approximated) analytically, the model can also be used to determine an optimal class structure, as well as an appropriate number of inventory classes. A special case of the model produces a simply structured, class-based ordering policy for minimizing total inventory maintenance costs. Using real data, the cost characteristics of this policy are compared to those of a heuristic, commonly used by managers of multi-item inventory systems. This cost comparison, expressed graphically, underscores the need for normative modelling approaches to the problem of inventory cost management in large, multi-item systems.     

An efficient algorithm for a generalized joint replenishment problem

In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An efficient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this algorithm can be used for deterministic multi-item inventory problems, with general cost rate functions and possibly service level constraints, of which the well-known joint replenishment problem is a special case. Some useful results in determining the optimal control parameters are derived, and worked out for piecewise linear cost rate functions. Numerical results for this case show that the algorithm significantly outperforms other solution methods, both in the quality of the solution and in the running time.     

Two storage inventory model in a mixed environment

Multi-item inventory models with two storage facility and bulk release pattern are developed with linearly time dependent demand in a finite time horizon under crisp, stochastic and fuzzy-stochastic environments. Here different inventory parameters—holding costs, ordering costs, purchase costs, etc.—are assumed as probabilistic or fuzzy in nature. In particular cases stochastic and crisp models are derived. Models are formulated as profit maximization principle and three different approaches are proposed for solution. In the first approach, fuzzy extension principle is used to find membership function of the objective function and then it’s Graded Mean Integration Value (GMIV) for different optimistic levels are taken as equivalent stochastic objectives. Then the stochastic model is transformed to a constraint multi-objective programming problem using Stochastic Non-linear Programming (SNLP) technique. The multi-objective problems are transferred to single objective problems using Interactive Fuzzy Satisfising (IFS) technique. Finally, a Region Reducing Genetic Algorithm (RRGA) based on entropy has been developed and implemented to solve the single objective problems. In the second approach, the above GMIV (which is stochastic in nature) is optimized with some degree of probability and using SNLP technique model is transferred to an equivalent single objective crisp problem and solved using RRGA. In the third approach, objective function is optimized with some degree of possibility/necessity and following this approach model is transformed to an equivalent constrained stochastic programming problem. Then it is transformed to an equivalent single objective crisp problem using SNLP technique and solved via RRGA. The models are illustrated with some numerical examples and some sensitivity analyses have been presented.     

Economic order quantity under advance payment

Though advance payment is widely used in practice, its influences on buyer’s inventory policy are rarely discussed. This paper investigates the buyer’s inventory policy under advance payment, including all payment in advance and partial-advanced–partial-delayed payment. The buyer’s ordering policy is derived by minimizing his total inventory costs including inventory holding cost, ordering cost, and interest cost caused by advance payment or delayed payment. The conclusions show that when all the payment is paid in advance, the buyer’s optimal replenishment cycle is influenced only by the price discount associated with advance payment, and the length of advance payment has no effect. For the partial-advanced–partial-delayed payment case, the buyer’s replenishment cycle is also not influenced by the length of advance period. However, in this situation, the delayed period and the price discount may have impacts on the inventory policy. We also use discounted cash flow (DCF) model to derive the buyer’s replenishment cycle and show that the replenishment cycle is negatively related to the length of advance period. Numerical examples are presented to illustrate the results.     

Stochastic model order reduction in randomly parametered linear dynamical systems

This study focuses on the development of reduced order models for stochastic analysis of complex large ordered linear dynamical systems with parametric uncertainties, with an aim to reduce the computational costs without compromising on the accuracy of the solution. Here, a twin approach to model order reduction is adopted. A reduction in the state space dimension is first achieved through system equivalent reduction expansion process which involves linear transformations that couple the effects of state space truncation in conjunction with normal mode approximations. These developments are subsequently extended to the stochastic case by projecting the uncertain parameters into the Hilbert subspace and obtaining a solution of the random eigenvalue problem using polynomial chaos expansion. Reduction in the stochastic dimension is achieved by retaining only the dominant stochastic modes in the basis space. The proposed developments enable building surrogate models for complex large ordered stochastically parametered dynamical systems which lead to accurate predictions at significantly reduced computational costs.     

大庆油田物资采购及库存优化机制设计与模型研究

本文结合大庆油田物资采购中的实际问题, 考虑物资市场、需求、库存三方之间的不确定性和复杂性,分别讨论了物资采购价格时变、物资需求时变、以及不同仓储容量限制下的库存优化模型的研究进展。进一步,设计了针对大庆油田物资的采购及库存优化机制,并选取大庆油田实际采购中的4种A类物资,基于时间序列方法和0-1混合整数规划,分别对机制中的价格预测部分和策略优化部分进行了数值试算,结果表明,基于准确度较高的预测价格,运用混合0-1整数规划模型制定的多品种物资的最优联合采购策略,可以实现采购成本的节省,相比于4种物资2009年的实际采购成本,节约比率高达7.66%,同时价格预测的精度也得到了用户的认可。该机制为油田物资采购和库存优化管理项目中的辅助决策支持系统原型设计提供了参照。但考虑到大庆油田实际采购中的各种复杂因素的影响,还需进一步完善该优化机制,并对相关模型进行改进。     

Optimizing multi-item multi-period inventory control system with discounted cash flow and inflation: Two calibrated meta-heuristic algorithms

A mixed binary integer mathematical programming model is developed in this paper for ordering items in multi-item multi-period inventory control systems, in which unit and incremental quantity discounts as well as interest and inflation factors are considered. Although the demand rates are assumed deterministic, they may vary in different periods. The situation considered for the problem at hand is similar to a seasonal inventory control model in which orders and sales happen in a given season. To make the model more realistic, three types of constraints including storage space, budget, and order quantity are simultaneously considered. The goal is to find optimal order quantities of the products so that the net present value of total system cost over a finite planning horizon is minimized. Since the model is NP-hard, a genetic algorithm (GA) is presented to solve the proposed mathematical problem. Further, since no benchmarks can be found in the literature to assess the performance of the proposed algorithm, a branch and bound and a simulated annealing (SA) algorithm are employed to solve the problem as well. In addition, to make the algorithms more effective, the Taguchi method is utilized to tune different parameters of GA and SA algorithms. At the end, some numerical examples are generated to analyze and to statistically and graphically compare the performances of the proposed solving algorithms.     

Simple Models and Insights for Warehouse Sizing

This study is concerned with minimizing the total discounted cost of operating an inventory system and providing the warehouse space necessary to accommodate the replenishment lots, under the assumption of constant product demand. The use of an approximation objective function for the single-item case allows the optimal warehouse size as well as the ratio of relevant investment costs to relevant inventory costs to be written in closed-form. Based upon the value of this ratio, circumstances are identified under which an integrated approach is justified, and others under which the inventory policy and storage capacity can be determined sequentially. The multi-item version of the problem under study is solved by the Lagrangian multiplier method, given that no coordination takes place between the items. Finding the optimal Lagrange multiplier can be accomplished efficiently by the Newton–Raphson method.     

The influence of demand variability on the performance of a make-to-stock queue

Variability, in general, has a deteriorating effect on the performance of stochastic inventory systems. In particular, previous results indicate that demand variability causes a performance degradation in terms of inventory related costs when production capacity is unlimited. In order to investigate the effects of demand variability in capacitated production settings, we analyze a make-to-stock queue with general demand arrival times operated according to a base-stock policy. We show that when demand inter-arrival distributions are ordered in a stochastic sense, increased arrival time variability indeed leads to an augmentation of optimal base-stock levels and to a corresponding increase in optimal inventory related costs. We quantify these effects through several numerical examples.     

The Distribution Free Newsboy Problem: Review and Extensions

We present here a new, very compact, proof of the optimality of Scarf's ordering rule for the newsboy problem where only the mean and the variance of the demand are known. We then extend the analysis to the recourse case, where there is a second purchasing opportunity; to the fixed ordering cost case, where a fixed cost is charged for placing an order; to the case of random yields; and to the multi-item case, where multiple items compete for a scarce resource.     

Managing inventories with one-way substitution: A newsvendor analysis

This paper presents an insightful approach to analyze two-item periodic inventory systems with one-way substitution. The objective is to minimize the expected total cost per period, which consists of expected purchasing costs, expected inventory holding costs, expected shortage costs, and expected adjustment costs. This approach helps derive the optimality conditions in both single-period and infinite horizon settings and yields useful insights into the impact of substitution on the service level, the optimality of a borderline case in which the order-up-to level of the inflexible item is reduced to zero, and the pivotal role of the purchasing cost.     

An inventory control model with stochastic review interval and special sale offer

Periodic review inventory models are widely used in practice, especially for inventory systems in which many different items are purchased from the same supplier. However, most of periodic review models have assumed a fixed length of the review periods. In practice, it is possible that the review periods are of a random (stochastic) length. This paper presents an inventory control model in the case of random review intervals and special sale offer from the supplier. The replenishment interval is assumed to obey from two different distributions, namely, exponential and uniform distributions. Also, shortages are allowed in the term of partial backordering. For this model, its convexity condition is discussed and closed form solutions are proposed.     

Inventory control for point-of-use locations in hospitals

Most inventory management systems at hospital departments are characterised by lost sales, periodic reviews with short lead times, and limited storage capacity. We develop two types of exact models that deal with all these characteristics. In a capacity model, the service level is maximised subject to a capacity restriction, and in a service model the required capacity is minimised subject to a service level restriction. We also formulate approximation models applicable for any lost-sales inventory system (cost objective, no lead time restrictions etc). For the capacity model, we develop a simple inventory rule to set the reorder levels and order quantities. Numerical results for this inventory rule show an average deviation of 1% from the optimal service levels. We also embed the single-item models in a multi-item system. Furthermore, we compare the performance of fixed order size replenishment policies and (R,?s,?S) policies.     

Dynamic uncapacitated lot sizing with random demand under a fillrate constraint

This paper deals with the single-item dynamic uncapacitated lot sizing problem with random demand. We propose a model based on the “static uncertainty” strategy of Bookbinder and Tan (1988). In contrast to these authors, we use exact expressions for the inventory costs and we apply a fillrate constraint. We present an exact solution method and modify several well-known dynamic lot sizing heuristics such that they can be applied for the case of dynamic stochastic demands. A numerical experiment shows that there are significant differences in the performance of the heuristics whereat the ranking of the heuristics is different from that reported for the case of deterministic demand.