Optimal control policy for a standing order inventory system

In this paper, we consider a standing order inventory system in which an order of fixed size arrives in each period. Since demand is stochastic, such a system must allow for procurement of extra units in the case of an emergency and sell-offs of excess inventory. Assuming the average-cost criterion, Rosenshine and Obee (Operations Research 24 (1976) 1143–1155) first studied such a system and devised a 4-parameter inventory control policy that is not generally optimal. The current paper uses dynamic programming to determine the optimal control policy for a standing order system, which consists of only two operational parameters: the dispose-down-to level and order-up-to level. Either the average-cost or discounted-cost criterion can be assumed in the proposed model. Also, both the backlogged and lost-sales problems are investigated in this paper. By using a convergence theorem, we stop the dynamic programming computation and obtain the two optimal parameters.     

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.     

On a multi-period supply chain system with supplementary order opportunity

This paper considers a supplementary supply–order system in a multi-period situation. In each period, the buyer first places an initial order based on the demand prediction; he has the opportunity to place a supplementary order with the supplier after the demand of that period is realized. The supplier maintains an inventory, and decides the quantity to be produced and the quantity to be provided for the supplementary order in each time period. We formulate the problem as a multi-period inventory game, and derive the optimal production and order policies for the supplier and buyer, respectively. The existence and uniqueness of Nash equilibrium is proved in the generalized multi-period setting, and the closed-form Nash equilibrium solution is obtained when the parameters are stationary. Numerical study is performed to reveal more managerial insights. We find that the supplementary supply–order mechanism, if designed properly, can effectively improve the multi-period supply chain performance.     

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.     

Optimal inventory replenishment policy for a queueing system with finite waiting room capacity

We treat an inventory control problem in a facility that provides a single type of service for customers. Items used in service are supplied by an outside supplier. To incorporate lost sales due to service delay into the inventory control, we model a queueing system with finite waiting room and non-instantaneous replenishment process and examine the impact of finite buffer on replenishment policies. Employing a Markov decision process theory, we characterize the optimal replenishment policy as a monotonic threshold function of reorder point under the discounted cost criterion. We present a simple procedure that jointly finds optimal buffer size and order quantity.     

Optimal production control of a failure-prone machine

We consider a problem of optimal production control of a single unreliable machine. The objective is to minimize a discounted convex inventory/backlog cost over an infinite horizon. Using the variational analysis methodology, we develop the necessary conditions of optimality in terms of the co-state dynamics. We show that an inventory-threshold control policy is optimal when the work and repair times are exponentially distributed, and demonstrate how to find the value of the threshold in this case. We consider also a class of distributions concentrated on finite intervals and prove properties of the optimal trajectories, as well as properties of an optimal inventory threshold that is time dependent in this case.     

A genetic algorithm for optimal operating parameters of VMI system in a two-echelon supply chain

This paper deals with the operational issues of a two-echelon single vendor–multiple buyers supply chain (TSVMBSC) model under vendor managed inventory (VMI) mode of operation. The operational parameters to the above model are: sales quantity and sales price that determine the channel profit of the supply chain, and contract price between the vendor and the buyer, which depends upon the understanding between the partners on their revenue sharing. In order to find out the optimal sales quantity for each buyer in TSVMBSC problem, a mathematical model is formulated. Optimal sales price and acceptable contract price at different revenue share are subsequently derived with the optimal sales quantity. A genetic algorithm (GA) based heuristic is proposed to solve this TSVMBSC problem, which belongs to nonlinear integer programming problem (NIP). The proposed methodology is evaluated for its solution quality. Furthermore, the robustness of the model with its parameters, which fluctuate frequently and are sensitive to operational features, is analysed.     

On the relaxation gap for PDE mixed-integer optimal control problems

