Multi-Item Inventory Aggregation into Groups

The problem of grouping the many items in stock into a few groups with the provision of a common order cycle or common order quantity per group is modelled as a dynamic program. It is shown that by a simple reorganization of the stock items, the computation time of the dynamic program can be reduced to a manageable size. Further the order cycle grouping is shown to be, usually, superior to the order quantity grouping scheme. Also, the composition of the order cycle grouping is found to be remarkably close to that of the well known A/B/C system of stock control therby giving theoretical credence to that system.     

Joint Replenishment in Multi-Item Inventory Systems

A multi-item inventory system is considered which has the property that, for each single item, a reorder policy using the E.O.Q. formula would be appropriate. Holding costs are linear, and fixed ordering costs are assumed to be composed of a major set-up cost reflecting the pure fact of placing an order, and a sum of minor set-up costs corresponding to the items included in the order. If it is desirable to form a certain number of groups of items where all items of one group share the same order cycle, it is shown that there is always an optimal grouping in which items are arranged in increasing order of their ratio of yearly holding costs and minor set-up costs.A heuristic for forming the groups is given which turns out to be an optimal algorithm for the case that there are no major set-up costs. After an initial sorting of ratios, the worst-case complexity of this procedure is linear in the number of items.     

Non-Stationary Ordering Policies for Multi-Item Inventory Systems Subject to a Single Resource Constraint

This paper studies the multi-item inventory problem with a single constraint. Two well-known approaches to this problem are the Lagrangian method and the fixed-cycle approach. Both of these methods generate stationary ordering policies. A competing approach is presented here that generates non-stationary ordering policies, with order quantities that vary over time. These non-stationary policies are, in all cases, preferred to those generated by the Lagrangian approach, and in some cases preferred to those generated by the fixed-cycle approach. Computational results comparing the three methods are also given.     

易变质产品的可替代库存模型的最优订购策略研究

研究了易变质产品的可替代库存模型.在有限计划期内,供应商面临两种不同产品的需求,当一种产品发生短缺时,另一种产品可以以一定的替代率代替短缺产品.通过分析系统的总成本函数的性质,提出了最优订购策略.最后通过算例验证了算法的最优性.     

需求离散的变质性物品库存补充策略优化研究

研究了在不允许缺货情况下需求为离散的变质性物品的库存补充策略问题.在假定变质率为常数的情况下,建立了有限时域内变质性物品的补充策略模型,并给出了求最优补充策略的方法.     

允许租用货栈的库存系统的最优进货策略

本文从实际背景出发，提出了允许租用货栈的库存系统的库存模型，在一般时变需求并允许短缺的假定下，得到了寻求该系统最优进货策略的一种交替逼近方法。并给出了数字例子。     

模糊需求下的库存风险及最优库存决策

分析了在模糊需求下,按经典库存模型中的经济订货批量和订货周期所导致的库存风险损失。推导了模糊需求下的经济风险函数。给出了风险函数在模糊需求分布下的重心决策方法,在此基础上得到了模糊需求下经济批量的修正公式,为模糊库存风险分析的研究提供了一种方法。     

Optimal Inventory Policies with Service-Level Constraints

In a practical situation it is often difficult to determine the value of the shortage costs for use in in ventory-control systems. However, in cost-minimization problems including service-level constraints, shortage costs are implicitly prevailing. With the purpose of exploring these relations, a continuous review (Q, r) stock-control system is considered, where the order points and lot sizes are computed simultaneously. Instead of explicitly expressing the shortage cost in the objective function, it is taken into consideration through a service-level constraint. The shadow price of this constraint can in some sense be interpreted as the shortage cost corresponding to the requested service level. By changing the value of the service level, interesting relations between shortage costs and service levels can be viewed for different sets of other inventory parameters. In order to investigate the sensitivity for probabilistic variations in the input data, two different probability distributions are used to describe the lead-time demand.     

关于最优存贮策略的两点注记

本文统一论述了确定性静态存贮系统的最优存贮策略 ,并将具有数量折扣的经典 EOQ公式推广到了一般的确定性静态存贮系统 ;用机会损失 (后悔值 )概念对随机存贮系统的各种临界比公式进行了统一处理 .     

An Optimal Method for a Deterministic Joint Replenishment Inventory Policy in Discrete Time

