Fractional programming approach to two stochastic inventory problems

This paper considers two popular inventory models: the continuous review and periodic review reorder-point, order-quantity, control systems. Specifically we present two procedures which determine optimal values for the two control parameters (i.e., reorder-point and order-quantity) when the holding-and-shortage costs are non-quasi-convex. This cost structure may arise when non-linear cost rate is considered, for instance when the shortage cost is the shadow cost of a service-level constraint. The algorithms based on a fractional programming method are intuitive and efficient, and as the holding-and-shortage cost functions become quasi-convex, they are compatible to existing algorithms.     

Inventory models with minimal service level constraints

This paper investigates inventory models in which the stockout cost is replaced by a minimal service level constraint (SLC) that requires a certain level of service to be met in every period. The minimal service level approach has the virtue of simplifying the computation of an optimal ordering policy, because the optimal reorder level is solely determined by the minimal SLC and demand distributions. It is found that above a certain “critical” service level, the optimal (s,S) policy “collapses” to a simple base-stock or order-up-to level policy, which is independent on the cost parameters. This shows the minimal SLC models to be qualitatively different from their shortage cost counterparts. We also demonstrate that the “imputed shortage cost” transforming a minimal SLC model to a shortage cost model does not generally exist. The minimal SLC approach is extended to models with negligible set-up costs. The optimality of myopic base-stock policies is established under mild conditions.     

A multi-product continuous review inventory system with stochastic demand,backorders, and a budget constraint

Common characteristics of inventory systems include uncertain demand and restrictions such as budgetary or storage space constraints. Several authors have examined budget constrained multi-item stochastic inventory systems controlled by continuous review policies without considering marginal 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 orders 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. This paper models a multi-item stochastic inventory system with backordered shortages when estimation of marginal backorder cost is available, and payment is due upon order arrival. The budget constraint can easily be converted into a storage constraint.     

需求依赖于服务水平的易变质品库存策略研究

本文研究需求依赖于上一周期服务水平、缺货时订单部分损失的两周期易变质品库存问题。分别考虑一次订货和多次订货两种情况,以平均利润最大化为目标构建库存模型,证明了模型解的存在性和唯一性,得到了最优库存服务水平和最优补货策略。最后,通过算例给出两个模型的应用,对重要参数进行了灵敏度分析,并且将两种模型的结果进行了对比分析。结果表明:订单损失率的增加会提高服务水平,但会使得利润降低;顾客期望服务水平的提高会降低第一阶段的服务水平,同时使利润减少;单位库存持有成本或变质率的增加会降低服务水平和平均利润。通常情况,企业通过多次订货能获得更大的利润,而只有当库存持有成本极小时,一次订购才能够获得更大的利润。同时,结果也表明:服务水平对库存策略有较大的影响,因此在进行库存决策时考虑服务水平具有重要的作用。     

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.     

应急物流中库存与运输集成决策模型研究

已有的研究表明,在物流管理中权衡库存与运输成本之间的关系,实现两者的集成决策,可改进系统的运作绩效。在给定的仓库布局条件下,针对应急物流的配送特点,构建了单周期物资的运输与库存集成决策的随机规划模型。考虑到模型求解的复杂性,首先通过对模型的分析,获得了最优解的性质和上界,然后设计了基于BP神经网络和遗传算法的混合智能算法。在算例分析部分,揭示了服务水平、运输、和库存成本在应急物流中之间的复杂关系,说明合理权衡三者之间的关系,可以提升应急物流的管理水平。     

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.     

Service-Level Constraints Measuring Shortages during a Fiscal Period: The Normal Distribution

A service-level constraint, defined over a fiscal period, is introduced which measures the amount short and restricts it to a managerially acceptable level. When demand is normal, it is shown that the derivation of the key inventory variables is independent of the parameters of the demand distribution. The service-level constraint is illustrated, and its managerial implications are discussed.     

The single-item newsboy problem with dual performance measures and quantity discounts

This paper considers models for the single-item newsboy problem with quantity discount and the following dual performance measure: “maximize the expected profit subject to a constraint that the probability of achieving a target profit level is no less than a predetermined risk level.” We also consider two types of quantity discount: all-unit and incremental. For our models with zero shortage cost, a closed-form solution for determining the optimal order quantity is derived. However, models with positive shortage cost can only be solved numerically.     

Multiproduct single-machine production system with stochastic scrapped production rate, partial backordering and service level constraint

