提前期不确定条件下的预防性维修备件存储模型研究

在考虑预防性维修周期和提前期不确定的条件下,分别研究备件存储与其相关的维修费用、缺货费用、库存费用以及订购费用等四种费用之间的关系,明确了备件存储量对各项费用的影响.以各项费用总和最小化为目标,构建了提前期不确定条件下的预防性维修备件存储模型.通过备件存储模型的构建,对备件存储过程中的各项成本进行分析,以期对备件库存策略的确定给出一种解决方案.     

三级备件保障系统下的备件库存优化模型

目前我军装备备件保障通常采用三级保障模式,以各级备件期望短缺数量之和最小为目标,研究在不同库存水平条件下,三级备件保障系统的备件库存优化模型.经示例分析,验证了该模型的可行性和有效性,该结果可为多级备件保障提供理论依据.     

基于设备状态监控的单级备件库存系统补货策略研究

本文研究一个周期性订货的多设备同备件库存系统,将备件库存策略与设备状态监控相结合,讨论了存在设备状态监控情形下的备件库存策略。针对设备状态自然腐蚀过程和人 为修复过程的复合过程,运用一个新的马尔科夫概率转移矩阵对设备需求概率进行刻画,并在此基础上给出静态订货模型和状态监控下的动态订货模型的最优订货策略。通过对比以上两种订货策略优缺点,本文提出一种新的启发式订货策略: 基于关键状态的订货策略模型。该策略可以有效降低对全部设备实行动态监控的信息成本,且成本节省优于静态订货策略,对于企业的现实问题有着较好的指导意义。     

基于需求分布规律的石化企业备件库存优化研究

石化类企业备件管理的难度较大,主要原因在于其备件需求往往是间断、离散、随机产生.针对石化类企业备件的间断需求特点,提出Markov过程的bootstrap方法取得备件需求的分布规律,在此基础上构建了备件库存优化模型,利用某大型石化企业实际管理运行数据进行了算例及仿真计算,结果验证了备件需求规律统计方法和库存优化模型的优越性,对于该类企业的备件库存管理实践提供了一定的借鉴意义.     

基于多种约束条件的维修备件库存优化方法研究

考虑了维修备件需求的随机性,以装备可用度、完好率置信度以及维修备件的保障程度为约束条件,运用概率论与数理统计方法,将维修备件保障费用达到最小值确定为目标函数,在此基础上,制定维修备件库存的最优方案,并通过示例验证了该方法的有效性和科学性.方法可以为其它相关领域解决物资库存与费用问题提供理论依据.     

基于序列运算理论的不可修复件存储决策模型

针对备件需求数量与备件库存数量的随机特性,应用序列运算理论对其供需随机过程进行动态描述.通过概率性序列的期望值理论定义了备件需求满足率,并建立了一定的备件满足率要求条件下的备件存储决策模型.     

VMI条件下具有复合二项随机需求的销售商库存策略研究

考虑一个典型的单一产品的二级供应链系统:单供应商对单销售商,假定系统中销售商的需求分布为复合二项分布,未满足的需求机会损失;补货间隔时间为一随机变量.本文采用概率方法对销售商的需求分布、期望缺货、期望库存周期及库存的稳定性分布进行研究的基础上,构建了使单位时间内销售商的期望库存成本费用最小的库存模型,由此模型便可确定VMI模式下供应商对销售商的库存补货参数s和S,并且给出了在补货响应时间为泊松分布的情况下模型的求解算法,还给出了及时补货响应情况下的5个算例.为补货策略的实施提供了一种简单易于控制的思路和方法.     

基于隐藏故障和竞争失效的多态系统视情维修策略

针对具有隐藏故障和竞争失效模式的多态系统维修策略问题,提出了一种综合考虑隐藏故障损失成本、竞争失效模式、不完美检测、不完美维修等因素的多态系统维修建模方法。首先,描述了多态系统及其失效准则,并给出具体的视情维修策略;其次,推导了系统因隐藏故障而导致的损失成本,并对缺陷状态的不完美检测和不完美维修情形进行了数学描述;然后,分析计算了竞争失效模式下系统的两种更新情形及其发生概率,并基于此构建了多态系统的维修模型-期望成本率;最后,通过数值算例验证了所构建维修模型的有效性,分析结果表明,通过优化维修模型能够找到系统的最佳检测策略,从而有效降低维修成本。     