Mixed-integer optimal control problems require taking discrete and continuous control decisions for the optimization of a dynamical system. We consider dynamics governed by partial differential equations of evolution type and assess the problem by relaxation and rounding strategies. For this solution approach, we present a priori estimates for semilinear evolutions on Banach spaces concerning the optimality gap. The theoretical results show that the gap can be made arbitrary small. We demonstrate the numerical performance of the approach on benchmark problems of parabolic type motivated from thermal manufacturing and of hyperbolic type motivated from traffic flow control. (© 2016 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The risk-averse newsvendor problem with random capacity

We study the effect of capacity uncertainty on the inventory decisions of a risk-averse newsvendor. We consider two well-known risk criteria, namely Value-at-Risk (VaR) included as a constraint and Conditional Value-at-Risk (CVaR). For the risk-neutral newsvendor, we find that the optimal order quantity is not affected by the capacity uncertainty. However, this result does not hold for the risk-averse newsvendor problem. Specifically, we find that capacity uncertainty decreases the order quantity under the CVaR criterion. Under the VaR constraint, capacity uncertainty leads to an order decrease for low confidence levels, but to an order increase for high confidence levels. This implies that the risk criterion should be carefully selected as it has an important effect on inventory decisions. This is shown for the newsvendor problem, but is also likely to hold for other inventory control problems that future research can address.     

Note on sensitivity analysis of inventory model with partial backorders

In reality, most of the values used for estimating future inventory are parameters derived from the present inventory model. Therefore, researchers must consider how changes in related environments will impact these parameters. A sensitivity analysis explores the impact on the optimal solution when the parameter values vary. This note extends Chu and Chung’s [European Journal of Operational Research 152 (2004) 289–295] paper for the sensitivity analysis of the inventory model with partial backorders. We found the criterion for determining when to run the inventory system. This new discovery deserves careful examination. Numerical examples are provided to demonstrate our findings.     

Vector measure as controls for explicit nonlinear impulsive system of fed-batch culture

In this paper, we consider an optimal control problem of microbial fermentation process in which glycerol is converted to 1,3-propanediol by Klebsiella pneumoniae in fed-batch culture. During the period of reaction, the variation of pH value is monitored to determine glycerol replenishment quantity, guaranteeing that microorganism can always keep growing fast under enough nutrition. Every time pH value is lower than seven, the quantity of glycerol added is such that pH value returns seven again. Glycerol is poured into reactor at discrete time instant and the quantity is controllable. The problem is to determine for each discrete time instant the glycerol quantity to add and maximize the final concentration of 1,3-propanediol. We present a controlled explicit nonlinear impulsive dynamical system of fed-batch culture with state independent vector measures as controls and study the existence, uniqueness, boundedness, continuous dependence and Gâteaux differentiability of its solution with respect to controls. We then propose a multiple objective programming model and demonstrate the regularity of cost functionals and weak compactness of admissible control set. Finally we discuss the existence of optimal control and implement a hybrid particle swarm optimization algorithm to solve the model optimally. Computational results are presented on a numerical example.     

Cost-effective inventory control in a value-added manufacturing system

This paper considers the cost-effective inventory control of work-in-process (WIP) and finished products in a two-stage distributed manufacturing system. The first stage produces a common WIP, and the second stage consists of several production sites that produce differentiated products with different capacity and service level requirements. The unit inventory holding cost is higher at the second stage. This paper first uses a network of inventory-queue model to evaluate the inventory cost and service level achievable for given inventory control policy, and then derives a very simple algorithm to find the optimal inventory control policy that minimizes the overall inventory holding cost and satisfies the given service level requirements. Some managerial insights are obtained through numerical examples.     

模糊需求下订购批量问题的研究

库存管理模型在现实生活中有着广泛的运用,它为管理决策者有效地确定最佳订购批量提供帮助.然而,由于历史数据的缺乏,需求量在很多情况下往往被主观地确定,因而带有一定的模糊性.本文针对两种不同类型的模糊需求:离散型与连续型,运用模糊理论分别建立了相应的模糊库存模型.该模型不同于已有的模糊库存模型如下:在现有的模糊库存的文献中,大多采用的是利用模糊集的知识对确定EOQ模型加以研究,而本文从模糊理论的角度对报童问题进行研究.     

An inventory control problem for deteriorating items with back-ordering and financial considerations

This paper investigates the effects of time value of money and inflation on the optimal ordering policy in an inventory control system. We proposed an economic order quantity model to manage a perishable item over the finite horizon planning under which back-ordering and delayed payment are assumed. The demand and deterioration rates are constant. The present value of total cost during the planning horizon in this inventory system is modeled first, then a three phases solution procedure is proposed to derive the optimal order and shortage quantities, and the number of replenishment during the planning horizon. Finally, the proposed model is illustrated through numerical examples and the sensitivity analysis is reported to find some managerial insights.     

The impact of dynamic pricing on the economic order decision

This paper analyzes the impact of dynamic pricing on the single product economic order decision of a monopolist retailer. Items are procured from an external supplier according to the economic order quantity (EOQ) model and are sold to customers on a single market without competition following the simple monopolist pricing problem. Coordinated decision making of optimal pricing and ordering is influenced by operating costs – including ordering and inventory holding costs – and the demand rate obtained from a price response function. The retailer is allowed to vary the selling price, either in a fixed number of discrete points in time or continuously. While constant and continuous pricing have received much attention in the literature, problems with a limited number of price changes are rather rare. This paper illustrates the benefit of dynamically changing prices to achieve operational efficiency in the EOQ model, that is to trigger high demand rates when inventories are high. We provide structural properties of the optimal time instants when the price should be changed. Taking into account costs for changes in price, it provides numerical guidance on number, timing, and size of price changes during an order cycle. Numerical examples show that the benefits of dynamic pricing in an EOQ framework can be achieved with only a few price changes and that products being unprofitable under static pricing may become profitable under dynamic pricing.     

Optimal production control of a dynamic two-product manufacturing system with setup costs and setup times

This paper deals with the optimal control of a one-machine two-product manufacturing system with setup changes, operating in a continuous time dynamic environment. The system is deterministic. When production is switched from one product to the other, a known constant setup time and a setup cost are incurred. Each product has specified constant processing time and constant demand rate, as well as an infinite supply of raw material. The problem is formulated as a feedback control problem. The objective is to minimize the total backlog, inventory and setup costs incurred over a finite horizon. The optimal solution provides the optimal production rate and setup switching epochs as a function of the state of the system (backlog and inventory levels). For the steady state, the optimal cyclic schedule is determined. To solve the transient case, the system's state space is partitioned into mutually exclusive regions such that with each region, the optimal control policy is determined analytically.     

Optimal control existence results for general discrete systems

General existence theorems for discrete optimal control problems are derived. It is assumed that dynamical equations of the system, as well as all control and state constraints, depend on the finite history of the system. All results are formulated in a general way in regular topological spaces. To prove such theorems, some basic concepts and results of the theory of the so-called multivalued mappings are necessary which are briefly summarized. The imposed assumptions are general enough to be of practical interest. The reported results thus include and generalize all known cases which are met in the discrete optimal control theory. Practical importance of the obtained results is illustrated on the so-called multiproduct inventory problem which is treated in the detail. Using the derived results we are able to show that under usual assumptions the inventory problem has an optimal solution.     

The optimal pricing and ordering policy for an integrated inventory model when trade credit linked to order quantity

In traditional inventory models, it is implicitly assumed that the buyer must pay for the purchased items as soon as they have been received. However, in many practical situations, the vendor is willing to provide the buyer with a permissible delay period when the buyer’s order quantity exceeds a given threshold. Therefore, to incorporate the concept of vendor–buyer integration and order-size-dependent trade credit, we present a stylized model to determine the optimal strategy for an integrated vendor–buyer inventory system under the condition of trade credit linked to the order quantity, where the demand rate is considered to be a decreasing function of the retail price. By analyzing the total channel profit function, we developed some useful results to characterize the optimal solution and provide an iterative algorithm to find the retail price, buyer’s order quantity, and the numbers of shipment per production run from the vendor to the buyer. Numerical examples and sensitivity analysis are given to illustrate the theoretical results, and some managerial insights are also obtained.     

The value of early order commitment in a two-level supply chain

One approach to supply chain coordination is early order commitment, whereby a retailer commits to purchase a fixed-order quantity at a fixed delivery time before demand uncertainty is resolved. In this paper, we develop an analytical model to quantify the cost savings of an early order commitment in a two-level supply chain where demand is serially correlated. A decision rule is derived to determine whether early order commitment will benefit the supply chain, and accordingly to determine the optimal timing for early commitment. Our results indicate that the supply chain would experience greater savings from early order commitment when – (a) the inventory item receives less value-added activities at the retailer site; (b) the manufacturing lead time is short; (c) demand correlation over time is positive but weak; or (d) the delivery lead time is long (if a condition exists). We also propose a rebate scheme for the supply chain partners to share the gains of practicing early order commitment.     

Managing stochastic inventory systems with free shipping option

In many industries, customers are offered free shipping whenever an order placed exceeds a minimum quantity specified by suppliers. This allows the suppliers to achieve economies of scale in terms of production and distribution by encouraging customers to place large orders. In this paper, we consider the optimal policy of a retailer who operates a single-product inventory system under periodic review. The ordering cost of the retailer is a linear function of the ordering quantity, and the shipping cost is a fixed constant K whenever the order size is less than a given quantity – the free shipping quantity (FSQ), and it is zero whenever the order size is at least as much as the FSQ. Demands in different time periods are i.i.d. random variables. We provide the optimal inventory control policy and characterize its structural properties for the single-period model. For multi-period inventory systems, we propose and analyze a heuristic policy that has a simple structure, the (s, t, S) policy. Optimal parameters of the proposed heuristic policy are then computed. Through an extensive numerical study, we demonstrate that the heuristic policy is sufficiently accurate and close to optimal.