In this paper, a multiproduct single-machine production system under economic production quantity (EPQ) model is studied in which the existence of only one machine causes a limited production capacity for the common cycle length of all products, the production defective rates are random variables, shortages are allowed and take a combination of backorder and lost sale, and there is a service rate constraint for the company. The aim of this research is to determine the optimal production quantity, the allowable shortage level, and the period length of each product such that the expected total cost, including holding, shortage, production, setup and defective items costs, is minimized. The mathematical model of the problem is derived for which the objective function is proved to be convex. Then, a derivative approach is utilized to obtain the optimal solution. Finally, two numerical examples in each of which a sensitivity analysis is performed on the model parameters, are provided to illustrate the practical usage of the proposed methodology.     

Using aggregate fill rate for dynamic scheduling of multi-class systems

For dynamic scheduling of multi-class systems where backorder cost is incurred per unit backordered regardless of the time needed to satisfy backordered demand, the following models are considered: the cost model to minimize the sum of expected average inventory holding and backorder costs and the service model to minimize expected average inventory holding cost under an aggregate fill rate constraint. Use of aggregate fill rate constraint in the service model instead of an individual fill rate constraint for each class is justified by deriving equivalence relations between the considered cost and service models. Based on the numerical investigation that the optimal policy for the cost model is a base-stock policy with switching curves and fixed base-stock levels, an alternative service model is considered over the class of base-stock controlled dynamic scheduling policies to minimize the total inventory (base-stock) investment under an aggregate fill rate constraint. The policy that solves this alternative model is proposed as an approximation of the optimal policy of the original cost and the equivalent service models. Very accurate heuristics are devised to approximate the proposed policy for given base-stock levels. Comparison with base-stock controlled First Come First Served (FCFS) and Longest Queue (LQ) policies and an extension of LQ policy (Δ policy) shows that the proposed policy performs much better to solve the service models under consideration, especially when the traffic intensity is high.     

A multi-objective joint replenishment inventory model of deteriorated items in a fuzzy environment

In this study, a fuzzy multi-objective joint replenishment inventory model of deteriorating items is developed. The model maximizes the profit and return on inventory investment (ROII) under fuzzy demand and shortage cost constraint. We propose a novel inverse weight fuzzy non-linear programming (IWFNLP) to formulate the fuzzy model. A soft computing, differential evolution (DE) with/without migration operation, is proposed to solve the problem. The performances of the proposed fuzzy method and the conventional fuzzy additive goal programming (FAGP) are compared. We show that the solution derived from the IWFNLP method satisfies the decision maker’s desirable achievement level of the profit objective, ROII objective and shortage cost constraint goal under the desirable possible level of fuzzy demand. It is an effective decision tool since it can really reflect the relative importance of each fuzzy component.     

Make-or-buy service capacity decision in a supply chain providing after-sales service

We consider a supply chain comprising a manufacturer and a retailer. The manufacturer supplies a product to the retailer, while the retailer sells the product bundled with after-sales service to consumers in a fully competitive market. The sales volume is affected by the retailer’s service-level commitment. The retailer can build service capacity in-house at a deterministic price before service demand is realized, or buy the service from an outsourcing market at an uncertain price after service demand realization. We find that the outsourcing market encourages the retailer to make a higher level of service commitment, while prompting the manufacturer to reduce the wholesale price, resulting in more demand realization. We analyze how the expected cost of the service in the outsourcing market and the retailer’s risk attitude affect the decisions of both parties. We derive the conditions under which the retailer is willing to build service capacity in-house and under which it will buy the service from the outsourcing market. Moreover, we find that the manufacturer’s sharing with the retailer the cost to build service capacity improves the profits of both parties.     

基于成本优先级的部件维修策略分析

现实中,系统由于任务、环境等因素,无法实时对故障部件进行维修。因此需要在任务间隔期间或对故障部件进行维修的同时对系统各部件进行预防性机会维修。本文考虑系统期望维修成本,提出了基于部件维修优先级的预防性维修策略。首先把系统期望维修成本分为失效部件维修成本、失效部件导致系统故障的成本和预防性维修其他部件的成本,提出了基于成本的二态和多态系统部件维修优先级度量方法,并在两种场景下分析了如何选择预防性维修部件。其次针对多态系统,研究了基于成本重要度的部件最佳维修水平,并讨论了成本约束下的部件预防性维修策略。最后以某型预警机系统为例进行验证,结果表明,基于成本的预防性维修策略不仅与故障部件位置和相关成本有关,而且还与可用于预防性维修的其他部件重要性有关。     

