Contracting for vendor‐managed inventory with a time‐dependent stockout penalty

We examine vendor‐managed inventory contracts in a (Q, r) inventory system between a supplier and a retailer, in which a stockout penalty is charged to the supplier based on the length of the time period during which stockouts occur at the retailer. Linear and quadratic forms of the time‐dependent stockout penalty are considered. For the deterministic demand case, we find that the quadratic form of time‐dependent stockout penalty is equivalent to a proportional stockout penalty per unit short per unit time. For the stochastic demand case, we provide the exact cost expressions for the supplier and the retailer with a linear time‐dependent stockout penalty. We also discuss how the stochastic model can be extended to the case with a quadratic time‐dependent stockout penalty when there is at most one outstanding replenishment order at any point of time. We provide several interesting computational results.     

缺货不补的随机存储系统的建模与仿真

基于(s,S)策略,讨论了缺货不通过到达的订货进行补充的随机存储系统.假定需求量、需求发生的间隔、以及提前时间都为随机变量,建立了系统的数学模型.给出库存总费用和缺货率的计算公式,将二者加权平均得到策略的综合系数.设计了系统仿真运行框图,在各种费用参数给定后,利用计算机仿真和综合系数来选定最优存储策略.     

Retrial queuing system with Markovian arrival flow and phase-type service time distribution

We consider a multi-server queuing system with retrial customers to model a call center. The flow of customers is described by a Markovian arrival process (MAP). The servers are identical and independent of each other. A customer’s service time has a phase-type distribution (PH). If all servers are busy during the customer arrival epoch, the customer moves to the buffer with a probability that depends on the number of customers in the system, leaves the system forever, or goes into an orbit of infinite size. A customer in the orbit tries his (her) luck in an exponentially distributed arbitrary time. During a waiting period in the buffer, customers can be impatient and may leave the system forever or go into orbit. A special method for reducing the dimension of the system state space is used. The ergodicity condition is derived in an analytically tractable form. The stationary distribution of the system states and the main performance measures are calculated. The problem of optimal design is solved numerically. The numerical results show the importance of considering the MAP arrival process and PH service process in the performance evaluation and capacity planning of call centers.     

Optimal pricing and lot-sizing for perishable inventory with price and time dependent ramp-type demand

Product perishability is an important aspect of inventory control. To minimise the effect of deterioration, retailers in supermarkets, departmental store managers, etc. always want higher inventory depletion rate. In this article, we propose a dynamic pre- and post-deterioration cumulative discount policy to enhance inventory depletion rate resulting low volume of deterioration cost, holding cost and hence higher profit. It is assumed that demand is a price and time dependent ramp-type function and the product starts to deteriorate after certain amount of time. Unlike the conventional inventory models with pricing strategies, which are restricted to a fixed number of price changes and to a fixed cycle length, we allow the number of price changes before as well as after the start of deterioration and the replenishment cycle length to be the decision variables. Before start of deterioration, discounts on unit selling price are provided cumulatively in successive pricing cycles. After the start of deterioration, discounts on reduced unit selling price are also provided in a cumulative way. A mathematical model is developed and the existence of the optimal solution is verified. A numerical example is presented, which indicates that under the cumulative effect of price discounting, dynamic pricing policy outperforms static pricing strategy. Sensitivity analysis of the model is carried out.     

Periodic review fuzzy inventory model with variable lead time and fuzzy demand

This paper investigates a periodic review fuzzy inventory model with lead time, reorder point, and cycle length as decision variables. The main goal of this study is to minimize the expected total annual cost by simultaneously optimizing cycle length, reorder point, and lead time for the whole system based on fuzzy demand. Two models are considered in this paper: one with normal demand distribution and another with a distribution‐free approach. The model assumes a logarithmic investment function for lost‐sale rate reduction. Furthermore, two separate efficient computational algorithms are explained to obtain the optimal solution. Some numerical examples are given to illustrate the model.     

