Inventory‐Based Dynamic Pricing with Costly Price Adjustment

We study an average‐cost stochastic inventory control problem in which the firm can replenish inventory and adjust the price at anytime. We establish the optimality to change the price from low to high in each replenishment cycle as inventory is depleted. With costly price adjustment, scale economies of inventory replenishment are reflected in the cycle time instead of lot size—An increased fixed ordering cost leads to an extended replenishment cycle but does not necessarily increase the order quantity. A reduced marginal cost of ordering calls for an increased order quantity, as well as speeding up product selling within a cycle. We derive useful properties of the profit function that allows for reducing computational complexity of the problem. For systems requiring short replenishment cycles, the optimal solution can be easily computed by applying these properties. For systems requiring long replenishment cycles, we further consider a relaxed problem that is computational tractable. Under this relaxation, the sum of fixed ordering cost and price adjustment cost is equal to (greater than, less than) the total inventory holding cost within a replenishment cycle when the inventory holding cost is linear (convex, concave) in the stock level. Moreover, under the optimal solution, the time‐average profit is the same across all price segments when the inventory holding cost is accounted properly. Through a numerical study, we demonstrate that inventory‐based dynamic pricing can lead to significant profit improvement compared with static pricing and limited price adjustment can yield a benefit that is close to unlimited price adjustment. To be able to enjoy the benefit of dynamic pricing, however, it is important to appropriately choose inventory levels at which the price is revised.     

Multi-item inventory model with quantity-dependent inventory costs and demand-dependent unit cost under imprecise objective and restrictions: A geometric programming approach

A multi-item inventory model with constant demand and infinite replenishment is developed under the restrictions on storage area, total average shortage cost and total average inventory investment cost. These restrictions may be precise or imprecise. Here, it is assumed that inventory costs are directly proportional to the respective quantities, and unit purchase/production cost is inversely related to the demand. Restricted shortages are allowed but fully backlogged. First, the problem is formulated in crisp environment taking the deterministic and precise inventory parameters. It is solved by both geometric programming (GP) and gradient-based non-linear programming (NLP) methods. Later, the problem is formulated with fuzzy goals on constraints and objectives where impreciseness is introduced through linear membership functions. It is solved using the fuzzy geometric programming (FGP) method. The inventory models are illustrated with numerical values and compared with the crisp results. A sensitivity analysis on the optimum order quantity and average cost is also presented due to the variation in the tolerance of total average inventory investment cost and total average shortage cost following Dutta et al., 1993, Fuzzy Sets and Systems, 55, 133-142.     

The resource constrained single-item inventory problem with demand-dependent unit cost

In this paper, we present an economic order quantity (EOQ) with both demand-dependent unit cost and restrictions. An analytical solution of the EQO is derived using a recent and simple method, which isthe geometric programming approach. The EOQ inventory model with demand-dependent unit cost without any restriction and the classical EOQ inventory model are obtained.     

航空公司机上周转品多基地库存优化模型

在民航业日益激烈的市场竞争环境下，航空公司对成本控制的精细化管理显得尤为重要。本文基于航空公司的实际背景，针对为旅客提供的机上周转品，建立了一个多基地库存系统的库存优化模型。该模型以系统的总库存成本最小为目标，在考虑需求、回收、调运、安全库存等因素下，决策一个订货周期内的订货及调运方案。基于最优解的分析，在成本参数满足一定条件下，可以得到系统最优的期初订货量；在此基础上，可以将该模型转化为一个网络流模型，参考最小费用最大流算法，设计了一个多项式求解算法来求解该网络流模型，进而得到各基地之间的最优调运量，并证明该算法的最优性；此外，根据期初订货量可行解的范围，设计了一个求解原库存模型的启发式算法。通过实例分析，验证了该模型与两种算法的有效性。     

The disassembly line: balancing and modeling,by S.M. McGovern and S.M. Gupta

This note addresses a problem faced by an actual firm. The problem is to decide on the optimal level of product quality. In performing the economic analysis to determine product quality level, the firm considers revenue, production costs, and research and development costs. However, this note shows that ignoring inventory costs in the analysis will lead to suboptimal product quality levels. Also, including inventory costs in the analysis will lead to reduced production lot sizes. Numerical examples are used to illustrate the results of the model.     