典型串并联系统的备件库存优化模型

选取典型串并联系统的备件库存优化为研究对象,以系统供应可用度最大为目标,备件总购置费为约束条件构建备件库存优化模型,给出基于边际分析法的优化算法.经示例分析,验证了该模型的可行性和有效性,结果可为备件保障经费的合理配置提供理论依据.     

一种基于随机森林的备件预测模型研究

对舰船零部件发生故障问题进行故障诊断,并对故障诊断结果进行分析,建立舰船零部件备件需求模型,给出零部件之间的发生故障概率的关系与备件需求特征;将随机森林回归原理应用到了舰船零部件的备件需求预测领域,构建了基于随机森林的预测模型,以及预测结果准确率的评价。用诊断结果数据对算法进行验证,结果表明,将随机森林算法运用到舰船的备件预测领域可以为舰船装备在一次海上任务期内备件配置问题提供参考价值。     

A queuing approach for inventory planning with batch ordering in multi-echelon supply chains

This paper presents stylized models for conducting performance analysis of the manufacturing supply chain network (SCN) in a stochastic setting for batch ordering. We use queueing models to capture the behavior of SCN. The analysis is clubbed with an inventory optimization model, which can be used for designing inventory policies . In the first case, we model one manufacturer with one warehouse, which supplies to various retailers. We determine the optimal inventory level at the warehouse that minimizes total expected cost of carrying inventory, back order cost associated with serving orders in the backlog queue, and ordering cost. In the second model we impose service level constraint in terms of fill rate (probability an order is filled from stock at warehouse), assuming that customers do not balk from the system. We present several numerical examples to illustrate the model and to illustrate its various features. In the third case, we extend the model to a three-echelon inventory model which explicitly considers the logistics process.     

An inventory sharing and allocation method for a multi-location service parts logistics network with time-based service levels

We consider a model to allocate stock levels at warehouses in a service parts logistics network. The network is a two-echelon distribution system with one central warehouse with infinite capacity and a number of local warehouses, each facing Poisson demands from geographically dispersed customers. Each local warehouse uses a potentially different base stock policy. The warehouses are collectively required to satisfy time-based service targets: Certain percentages of overall demand need to be satisfied from facilities within specified time windows. These service levels not only depend on the distance between customers and the warehouses, but also depend on the part availabilities at the warehouses. Moreover, the warehouses share their inventory as a way to increase achieved service levels, i.e., when a local warehouse is out of stock, demand is satisfied with an emergency shipment from another close-by warehouse. Observing that the problem of finding minimum-cost stock levels is an integer non-linear program, we develop an implicit enumeration-based method which adapts an existing inventory sharing model from the literature, prioritizes the warehouses for emergency shipments, and makes use of a lower bound. The results show that the proposed inventory sharing strategy results in considerable cost reduction when compared to the no-sharing case and the method is quite efficient for the considered test problems.     

An integrated model for warehouse and inventory planning

The purpose of this article is to evaluate the value of integrating tactical warehouse and inventory decisions. Therefore, a global warehouse and inventory model is presented and solved. In order to solve this mathematical model, two solution methodologies are developed which offer different level of integration of warehouse and inventory decisions. Computational tests are performed on a real world database using multiple scenarios differing by the warehouse capacity limits and the warehouse and inventory costs. Our observation is that the total cost of the inventory and warehouse systems can be reduced drastically by taking into account the warehouse capacity restrictions in the inventory planning decisions, in an aggregate way. Moreover additional inventory and warehouse savings can be achieved by using more sophisticated integration methods for inventory and warehouse decisions.     

A periodic-review inventory control policy for a two-level supply chain with multiple retailers and stochastic demand