An alternative simple solution algorithm of an inventory model with fixed and variable lead time crash costs under unknown demand distribution

Inventory models with controllable lead time both for known and unknown demand distributions have been proposed in the literature. A model is useless unless it is formulated correctly and feasible. A simple solution procedure of a model also plays an important role in its application. This article highlights an erroneous formulation of an inventory model developed with fixed and variable lead time crash costs under unknown demand distribution, and also demonstrates its infeasibility. To attain feasibility we extend the model to include a constraint. Then, we present an alternative simple solution technique of the modified model and carry out a comparative study on a numerical example to show its potential significance.     

Integrated vendor--buyer inventory system with sublot sampling inspection policy and controllable lead time

This article investigates the impact of inspection policy and lead time reduction on an integrated vendor--buyer inventory system. We assume that an arriving order contains some defective items. The buyer adopts a sublot sampled inspection policy to inspect selected items. The number of defective items in the sublot sampling is a random variable. The buyer's lead time is assumed reducible by adding crash cost. Two integrated inventory models with backorders and lost sales are derived. We first assume that the lead time demand follows a normal distribution, and then relax the assumption about the lead time demand distribution function and apply the minimax distribution-free procedure to solve the problem. Consequently, the order quantity, reorder point, lead time and the number of shipments per lot from the vendor to the buyer are decision variables. Iterative procedures are developed to obtain the optimal strategy.     

Two-echelon supply chain inventory model with controllable lead time and service level constraint

This paper considers a two-echelon supply chain inventory problem consisting of a single-vendor and a single-buyer. In the system under study, a vendor produces a product in a batch production environment and supplies it to a buyer facing a stochastic demand, which is assumed to be normally distributed. Also, buyer’s lead time is controllable which can be shortened at an added cost and all shortages are backordered. A model has been formulated for an integrated vendor–buyer problem to jointly determine the optimal order quantity, lead time and the number of shipments from the vendor to the buyer during a production cycle while minimizing the total expected cost of the vendor–buyer integrated system. It is often difficult to estimate the shortage cost in inventory systems. Therefore, instead of having a shortage cost term in the objective function, a service level constraint (SLC) is included in the model that requires a certain proportion of demands to be met in each cycle. An efficient procedure has been suggested to find the bounds on number of shipments and then, an algorithm is developed to obtain the optimal solution of the proposed model. A numerical example is included to illustrate the algorithmic procedure and the effects of key parameters are studied to analyze the behavior of the model. Finally, the savings of buyer and vendor are investigated from implementation of joint optimization model over the model in which they minimize their own cost independently.     

Static output feedback control for positive linear continuous‐time systems

This paper studies the problem of designing the static output feedback controller for the positive linear continuous‐time systems. On the basis of a system augmentation approach, a novel characterization on the stable condition of the closed‐loop system is firstly established. Then, a necessary and sufficient condition is given to ensure the existence of the desired static output feedback controller, and an iterative linear matrix inequality algorithm is presented to compute the feedback gain matrix. Finally, a numerical example is provided to illustrate the effectiveness of the proposed method. Copyright © 2012 John Wiley & Sons, Ltd.     

基于库存和在线生产的仓库发货配置方法

针对离散型加工装配企业不同订单复杂产品的零部件发货配置最优化问题,提出了一种全新的仓库发货配置方法. 它以按时交货和订单损失最小作为评价准则,以当前的生产状态为基础,找出当前产品加工和装配的工艺中余留最长的生产路线,并结合库存状态和订单的重要程度确定发货的优先程度,最终分别通过整单出厂和分步出厂两种发货模式实现了零部件的最优发货配置.     

Performance of a closed network with exponential distributed service time and periodically repeating demands of users

A closed network is considered in which one processor provides service to n customers. Service time is exponentially distributed. Once the service is completed, the user calls for the next service in time T. A rejected call returns in time T as well. The performance of the processor and the mean number of call returns are determined. Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 176–179, May–June, 2000.     