An echelon inventory-based single-stage cost function for a two-station tandem system

We propose an alternative cost-accounting function for inventory control problems on a make-to-stock setting. Our proposal is based on observing that the traditional holding and backlog parameters introduce some odd short term distortions on the inventory state space. Our single-stage cost function accounts for echelon inventories and possesses a pair of cost parameters for each echelon inventory variable, depending on whether it is positive or negative. With the modified cost-accounting function, we study a twostation tandem system producing a single product, and investigate how it compares with the performances obtained with the usual single-stage cost function. The results available so far show that the optimal policies approach a multi-echelon base stock structure for each machine. Also, the service levels achieved are better under the modified function without increasing the levels of finished goods inventory.     

基于可控提前期和延迟供货的短生命周期产品库存模型

本文用斜坡型函数来描述短生命周期产品需求变化特征,用持有成本不断增加的形式来表示存货的无形变质所带来的损失,通过向供应商支付额外的赶工成本来缩短提前期,同时在允许缺货的情况下设置合理的缺货期价格折扣来控制订单的流失,即以价格折扣的损失来挽留住更多的顾客,使其总成本到达最优。本文在此基础上建立了短生命周期产品的库存模型,并提出了最优解的求解方法。     

A simulation study comparing performance of CONWIP and bottleneck-based release rules

Many firms seeking production economies and quicker throughput times have adopted cellular manufacturing techniques. New product introductions, increased product variety and process changes all add elements of uncertainty to the cell, and dynamic management techniques are required to achieve the benefits expected. This paper considers the problem of managing the flow of material into a manufacturing cell in order to maximize the output rate for a given level of work-inprocess inventory. The manufacturing cell is patterned after an Intel facility that assembles and tests microprocessors for the computer industry. The cell is studied under conditions in which a single bottleneck arises and those under which there are multiple bottlenecks. Alternative procedures for releasing material into the cell are evaluated in order to determine which offer the greatest advantage to managers.     

A new MRP/GT lot sizing heuristic: A simulation study

This paper studies the lot-sizing problem in Material Requirements Planning/Group Technology (MRP/GT) systems. A GT production cell is designed to produce many families of components. A major setup is required when switching from manufacturing one family of components to another family, and a minor setup is needed when switching from manufacturing a component type to another component type within the same family. Inventory holding cost is incurred if inventory level is positive, and inventory shortage cost is incurred if inventory level is negative, that is, backordering. The objective of the proposed lot-sizing problem is to minimize the sum of major and minor setup costs, holding and shortage costs, and regular production cost, and to meet simultaneously the demand requirements. The proposed problem is modelled into a linear integer program, a heuristic method to solve the problem is proposed, and a simulation experiment conducted to evaluate the performance of the proposed heuristic and some existing heuristics. The computational results show that the proposed heuristic is useful to reduce the total cost significantly over a wide variety of simulated environments.     

EOQ FORMULA: IS IT VALID UNDER INFLATIONARY CONDITIONS?

The classical analysis of the economic order quantity (EOQ) problem ignores the effect of inflation. When a firm's cost factors are expected to rise at an annual rate of 10 percent or more, what adjustments in order quantities should the firm make to control its lot-size inventory (or cycle stock)? Using a model that includes both inflationary trends and time discounting, it is concluded that inflation brings no incentive either to increase or to decrease order quantities. In addition, order quantities can be computed using the classical EOQ formula under inflationary conditions, provided that the cost of capital invested in inventory is interpreted as an inflation-free cost. This interpretation implies that changes in the inflation rate should not affect the cost of capital that is utilized in the EOQ formula for determining order quantities.     

Postponement implementation in integrated production and inventory plan under deterioration effects: a case study of a juice producer with limited storage capacity

Abstract