We consider a time-based inventory control policy for a two-level supply chain with one warehouse and multiple retailers in this paper. Let the warehouse order in a fixed base replenishment interval. The retailers are required to order in intervals that are integer-ratio multiples of the base replenishment interval at the warehouse. The warehouse and the retailers each adopt an order-up-to policy, i.e. order the needed stock at a review point to raise the inventory position to a fixed order-up-to level. It is assumed that the retailers face independent Poisson demand processes and no transshipments between them are allowed. The contribution of the study is threefold. First, we assume that when facing a shortage the warehouse allocates the remaining stock to the retailers optimally to minimize system cost in the last minute before delivery and provide an approach to evaluate the exact system cost. Second, we characterize the structural properties and develop an exact optimal solution for the inventory control system. Finally, we demonstrate that the last minute optimal warehouse stock allocation rule we adopt dominates the virtual allocation rule in which warehouse stock is allocated to meet retailer demand on a first-come first-served basis with significant cost benefits. Moreover, the proposed time-based inventory control policy can perform equally well or better than the commonly used stock-based batch-ordering policy for distribution systems with multiple retailers.     

Analysis of a multi-part spares inventory system subject to ambiguous fault isolation

This paper considers a multi-part spares inventory model for a maintenance system composed of a spares-stocking centre and a repair centre. In the maintenance system, multi-part spares are jointly needed to repair faulty end items determined by ambiguous fault isolation done by the built-in-test-equipment (BITE). If any operating end item breaks down, then all associated parts should be replaced either iteratively (one at a time) or altogether. In the case of iterative replacement, failed parts are detected in the field after fixing the broken end item. However, in the case of group (altogether) replacement, all removed parts are sent to the repair centre where the failed part is detected and fixed. The repaired or non-failed parts are then restocked at the spares-stocking centre. For the system, this paper is to derive the exact expressions for the distribution function and the expected numbers of the backlogged end items under the cannibalization policy. These expressions are then used in the optimization of the associated spares' inventory level. Illustrative numerical examples are also presented.     

Integrated location and two-echelon inventory network design under uncertainty

In this paper, we propose a two-stage stochastic model to address the design of an integrated location and two-echelon inventory network under uncertainty. The central issue in this problem is to design and operate an effective and efficient multi-echelon supply chain distribution network and to minimize the expected system-wide cost of warehouse location, the allocation of warehouses to retailers, transportation, and two-echelon inventory over an infinite planning horizon. We structure this problem as a two-stage nonlinear discrete optimization problem. The first stage decides the warehouses to open and the second decides the warehouse-retailer assignments and two-echelon inventory replenishment strategies. Our modeling strategy incorporates various probable scenarios in the integrated multi-echelon supply chain distribution network design to identify solutions that minimize the first stage costs plus the expected second stage costs. The two-echelon inventory cost considerations result in a nonlinear objective which we linearize with an exponential number of variables. We solve the problem using column generation. Our computational study indicates that our approach can solve practical problems of moderate-size with up to twenty warehouse candidate locations, eighty retailers, and ten scenarios efficiently.     

A heuristic for triggering emergency orders in an inventory system

This paper considers a single-echelon inventory system with a warehouse facing compound Poisson customer demand. Normally the warehouse replenishes from an outside supplier according to a continuous review reorder point policy. However, it is also possible to use emergency orders. Such orders incur additional costs but have a much shorter lead time. We consider standard holding and backorder costs as well as ordering costs. A heuristic decision rule for triggering emergency orders is suggested. The decision rule minimizes the expected costs under the assumption that there is only a single possibility for an emergency replenishment, but the rule is used repeatedly as a heuristic. Given a certain reorder point policy for normal replenishments, our decision rule will always reduce the expected costs. A simulation study illustrates that the suggested technique performs well under different conditions.     

Linear programming based decomposition methods for inventory distribution systems

We consider an inventory distribution system consisting of one warehouse and multiple retailers. The retailers face random demand and are supplied by the warehouse. The warehouse replenishes its stock from an external supplier. The objective is to minimize the total expected replenishment, holding and backlogging cost over a finite planning horizon. The problem can be formulated as a dynamic program, but this dynamic program is difficult to solve due to its high dimensional state variable. It has been observed in the earlier literature that if the warehouse is allowed to ship negative quantities to the retailers, then the problem decomposes by the locations. One way to exploit this observation is to relax the constraints that ensure the nonnegativity of the shipments to the retailers by associating Lagrange multipliers with them, which naturally raises the question of how to choose a good set of Lagrange multipliers. In this paper, we propose efficient methods that choose a good set of Lagrange multipliers by solving linear programming approximations to the inventory distribution problem. Computational experiments indicate that the inventory replenishment policies obtained by our approach can outperform several standard benchmarks by significant margins.