An inventory system with investment to reduce yield variability and set-up cost

The set-up cost and yield variability are given and fixed in existing production/inventory models with random yields. However, in many practical situations, they can be reduced by investment in modern production technology. In this paper, we consider an inventory system with random yield in which both the set-up cost and yield variability can be reduced through capital investment. The objective is to determine the optimal capital investment and ordering policies that minimize the expected total annual costs for the system. In addition, an iterative solution procedure is presented to find the optimal order quantity and reorder point and then the optimal set-up cost and yield standard deviation. Numerical examples are given to illustrate the results obtained and assess the cost savings by adopting capital investments. Managerial implications are also included.     

EOQ under Date-terms Supplier Credit

This paper examines EOQ under date-terms supplier credit, making explicit the separate effects on inventory policy of the two components of carrying cost-namely, financing cost and other variable holding costs. When a distinction between these types of holding costs is made, EOQ can no longer be expressed as a simple formula. Rather, optimal order quantity must be determined by search over a well-defined range of order quantities which encompasses the classical EOQ. The conclusion currently contained in the literature that the optimal order quantity under date terms is always given by an integer multiple of monthly demands no longer applies. In particular, a unique feature of date-terms credit is the possible existence of multiple EOQs.     

Multicriteria Trade-Offs in a Warehouse/Retailer System

Multiple Criteria Decision Making (MCDM) methodology is applied to a two-echelon serial inventory/distribution system, consisting of a warehouse and retailer. Different situations, such as deterministic and probabilistic demand, and whether marginal inventory costs are known, are discussed. Three non-linear multiobjective programming models and corresponding solution approaches are presented to obtain non-dominated inventory policies achieving trade-offs among objectives such as customer service, inventory investment and transportation cost. Our results are MCDM generalizations of Brown's exchange curve, Starr and Miller's optimal policy curve and Gardner and Dannenbring's optimal policy surface.     

A weighted goal programming approach for replenishment planning and space allocation in a supermarket

We propose a mixed integer non-linear goal programming model for replenishment planning and space allocation in a supermarket in which some constraints on budget, space, holding times of perishable items, and number of replenishments are considered and weighted deviations from two conflicting objectives, namely profitability and customer service level, are minimized. We apply a minimum–maximum approach to introduce demand where the maximum demand is a function of price change and allocated space. Each item is presented in the form of multiple brands, probably exposed to price changes, competing to obtain more space. In addition to inventory investment costs, replenishment costs, and inventory holding costs we also include costs related to non-productive use of space. The order quantity, the amount of allocated showroom and backroom spaces, and the cycle time of joint replenishments are key decision variables. We also propose an extended model in which price is a decision variable. Finally we solve the model using LINGO software and provide computational results.     

Profit maximization in an inventory system with time-varying demand,partial backordering and discrete inventory cycle

In this paper, an inventory problem where the inventory cycle must be an integer multiple of a known basic period is considered. Furthermore, the demand rate in each basic period is a power time-dependent function. Shortages are allowed but, taking necessities or interests of the customers into account, only a fixed proportion of the demand during the stock-out period is satisfied with the arrival of the next replenishment. The costs related to the management of the inventory system are the ordering cost, the purchasing cost, the holding cost, the backordering cost and the lost sale cost. The problem is to determine the best inventory policy that maximizes the profit per unit time, which is the difference between the income obtained from the sales of the product and the sum of the previous costs. The modeling of the inventory problem leads to an integer nonlinear mathematical programming problem. To solve this problem, a new and efficient algorithm to calculate the optimal inventory cycle and the economic order quantity is proposed. Numerical examples are presented to illustrate how the algorithm works to determine the best inventory policies. A sensitivity analysis of the optimal policy with respect to some parameters of the inventory system is developed. Finally, conclusions and suggestions for future research lines are given.

     

Effects of Centralization on Expected Costs in a Multi-location Newsboy Problem

This is a single-period, single-product inventory model with several individual sources of demand. It is a multi-location problem with an opportunity for centralization. The holding and penalty cost functions at each location are assumed to be identical. Two types of inventory system are considered in this paper: the decentralized system and the centralized system. The decentralized system is a system in which a separate inventory is kept to satisfy the demand at each source of demand. The centralized system is a system in which all demands are satisfied from one central warehouse. This paper demonstrates that, for any probability distribution of a location's demands, the following properties are always true: given that the holding and penalty cost functions are identical at all locations, (1) if the holding and penalty cost functions are concave functions, then the expected holding and penalty costs in a decentralized system exceed those in a centralized system, except that (2) if the holding and penalty cost functions are linear functions, and for any i≠j, P_ij, the coefficient of correlation between the ith location's demand and the jth location's demand is equal to 1, then the expected holding and penalty costs in a decentralized system are equal to those in a centralized system.     