The aim of this study is to develop a production and inventory plan for a fresh apple juice producer. During harvest season, the producer extracts premium juice from freshly picked apples and keeps an inventory of these premium apples in his temperature-controlled storage facility. The producer extracts also regular juice from regular apples purchased from third-party storages. To satisfy future demand, the producer carries inventories of juice and apple. The levels of apple inventories are constrained by the producer’s limited storage space, but he can replenish regular apples. To assist the producer in facing demand uncertainty and deterioration of apples, we develop a production and inventory plan that incorporates postponement to mitigate demand uncertainty. As postponement decisions are shaped by the cost structure of inventories, we integrate in one model the postponement decisions and the deterioration mitigation decisions that can alter the inventory costs. We build multi-period stochastic programming with recourse model to determine juice batch sizes and apple inventories that maximize the producer’s expected profit. The optimal solution illustrates the use of time and form postponements. We discuss the interactions between postponement implementation and decisions to mitigate apples deterioration. We compare the production and inventory plans with and without postponement and with and without apple deterioration. We also present sensitivity analyses for the plan under varying inventory cost and storage space.     

考虑库存成本的企业集团转移定价决策分析

目前关于转移定价决策方法的研究文献中,大都忽略了中间产品流转过程中的库存管理成本问题.本文针对这种不足,在充分考虑中间产品流转过程中产生的库存持有成本、订货成本、订单处理成本和启动成本的基础上,研究了企业集团的转移定价决策问题.论文主要讨论了存在竞争性下游子公司的企业集团的转移定价决策问题,得出企业集团提供给一家子公司的最优转移价格为该子公司的边际成本与另一家子公司的最终产品利润加成.加成比例取决于最终产品市场的竞争程度.     

An optimal replenishment model for inventory items with normally distributed deterioration

This paper deals with the inventory replenishment problem for deteriorating items with normally distributed shelf life, continuous time-varying demand, and shortages under the inflationary and time discounting environment. The reasons of choosing normal are twofold: it is one of the most important probability phenomena in the real world due to the classical central limit theorem, and it is also one of the most commonly used lifetime distributions in reliability contexts. The problem is formulated as a dynamic programming model and solved by numerical search techniques. The solutions of the model determine the optimal replenishment schedule over a finite planning horizon so that the present worth of the future costs associated with the system is minimized. In the extensive experiments, we validate the model, demonstrate the optimal replenishment schedule and lot-size, and carry out a comparative study to ascertain its contribution. In addition, sensitivity analysis was provided to help identify the most crucial factors that affect system performance. The experimental result shows that the deteriorating problem solved by an appropriate model (i.e. the proposed normal model) can save the total cost up to 2% approximately. It also identifies that the magnitudes of purchase cost per unit and demand rate are the most significant parameters that affect the replenishment decisions and cost.     

A simulation-based multi-objective optimization framework: A case study on inventory management

We propose a simulation-based solution framework for tackling the multi-objective inventory optimization problem. The goal is to find appropriate settings of reorder point and order quantity to minimize three objective functions simultaneously, which are the expected values of the total inventory cost, the average inventory level, and the frequency of inventory shortage. We develop new algorithms that can exploit statistically valid ranking and selection (R&S) procedures and the desirable mechanics of conventional multi-objective optimization techniques. Two simulation algorithms are proposed to be applied in different scenarios depending on the preference information that is revealed either during or after the actual optimization process. Experimental results are provided to evaluate the efficiency of the developed algorithms and other existing solution frameworks.     

A ONE-PERIOD STOCHASTIC INVENTORY PROBLEM WITH A LUMP-SUM PENALTY COST

This paper presents an inventory problem related to the one-period stochastic inventory (or “newsboy”) problem. In this problem, the firm has to decide how much product to order to meet a random one-period demand. The version of the problem presented is novel in two respects. First, demand is explicitly permitted to be negative, and second, the penalty (or shortage) cost is assumed to be independent of the magnitude of the shortage. This situation is shown to change the form of the cost function and to complicate the determination of optimal policies. The form of the optimal policy is developed, and two example problems are presented in some detail.     

OPTIMAL DESIGN OF MULTI-PRODUCT MULTI-ECHELON INVENTORY SYSTEMS*

