Inventory control in divergent supply chains with time‐based dispatching and shipment consolidation

This article analyses a divergent supply chain consisting of a central warehouse and N nonidentical retailers. The focus is on joint evaluation of inventory replenishment and shipment consolidation effects. A time‐based dispatching and shipment consolidation policy is used at the warehouse in conjunction with real‐time point‐of‐sale data and centralized inventory information. This represents a common situation, for example, in various types of vendor managed inventory systems. The main contribution is the derivation of an exact recursive procedure for determining the expected inventory holding and backorder costs for the system, under the assumption of Poisson demand. Two heuristics for determining near optimal shipment intervals are also presented. The results are applicable both for single‐item and multiitem systems. © 2011 Wiley Periodicals, Inc. Naval Research Logistics 58: 59–71, 2011     

初始和终止库存不为零的生产与库存问题

针对初始库存和终止库存不为零的生产与库存问题,通过适当设置需求量,将其化为初始库存和终止库存为零的问题,以便应用重生性质进行求解。     

信度函数在作战效能分析中的运用

针对某些作战效能指标由于与人的行为等因素关系密切而难以量化,运用信度函数探索不确定评价问题。通过建立信度函数模型把指标评价建模为信度函数,并应用登普斯特(Dempster)规则转化为mass函数合成为上层指标进行综合评价。经过实例分析,信度函数模型尤其对战时在考虑指挥员的指挥艺术及士兵士气等非确定性因素的情况下,对作战效能的评估是十分有效的,从而为决策者的作战决策提供一定辅助作用。     

一种基于策略的配置管理思想

对更健壮和更有效配置管理工具的需求已成为企业网络管理领域的一个越来越迫切的问题.针对这种情况,提出了一种新的配置管理思想--基于策略的配置管理,给出了规则冲突的产生和解决策略.减少了因配置信息变化而对网络的重构时间,降低了网络的维护成本,使网络配置更易于进行.     

绿洲农业清洁生产初探

兵团农业是兵团国民经济的基础。随着兵团各农牧团场生产集约化程度不断提高,化肥、农药等在农业生产中大量投入及农业生产技术的不合理使用,使农业生态环境污染日趋严重,改善农业生产技术,推广农业清洁生产(即利用对环境友好的“绿色”化肥、“绿色”农药、“绿色”薄膜)是兵团农业可持续发展的方向。     

一种改进的粒子群优化算法

针对基本粒子群算法存在着收敛速度慢、效率低、易陷入局部最优等缺陷,为了更好地平衡全局和局部搜索能力,在粒子群算法中引入收缩因子,使算法中粒子不仅向种群最优的粒子进行学习,而且向种群中比自己优秀的所有粒子学习,增加了粒子的多样性。实验结果证明,与基本蚁群算法相比,改进的粒子群算法提高了收敛速度和效率,能一定程度地避免局部最优解的产生。     

国有军工集团生产与创新双效率研究

文章利用DEA方法对2015-2016年我国国有军工集团的生产效率和创新效率进行了分析,结果发现:我国国有军工集团的生产效率在近两年整体上有所提升,受行业影响小于自身因素影响,受管理、技术等水平的影响与来自规模因素的影响相差不大;创新效率在近两年整体上有所下降,受行业影响与自身因素影响均较大,无效率主要来自创新管理水平或技术条件的不足;生产效率与创新效率呈现统计上不显著的正相关关系。在此基础上,提出了军工集团实施国企改革的几点建议,以供有关方面参考。     

Capacitated selection problem

Optimizing the selection of resources to accomplish a set of tasks involves evaluating the tradeoffs between the cost of maintaining the resources necessary to accomplish the tasks and the penalty cost associated with unfinished tasks. We consider the case where resources are categorized into types, and limits (capacity) are imposed on the number of each type that can be selected. The objective is to minimize the sum of penalty costs and resource costs. This problem has several practical applications including production planning, new product design, menu selection and inventory management. We develop a branch‐and‐bound algorithm to find exact solutions to the problem. To generate bounds, we utilize a dual ascent procedure which exploits the special structure of the problem. Information from the dual and recovered primal solutions are used to select branching variables. We generate strong valid inequalities and use them to fix other variables at each branching step. Results of tests performed on reasonably sized problems are presented. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 19–37, 1999     

同类防空武器多层防御部署分析

在现代防空中,经常是防空武器多层部署进行防空,故需要对防空武器多层防御部署进行分析.针对同类防空武器多层防御部署的问题,运用排队论,建立了防御体系射击效能的数学模型.按照模型,通过实验仿真,对计算得到的实验数据进行分析,推测出同类防空武器的部署规律,并对防御体系应部署的适宜层数进行了一定的讨论.通过理论推导,证明了部署规律的正确性.最后建立了需求分析模型,运用部署规律对模型进行求解,通过对实例进行计算,给出了求解的基本步骤.     

Analysis of production lines with Coxian service times and no intermediate buffers

This paper uses the holding time model (HTM) method to derive an approximate analytic formula for the calculation of the mean throughput of a K-station production line with no buffers between any two successive stations. Service times follow the two-stage Coxian (C²) distribution at all stations. The paper provides a formula that relates the third moment of the service completion (or virtual service) time with the respective parameters of the service time, the repair time and the time to breakdown (the latter is assumed to follow the exponential distribution). In this way, it concludes that under certain conditions the two-stage Coxian distribution can be used to approximate any general distribution matching the first three moments of the service completion time distribution. The mean holding times (consisting of the service and blocking periods) of all stations of the line are obtained in an analytical form. Numerical results are provided for the mean throughput of lines with up to 20 stations. These results are shown to have a good accuracy compared against results obtained from the Markovian state method (for short lines) and results from simulation (for longer lines). © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 669–685, 1998