Economic order quantity models with nonlinear holding costs

We consider a generalization of the classical Economic Order Quantity Model. The traditional parameters of unit cost, selling price, demand rate and set-up cost are constant but the holding cost per unit is a non-linear function of the length of time the item is held in stock. The application is to any inventory system where the value of the item decreases non-linearily the longer it is held in stock. For the case of deterministic demands we present the cost formula and the optimal order quantity for both finite and infinite horizons. For the case of stochastic demands the cost function is examined and the optimal order amount is presented. Computational results are presented indicating the effect of the non-linearity in holding costs.     

Pricing strategies for a non-replenishable item under variable demand and inflation

In this paper a model is developed for the pricing of non-replenishable inventory. Pricing strategies are examined that determine the minimum special price for immediate disposal of the entire stock. These are assessed using the return from inventory, net of holding costs, available for financing overheads and profits. Previous studies [2] and [3] have presented models for pricing the immediate disposal case. These have assessed the strategy on the basis of the lump sum generated at the end of a certain period. Their results gave, in many instances, very low special prices. This paper's result do not support their contentions in most instances. Indeed for many practical situations a special price of at least 80% of normal price is required. Substantially lower special prices are only justified when declining demand causes units of inventory to be sold at scrap value.     

A complement to “A comprehensive note on: An economic order quantity with imperfect quality and quantity discounts”

Chang [1] [H.-C. Chang, A comprehensive note on: an economic order quantity with imperfect quality and quantity discounts, Appl. Math. Model. 35 (10) (2011) 5208-5216] corrects a flaw in Lin’s inventory model [T.Y. Lin, An economic order quantity with imperfect quality and quantity discounts, Appl. Math. Model. 34 (10) (2010) 3158–3165]. Then, he develops an algorithm to find the optimal solution for the corrected Lin’s inventory model and furthermore derives close form expressions to determining the optimal solution to an EOQ inventory model considering items with imperfect quality with different holding costs for good and defective items. In both models there is a discrete variable and he presents some inequalities in order to find the integer value. This paper provides some simple formulas to obtain, in an easy way, the integral value for the discrete variable.     

Capacitated procurement planning with price-sensitive demand and general concave-revenue functions

This paper develops effective solution methods for discrete-time, finite-horizon procurement planning problems with economies of scale in procurement, price-sensitive demand, and time-invariant procurement capacities. Our models consider general concave-revenue functions in each time period, and seek to maximize total revenue less procurement and inventory holding costs. We consider the case in which prices may vary dynamically, as well the important practical case in which a constant price is required during the planning horizon. Under mild conditions on the revenue function properties, we provide polynomial-time solution methods for this problem class. The structural properties of optimal solutions that lead to efficient solution methods also serve to sharpen intuition regarding optimal demand management strategies in complex planning situations.     

A Lagrangean heuristic algorithm for disassembly scheduling with capacity constraints

This paper considers the problem of determining the disassembly schedule (quantity and timing) of products in order to satisfy the demand of their parts or components over a finite planning horizon. The objective is to minimize the sum of set-up, disassembly operation, and inventory holding costs. As an extension of the uncapacitated versions of the problem, we consider the resource capacity restrictions over the planning horizon. An integer program is suggested to describe the problem mathematically, and to solve the problem, a heuristic is developed using a Lagrangean relaxation technique together with a method to find a good feasible solution while considering the trade-offs among different costs. The effectiveness of the algorithm is tested on a number of randomly generated problems and the test results show that the heuristic suggested in this paper can give near optimal solutions within a short amount of computation time.     

Note: An application of the EOQ model with nonlinear holding cost to inventory management of perishables

In this note, we consider a variation of the economic order quantity (EOQ) model where cumulative holding cost is a nonlinear function of time. This problem has been studied by Weiss [Weiss, H., 1982. Economic order quantity models with nonlinear holding costs. European Journal of Operational Research 9, 56–60], and we here show how it is an approximation of the optimal order quantity for perishable goods, such as milk, and produce, sold in small to medium size grocery stores where there are delivery surcharges due to infrequent ordering, and managers frequently utilize markdowns to stabilize demand as the product’s expiration date nears. We show how the holding cost curve parameters can be estimated via a regression approach from the product’s usual holding cost (storage plus capital costs), lifetime, and markdown policy. We show in a numerical study that the model provides significant improvement in cost vis-à-vis the classic EOQ model, with a median improvement of 40%. This improvement is more significant for higher daily demand rate, lower holding cost, shorter lifetime, and a markdown policy with steeper discounts.     