In this paper we derive an optimal solution to the multi-item single-supplier inventory problem with two types of set-up costs. In the case considered, replenishment opportunities are restricted to the beginning of the discrete time periods.     

求解系统可靠性优化中指派问题的启发式算法

本文回顾了系统可靠性优化中部件指派问题的研究,针对该类问题特点提出了一个新的启发式算法,该算法基于概率重要度来指派部件可靠度。文章最后给出了算例分析,并将算法结果与已有的算法和枚举法求得的最优解进行了比较。新的算法简单,而且效率非常高,可以在很短的计算时间内得到较好的求解效果,有效提高了复杂系统和大规模系统可靠性优化的计算效率。     

需求率为斜坡型的一类变质性物品最优库存策略

本文在考虑需求率服从斜坡型分布的情况下,研究了允许缺货且缺货完全回补、变质率服从威布尔分布、补货率为无穷、有限计划期内的库存模型,证明了最优补货策略的存在性,并给出了求解最优补货策略的算法.     

规避风险的多阶段最优库存研究

基于市场需求是随机的,并且在进行市场销售前,就要确定每个阶段的生产数量的背景下,建立了具有规避风险的多阶段库存凸随机规划模型.该模型以最小化损失函数的期望值为目标函数,以规避风险为约束条件,以价值风险(VaR)和条件价值风险(CVaR)为风险度量;采用样本平均近似方法(SAA)求解该模型,并分析样本平均近似方法的收敛性;最后,给出数值结果.     

An Almost Optimal Heuristic for Preemptive C max Scheduling of Dependent Tasks on Parallel Identical Machines

We consider the problem of scheduling preemptable, dependent tasks on parallel, identical machines to minimize the makespan. The computational complexity of this problem remains open if the number of machines is fixed and larger than 2. The aim of this paper is to compare two heuristic algorithms on a basis of a computational experiment. The solutions generated by the heuristics are compared with optimal solutions obtained by a branch-and-bound algorithm. Computational results show that the heuristic based on node ordering finds optimal schedules for 99.9% of instances with the maximum relative deviation from optimum of 4.8%.     

一种基于进化算法的非线性两层规划的快速全局优化方法

由于非线性两层规划具有非凸性、NP-难等计算困难，高效的算法并不多见。本文设计了一种新的进化算法，基于此进化算法提出了求解带有一重或多重下层的非线性两层规划的高效算法。该算法充分利用两层规划的结构特点。最后，给出了六个不同类型的算例，数值结果表明，本算法是快速和有效的。     

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

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

Optimal Solutions in the Multi-location Inventory System with Transshipments

We consider a single-period multi-location inventory system where inventory choices at each location are centrally coordinated. Transshipments are allowed as recourse actions in order to reduce the cost of shortage or surplus inventory after demands are realized. This problem has not been solved to optimality before for more than two locations with general cost parameters. In this paper we present a simple and intuitive model that enables us to characterize optimal inventory and transshipment policies for three and four locations as well. The insight gained from these analytical results leads us to examine the optimality conditions of a greedy transshipment policy. We show that this policy will be optimal for two and three locations. For the n location model we characterize the necessary and sufficient conditions on the cost structure for which the greedy transshipment policy will be optimal.      

Optimal Ordering Policies for Inventory Systems with Emergency Ordering

This paper considers dynamic single- and multi-product inventory problems in which the demands in each period are independent and identically distributed random variables. The problems considered have the following common characteristics. At the beginning of each period two order quantities are determined for each product. A “normal order” quantity with a constant positive lead time of λ _n periods and an “emergency order” quantity with a lead time of λ _e periods, where λ _e = λ _n - 1. The ordering decisions are based on linear procurement costs for both methods of ordering and convex holding and penalty costs. The emergency ordering costs are assumed to be higher than the normal ordering costs. In addition, future costs are discounted.For the single-product problem the optimal ordering policy is shown to be the same for all periods with the exception of the last period in the N-period problem. For the multi-product problem the one- and N-period optimal ordering policy is characterized where it is assumed that there are resource constraints on the total amount that can be ordered or produced in each period.     

Optimal Replenishment Strategy for Inventory Mechanism with Step-Shaped Demand

Journal of Optimization Theory and Applications - This paper extends the classical economic order quantity inventory model to that the planning horizon consists of two stages—a finite...