A class of inventory models with customer impatience

Classical inventory models generally assume either no backlogging of demands or unlimited backlogging. This paper treats the case wherein backlogged customers are willing to wait for a random period of time for service. A broad class of such models is discussed, with a more complete analysis performed on a simple subclass. Steady state equations are derived and solved assuming exponentially distributed interarrival times of customers, order delivery lead times, and customer patience.     

A continuous-review inventory system with lost sales and variable lead time

Using a system-point (SP) method of level crossings, we derive the stationary distribution of the inventory level (stock on hand) in a continuous-review inventory system with compound Poisson demand, Erlang as well as hyperexponentially distributed lead times, and lost sales. This distribution is then used to formulate long-run average cost functions with/without a service level constraint. Some numerical results are also presented, and compared with the Hadley and Whitin heuristic. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 259–278, 1998     

Compound distributions with efficient computation in inventory model applications

In an inventory model, the distribution of total units demanded can be considered as a compound distribution arising from the distributions of demand occurrence and individual demand size. Three such compound distributions are considered, where the number of demands is Poisson distributed. The demand size distribution will depend on the observed or desired variance-to-mean ratio. An approximation using the gamma distribution is given in terms of the cumulants of the compound distribution for both fixed and stochastic lead times.     

Optimal policies for a multi-product inventory system with negotiable lead times

The objective of this paper is to determine the optimum inventory policy for a multi-product periodic review dynamic inventory system. At the beginning of each period two decisions are made for each product. How much to “normal order” with a lead time of λ_n periods and how much to “emergency order” with a lead time of λ_e periods, where λe = λ_n - 1. It is assumed that the emergency ordering costs are higher than the normal ordering costs. The demands for each product in successive periods are assumed to form a sequence of independent identically distributed random variables with known densities. Demands for individual products within a period are assumed to be non-negative, but they need not be independent. Whenever demand exceeds inventory their difference is backlogged rather than lost. The ordering decisions are based on certain costs and two revenue functions. Namely, the procurement costs which are assumed to be linear for both methods of ordering, convex holding and penalty costs, concave salvage gain functions, and linear credit functions. There is a restriction on the total amount that can be emergency ordered for all products. The optimal ordering policy is determined for the one and N-period models.     

A time dependent continuous review inventory model with compound poisson demand

We discuss a time dependent optimal ordering policy for a finite horizon inventory system for which the provision of service is essential and thus no stockout is allowed. It is assumed that the system can place an order at any point in time during the horizon when it cannot meet the customer's demand and that lead time is negligible. The demand is considered to be distributed as a compound Poisson process with known parameters and the functional equation approach of dynamic programming is used to formulate the objective function. An algorithm has been developed to obtain the solution for all the cases. In addition, analytical solutions of the basic equation under two limiting conditions are presented.     

An empirical evaluation of further approximations to an approximate continuous review inventory model

This paper describes an empirical evaluation of several approximations to Hadley and Whitin's approximate continuous review inventory model with backorders. It is assumed that lead time demand is normally distributed and various exponential functions are used to approximate the upper tail of this distribution. These approximations offer two important advantages in computing reorder points and reorder quantities. One advantage is that normal tables are no longer required to obtain solutions, and a second advantage is that solutions may be obtained directly rather than iteratively. These approximations are evaluated on two distinct inventory systems. It is shown that an increase in average annual cost of less that 1% is expected as a result of using these approximations. The only exception to this statement is with inventory systems in which a high shortage cost is specified and ordering costs are unusually low.     

Sole sourcing versus dual sourcing under stochastic demands and lead times

The use of a single vendor for each inventoried item is usually assumed in most of the inventory models. However, there are situations where the use of more than one vendor should be considered, especially when lead times are stochastic. This research presents a theoretical investigation of the effect of cost structures on the relative performance of sole-sourcing versus dual-sourcing inventory control policies. We show that except for cases where the ordering cost is high, the lead-time variability is low, or the customer service level is low, dual sourcing performs better than sole sourcing under the normally distributed demand and shifted-exponential lead times. Moreover, the computational results indicate the dual sourcing provides a better service level than sole sourcing at the optimal solutions, and that dual sourcing results in larger order quantities than sole sourcing, which suggests that attractive quantity discounts may not be in jeopardy when dual sourcing is employed. Finally, because it is generally known that multiple sourcing can enhance the competition among suppliers, material managers should consider splitting purchase orders when two equally qualified suppliers are available. © 1994 John Wiley & Sons, Inc.     

面向恶劣环境的高效P2P网络拓扑维护方法

互联网逐渐成为现代社会的重要信息基础设施。Peer-to-Peer(P2P)技术是近年来兴起的一种分布式互联网计算技术,具有广阔的应用前景。FissionE是一种基于Kautz图的结构化P2P覆盖网,具有较高的路由性能。针对恶劣环境下结点失效导致的FissionE拓扑维护性能较差的问题,文章对FissionE的P2P拓扑维护方法进行改进,其基本思想是:直接由门结点产生ZONE消息,避免传统FissionE的ZONE消息产生机制带来的维护开销,从而在恶劣环境下获得更好的拓扑维护性能。     

机器人力反馈依从控制器多机系统分布式程序设计的实现