Lot sizing for a single product recovery system with variable setup numbers

Inventory systems for joint remanufacturing and manufacturing have recently received considerable attention. In such systems, used products are collected from customers and are kept at the recoverable inventory warehouse for future remanufacturing. In this paper a production–remanufacturing inventory system is considered, where the demand can be satisfied by production and remanufacturing. The cost structure consists of the EOQ-type setup costs, holding costs and shortage costs. The model with no shortage case in serviceable inventory is first studied. The serviceable inventory shortage case is discussed next. Both models are considered for the case of variable setup numbers of equal sized batches for production and remanufacturing processes. For these two models sufficient conditions for the optimal type of policy, referring to the parameters of the models, are proposed.     

Production strategies for a stochastic lot-sizing problem with constant capacity

This paper presents a single item capacitated stochastic lot-sizing problem motibated by a Dutch company operating in a Make-To-Order environment. Due to a highly fluctuating and unpredictable demand, it is not possible to keep any finished goods inventory. In response to a customer's order, a fixed delivery date is quoted by the company. The objective is to determine in each period of the planning horizon the optimal size of production lots so that delivery dates are met as closely as possible at the expense of minimal average costs. These include set-up costs, holding costs for orders that are finished before their promised delivery date and penalty costs for orders that are not satisfied on time and are therefore backordered. Given that the optimal production policy is likely to be too complex in this situation, attention is focused on the development of heuristic procedures. In this paper two heuristics are proposed. The first one is an extension of a simple production strategy derived by Dellaert [5] for the uncapacitated version of the problem. The second heuristic is based on the well-known Silver-Meal algorithm for the case of deterministic time-varying demand. Experimental results suggest that the first heuristic gives low average costs especially when the demand variability is low and there are large differences in the cost parameters. The Silver-Meal approach is usually outperformed by the first heuristic in situations where the available production capacity is tight and the demand variability is low.     

Inventory systems with stochastic demand and supply: Properties and approximations

We model a retailer whose supplier is subject to complete supply disruptions. We combine discrete-event uncertainty (disruptions) and continuous sources of uncertainty (stochastic demand or supply yield), which have different impacts on optimal inventory settings. This prevents optimal solutions from being found in closed form. We develop a closed-form approximate solution by focusing on a single stochastic period of demand or yield. We show how the familiar newsboy fractile is a critical trade-off in these systems, since the optimal base-stock policies balance inventory holding costs with the risk of shortage costs generated by a disruption.     

Constraint programming for stochastic inventory systems under shortage cost

One of the most important policies adopted in inventory control is the replenishment cycle policy. Such a policy provides an effective means of damping planning instability and coping with demand uncertainty. In this paper we develop a constraint programming approach able to compute optimal replenishment cycle policy parameters under non-stationary stochastic demand, ordering, holding and shortage costs. We show how in our model it is possible to exploit the convexity of the cost-function during the search to dynamically compute bounds and perform cost-based filtering. Our computational experience show the effectiveness of our approach. Furthermore, we use the optimal solutions to analyze the quality of the solutions provided by an existing approximate mixed integer programming approach that exploits a piecewise linear approximation for the cost function.     

An Experimental Comparison of MRP Purchase Discount Methods

This paper addresses the managerial issue of how best to order purchased materials in MRP environments when discounts are available from vendors. The least unit cost, least period cost, McLaren's order moment, revised part-period balancing, incremental part-period balancing, traditional discount order quantity, and an optimal algorithm are experimentally investigated under a variety of simulated scenarios. Other experimental factors include the coefficient of variation in demand, forecast uncertainty beyond the current period, the average time between orders, the ratio of the discount quantity to the EOQ, the attractiveness of the discount, the length of the planning horizon, inventory holding costs, and the autocorrelation of demand. All factors tested in this comprehensive experiment significantly affected the performance of the discount ordering procedures. Furthermore, the results from this study suggest that the least unit cost, McLaren's order moment, the traditional discount order quantity, and the optimal procedures significantly out-perform the others. A further choice among these alternative methods was found to be a function of the operating environment and limitations that may exist on available computing time.     

Inventory models with variable lead time and present value

The figures for inventory make up a huge proportion of a company's working capital. Because of this, we formulated the optimal replenishment policy considering the time value of money to represent opportunity cost. In this article, we provide a mixed inventory model, in which the distribution of lead time demand is normal, to consider the time value. First, the study tries to find the optimal reorder point and order quantity at all lengths of lead time with components crashed to their minimum duration. Secondly, we develop a method to insure the uniqueness of the reorder point to locate the optimal solution. Finally, some numerical examples are given to illustrate our findings.     

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.     

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.