Analysis of file download time in peer-to-peer networks with stochastic and time-varying service capacities

The service capacities of a source peer at different times in a peer-to-peer (P2P) network exhibit temporal correlation. Unfortunately, there is no analytical result which clearly characterizes the expected download time from a source peer with stochastic and time-varying service capacity. The main contribution of this paper is to analyze the expected file download time in P2P networks with stochastic and time-varying service capacities. The service capacity of a source peer is treated as a stochastic process. Analytical results which characterize the expected download time from a source peer with stochastic and time-varying service capacity are derived for the autoregressive model of order 1. Simulation results are presented to validate our analytical results. Numerical data are given to show the impact of the degree of correlation and the strength of noise on the expected file download time. For any chunk allocation method, an analytical result of the expected parallel download time from a source peer with stochastic and time-varying service capacity is derived. It is shown that the algorithm which chooses chunk sizes proportional to the expected service capacities has better performance than the algorithm which chooses equal chunk sizes. It is also shown that multiple source peers do reduce the parallel download time significantly.     

Sojourn time distributions and time scale separation results for multiclass state-dependent processor sharing systems with a finite service pool and exponential service requirements

The paper addresses multiclass processor sharing systems with general state-dependent service rates, exponential service requirements and a finite service pool. By considering the amount of service received by a permanent customer and associating this service with the evolution of a Markov Reward process, the sojourn time distribution is formulated in terms of a matrix exponential expression. When the service rates are balanced, this expression can be diagonalized. Tail asymptotics are also discussed. The matrix exponential expression is subsequently exploited towards the study of time scale separation regimes. Unlike the standard practice of assuming a distinct time scale per class, the paper groups more realistically all customer classes in two time scales. Provably tight approximations, of a known, small degree of error, are developed for the sojourn time distribution of a given class (with either fast or slow dynamics), in terms of reduced models containing only the customer classes operating in the same time scale. The approximation for the fast classes gives rise to further characterization of the tail behavior. Additionally, the paper studies another, more specialized variant of the time scale separation regime, in which the service rates take a special form that leads to even simpler approximations. Finally, it is shown that the essence of the main results applies also to the more general setting of service requirement distributions with Markovian phase-type form.     

An optimal production lot-sizing problem for an imperfect process with imperfect maintenance and inspection time length

This article develops an integrated model in considering the situations of an imperfect process with imperfect maintenance and inspection time for the joint determination of both economic production quantity (EPQ) and preventive maintenance (PM). This imperfect process has a general deterioration distribution with increasing hazard rate. Even with periodic PM, such a production system cannot be recovered as good as new. This means that the system condition depends on how long it runs. Also, the PM level can be distinct due to the maintenance cost. For convenience, it is assumed the age of system is reduced in proportional to the PM level. Further, during a production cycle, we need an inspection to see if the process is in control. This inspection might demand a considerable amount of time. In this article, we take PM level and inspection time into consideration to optimise EPQ with two types of out-of-control states. To see how the method works, we use a Weibull shock model to show the optimal solutions for the least costs.     

A heuristic method for the vehicle routing problem with backhauls and inventory

The purpose of this paper is to determine the route of the vehicle routing problem with backhauls (VRPB), delivering new items and picking up the reused items or wastes, and resolve the inventory control decision problem simultaneously since the regular VRPB does not. Both the vehicle routing decision for delivery and pickup, and the inventory control decision affect each other and must be considered together. Hence, a mathematical model of vehicle routing problem with backhauls and inventory (VRPBI) is proposed. Since finding the optimal solution(s) for VRPBI is a NP-hard problem, this paper proposes a heuristic method, variable neighborhood tabu search (VNTS), adopting six neighborhood searching approaches to obtain the optimal solution. Moreover, this paper compares the proposed heuristic method with two other existing heuristic methods. The experimental results indicate that the proposed method is better than the two other methods in terms of average logistic cost (transportation cost and inventory cost).     