Large scale inventory distribution systems typically comprise a hierarchy of retail stores and warehouses. This paper presents a model for finding the optimal design of such systems. Given the maximum number of facilities under consideration and their locations, the problem is to determine which facilities to include in the system and which products to stock at each in order to minimize the cost of the system. Demand for the products may be deterministic or stochastic. To use the model it is necessary to know the optimal inventory policies for the multi-echelon systems under consideration; however, an important feature of this work is that any multi-echelon model may be used in tandem with this design model. Included is an example to illustrate the model and the two points which are the basis for its formulation: first, there is generally no single design which is best for all products; second, the design which is optimal for a given product is not necessarily the best design to use for that product when trying to minimize the cost of the entire system.     

A Continuous‐Review Inventory Model with Disruptions at Both Supplier and Retailer

We consider a continuous‐review inventory problem for a retailer who faces random disruptions both internally and externally (from its supplier). We formulate the expected inventory cost at this retailer and analyze the properties of the cost function. In particular, we show that the cost function is quasi‐convex and therefore can be efficiently optimized to numerically find the optimal order size from the retailer to the supplier. Computational experiments provide additional insight into the problem. In addition, we introduce an effective approximation of the cost function. Our approximation can be solved in closed form, which is useful when the model is embedded into more complicated supply chain design or management models.     

Coordinating replenishments in a supply chain with quality control considerations

We study the impact of coordinated replenishment, a popular supply chain initiative, on a quality control system. We use the (Q, S) policy to manage a two-item inventory control system. If the items are jointly replenished, the number ordered for each item varies from lot to lot. As the number varies, the sampling plan will also be changed. Companies have to determine sampling plans to minimize quality cost when the order is mixed with several items and the number of each item varies from order to order. Management's primary concern is to determine the optimal sampling sizes and acceptance numbers for all items in an order.     

Duality Approaches to Economic Lot‐Sizing Games

Sharing common production, resources, and services to reduce cost are important for not for profit operations due to limited and mission‐oriented budget and effective cost allocation mechanisms are essential for encouraging effective collaborations. In this study, we illustrate how rigorous methodologies can be developed to derive effective cost allocations to facilitate sustainable collaborations in not for profit operations by modeling the cost allocation problem arising from an economic lot‐sizing (ELS) setting as a cooperative game. Specifically, we consider the economic lot‐sizing (ELS) game with general concave ordering cost. In this cooperative game, multiple retailers form a coalition by placing joint orders to a single supplier in order to reduce ordering cost. When both the inventory holding cost and backlogging cost are linear functions, it can be shown that the core of this game is non‐empty. The main contribution of this study is to show that a core allocation can be computed in polynomial time under the assumption that all retailers have the same cost parameters. Our approach is based on linear programming (LP) duality. More specifically, we study an integer programming formulation for the ELS problem and show that its LP relaxation admits zero integrality gap, which makes it possible to analyze the ELS game by using LP duality. We show that there exists an optimal dual solution that defines an allocation in the core. An interesting feature of our approach is that it is not necessarily true that every optimal dual solution defines a core allocation. This is in contrast to the duality approach for other known cooperative games in the literature.     

Analysis and Management of Periodic Review,Order‐Up‐To Level Inventory Systems with Order Crossover

In this article, we investigate the (R, S) periodic review, order‐up‐to level inventory control system with stochastic demand and variable leadtimes. Variable leadtimes can lead to order crossover, in which some orders arrive out of sequence. Most theoretical studies of order‐up‐to inventory systems under variable leadtimes assume that crossovers do not occur and, in so doing, overestimate the standard deviation of the realized leadtime distribution and prescribe policies that can inflate inventory costs. We develop a new analytic model of the expected costs associated with this system, making use of a novel approximation of the realized (reduced) leadtime standard deviation resulting from order crossovers. Extensive experimentation through simulation shows that our model closely approximates the true expected cost and can be used to find values of R and S that provide an expected cost close to the minimum cost. Taking account of, as opposed to ignoring, crossovers leads, on average, to substantial improvements in accuracy and significant cost reductions. Our results are particularly useful for managers seeking to reduce inventory costs in supply chains with variable leadtimes.