Inventory control with an order-time constraint: optimality,uniqueness and significance

This paper analyzes a stochastic inventory problem with an order-time constraint that restricts the times at which a manufacturer places new orders to a supplier. This constraint stems from the limited upstream capacity in a supply chain, such as production capacity at a supplier or transportation capacity between a supplier and a manufacturer. Consideration of limited upstream capacity extends the classical inventory literature that unrealistically assumes infinite supplier/transporter capacity. But this consideration increases the complexity of the problem. We study the constraint under a Poisson demand process and allow for a fixed ordering cost. In presence of the constraint, we establish the optimality of an (s,S) policy under both the discounted and average cost objectives. Under the average cost objective, we show the uniqueness of the order-up-to level S. We numerically compare our model with the classical unconstrained model. We report significant savings in costs that can be achieved by using our model when the order time is constrained.     

A multi-level search strategy for the 0-1 Multidimensional Knapsack Problem

We propose an exact method based on a multi-level search strategy for solving the 0-1 Multidimensional Knapsack Problem. Our search strategy is primarily based on the reduced costs of the non-basic variables of the LP-relaxation solution. Considering that the variables are sorted in decreasing order of their absolute reduced cost value, the top level branches of the search tree are enumerated following Resolution Search strategy, the middle level branches are enumerated following Branch & Bound strategy and the lower level branches are enumerated according to a simple Depth First Search enumeration strategy. Experimentally, this cooperative scheme is able to solve optimally large-scale strongly correlated 0-1 Multidimensional Knapsack Problem instances. The optimal values of all the 10 constraint, 500 variable instances and some of the 30 constraint, 250 variable instances of the OR-Library were found. These values were previously unknown.     

Nonlinear Programming Analysis to Estimate Implicit Inventory Backorder Costs

In this paper, we use nonlinear programming to provide an alternative treatment of the economic order quantity problem with planned backorders. Many businesses, such as capital-goods firms that deal with expensive products and some service industries that cannot store their services, operate with substantial backlogs. In practical problems, it is usually very difficult to estimate accurately the values of the two types of backorder costs, i.e., the time-dependent unit backorder cost and the unit backorder cost. We redefine the original problem without including these backorder costs and construct a nonlinear programming problem with two service measure constraints which may be easier to specify than the backorder costs. We find that, with this different formulation of our new problem, we obtain results which give implicit estimates of the backorder costs. The alternative formulation provides an easier-to-use model and managerially meaningful results. Next, we show that, for a wide range of parameter values, it usually suffices to consider only one type of backorder cost, or equivalently, only one type of service measure constraint. Finally, we develop expressions which bracket the optimal values of the decision variables in a narrow range and provide a simple method for computing the optimal solution. In the most complicated case, this method requires finding the unique root of a polynomial.     

Periodic review inventory systems with a service level criterion

Full-cost inventory models are mostly studied in the literature, whereas service level constraints are more common to be observed in practical settings. In this paper, we consider periodic review inventory systems with service level restrictions. The control of such inventory systems is limited to (s, S)-type policies in the literature. To the best of our knowledge, we are the first authors to compare such policies with optimal replenishment policies, and illustrate an average cost difference of 0.64%. This justifies the use of these popular (s, S) policies in practice. Furthermore, we propose a new one-dimensional search procedure that is bounded to set the reorder level s and order-up-to level S, whereas the solution space is unbounded and two dimensional. Our heuristic procedure is guaranteed to satisfy the service level constraint and numerical experiments illustrate that it results in an average cost deviation of 1–2% compared with the best (s, S) policy. Consequently, it significantly outperforms all existing procedures from literature, both in service and costs.     

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.     

Cost allocation and convex data envelopment

This paper considers allocation rules. First, we demonstrate that costs allocated by the Aumann–Shapley and the Friedman–Moulin cost allocation rules are easy to determine in practice using convex envelopment of registered cost data and parametric programming. Second, from the linear programming problems involved it becomes clear that the allocation rules, technically speaking, allocate the non-zero value of the dual variable for a convexity constraint on to the output vector. Hence, the allocation rules can also be used to allocate inefficiencies in non-parametric efficiency measurement models such as Data Envelopment Analysis (DEA). The convexity constraint of the BCC model introduces a non-zero slack in the objective function of the multiplier problem and we show that the cost allocation rules discussed in this paper can be used as candidates to allocate this slack value on to the input (or output) variables and hence enable a full allocation of the inefficiency on to the input (or output) variables as in the CCR model.