A multi-server perishable inventory system with negative customer

In this paper, we consider a continuous review perishable inventory system with multi-server service facility. In such systems the demanded item is delivered to the customer only after performing some service, such as assembly of parts or installation, etc. Compared to many inventory models in which the inventory is depleted at the demand rate, however in this model, it is depleted, at the rate at which the service is completed. We assume that the arrivals of customers are according to a Markovian arrival process (MAP) and that the service time has exponential distribution. The ordering policy is based on (s, S) policy. The lead time is assumed to have exponential distribution. The customer who finds either all servers are busy or no item (excluding those in service) is in the stock, enters into an orbit of infinite size. These orbiting customers send requests at random time points for possible selection of their demands for service. The interval time between two successive request-time points is assumed to have exponential distribution. In addition to the regular customers, a second flow of negative customers following an independent MAP is also considered so that a negative customer will remove one of the customers from the orbit. The joint probability distribution of the number of busy servers, the inventory level and the number of customers in the orbit is obtained in the steady state. Various measures of stationary system performance are computed and the total expected cost per unit time is calculated. The results are illustrated numerically.     

An operational policy for an integrated inventory system under consignment stock policy with controllable lead time and buyers’ space limitation

This paper aims to enable the decision maker of an integrated vendor–buyer system, under Consignment Stock (CS) policy, to make the optimal/sub-optimal production/replenishment decisions where the buyer places a space limitation to the vendor and the lead-time is controllable with an extra investment. Within any production cycle, the vendor produces at a finite rate and ships the outputs to the buyer with a number of equal-sized lots. With a long-term consignment stock agreement, the vendor takes responsibility to maintain a certain inventory level in the buyer's warehouse. Some of the shipments are delayed so that the buyer's inventory does not go beyond the capacity limitation. The buyer compensates the vendor after the complete consumption of the products. The holding cost consists of a storage component and a financial component. Two constraint four-variable non-linear integer optimization models are established wherein the buyer space limitation is considered. Because the developed models are mathematically very difficult to solve, three doubly hybrid meta-heuristic algorithms are employed to solve the models. The computational results show that one of these three algorithms works very well both in the sense of the success rate and the mean CPU time. The analysis of the computational example also reveals the quantitative effects the buyer space limitation may have to the annual joint total expected cost (JTEC) of the integrated system.     

基于马尔科夫决策过程的ATO系统独立组件与产品双需求最优决策研究

研究多维组件, 单一产品的双需求型面向订单装配(Assemble-to-order, ATO)系统. 产品需求为延期交货型, 当其不被满足时将产生缺货等待成本; 而独立组件需求为销售损失型, 其不被满足时将产生缺货损失成本. 该问题可以抽象成一个动态马尔科夫决策过程(Markov decision process, MDP), 通过对双需求模型求解得到状态依赖型最优策略, 即任一组件的最优生产--库存策略由系统内其他组件的库存水平决定. 研究解决了多需求复杂ATO系统的生产和库存优化控制问题. 提出在一定条件下, 组件的基础库存值可以等价于最终产品需求的库存配给值. 组件的基础库存值与库存配给值随系统内其他组件库存的增加而增加, 而产品需求的库存配给值随系统组件库存和产品缺货量的增加而减少. 最后通过数值实验分析缺货量及组件库存对最优策略结构的影响, 并得到了相应的企业生产实践的管理启示.     

Analysis of a multi-server queue with two priority classes and (M, N)-threshold service schedule I: non-preemptive priority

In this paper, we propose an ( M , N )-threshold non-preemptive priority service schedule for a queueing system consisting of two-parallel queues and a multi-server. The arrival process for each queue is Poisson, and the service times are exponentially distributed with different means. We derive the generating functions of the stationary joint queue-length distribution, and then obtain the mean queue length and the mean waiting time for each queue.