本文介绍在机器人力反馈依从控制器多机系统中采用程序设计语言C 与分布式库函数相结合实现分布式程序设计的方法,论述了分布式库函数形式,支持分布式库函数设计的多机操作系统功能及其在设计过程中应予以重视的某些问题,并给出了分布式程序设计的一个简例。     

适用于云计算的多接收方代理重加密方案

在云计算环境下,绝大多数信息处理和存储都被转移到云中心,用户终端的计算和存储能力将逐渐弱化。本文针对这一趋势,提出一种适用于云计算的多接收方代理重加密方案,充分利用云中心的分布式计算能力,使用随机数重用和密文聚合技术,大大降低了计算和传输负担,实验表明本方案具有较高的效率。     

“5G+区块链”军事应用探索与分析

区块链技术来源于数字货币,是一种具有去中心化、自信任、公开透明、数据不可篡改、隐私保护等特点的分布式数据账本。在国防与军队建设领域,区块链技术由于其技术理念的先进性而具有相当广阔的应用前景,它将导致思维理念、作战方式与管理方式的全方位创新,但是区块链技术在应用过程中,也存在一定缺陷。由于具备高传输速率、低网络时延、超强连接能力以及更灵活的业务部署能力,5G技术成为弥补区块链技术不足的首选。本文首先分别介绍了5G技术和区块链技术的主要军事应用前景和存在的困难;其次,分析了5G与区块链之间的互补影响及两种技术融合发展的可能性;最后,从军事供应链、智慧军营和无人作战平台等方面深入探讨了5G与区块链典型军事应用中可能面临的挑战。     

On the (S − 1, S) lost sales inventory model with priority demand classes

In this paper an inventory model with several demand classes, prioritised according to importance, is analysed. We consider a lot‐for‐lot or (S ? 1, S) inventory model with lost sales. For each demand class there is a critical stock level at and below which demand from that class is not satisfied from stock on hand. In this way stock is retained to meet demand from higher priority demand classes. A set of such critical levels determines the stocking policy. For Poisson demand and a generally distributed lead time, we derive expressions for the service levels for each demand class and the average total cost per unit time. Efficient solution methods for obtaining optimal policies, with and without service level constraints, are presented. Numerical experiments in which the solution methods are tested demonstrate that significant cost reductions can be achieved by distinguishing between demand classes. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 593–610, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10032     

Novell网络环境下分布式文件系统的设计与实现

在局部网络环境下实现分布式文件系统和远程过程调用是实现高层分布式软件的基础。本文在分析Netware层次结构的基础上,给出了一个在网络层上的分布式文件系统和远程过程调用的设计与实现,详细讨论了该系统的功能、用户界面和实现中的技术问题,包括可靠性和并发控制等必须解决的问题。本文的工作是为在Novell网上实现分布式数据库而设计的。     

分布式算术及其在FPGA中的实现

介绍了分布式算术的原理以及它在基于LUT的FPGA器件上的实现 ,比较了串行分布式算术和并行分布式算术在面积开销和性能方面的差异。     

分布式计算环境下的栅格数据存储策略

针对传统的栅格数据存储策略不能满足分布式计算环境下粗粒度数据访问需求,应对海量栅格数据计算时效率低下的问题,结合分布式文件系统的存储特点,同时考虑地图代数算子在Map/Reduce阶段以栅格瓦片为单位的计算特点,提出一种基于Hadoop分布式文件系统的栅格瓦片存储策略。围绕栅格数据瓦片分割、压缩瓦片数据组织与存储、分布式文件输入输出接口改进等方面对该存储策略加以实现,并使用基于该存储策略的地图代数局部算子的分布式计算流程加以验证。理论分析与实验结果表明,该策略能够显著提高分布式计算环境下空间分析算子的运算速度。     

分布式防空C3I系统面向对象建模方法

采用面向对象的建模思想,把分布式防空C3I系统的各个组成部分抽象成对象,从时间、空间和功能的角度对分布式防空C3I系统进行了描述.通过确定对象类、类的属性、操作及类之间的关系而建立了分布式防空C3I系统的对象模型;通过对系统状态转换的分析,建立了分布式防空C3I系统动态模型;通过对系统功能模型的分布,利用层次数据流图建立了分布式防空C3I系统功能模型.     

用CORBA技术构建分布对象应用系统

首先讨论了网络计算面临的问题和分布对象计算技术,然后详细讨论了分布对象计算标准——公共对象请求代理结构（ＣＯＲＢＡ）规范的体系和各个部分．最后,对基于ＣＯＲＢＡ的分布对象计算的优点及前景作了讨论．     

基于Tornado码的复制算法

面向Internet的分布存储系统具有数据种类多、数据量大、分布广泛等特点,为了提高分布存储系统的数据访问效率,提出了一种基于Tornado码的复制算法。与传统的复制算法相比,基于Tornado码的复制算法能够提供更高的可用性、持久性和安全性,并且具有更低的存储开销和带宽开销。     

C~3CM系统构成原理研究

从Ｃ￣３ＣＭ系统分布式体系结构的需要出发,提出了总线型分布式Ｃ￣３ＣＭ系统的构成原理方案,在探讨Ｃ￣３ＣＭ系统的拓扑结构时,着重研究了ＮＯＶＥＬＬ网络的功能,亦提出了实现全分布式体系结构的主要技术支撑。