Forecast horizons for the discounted dynamic lot-size problem allowing speculative motive

This article considers the dynamic lot-size problem under discounting, allowing speculative motive for holding inventory. A variable rolling-horizon procedure is presented, which, under certain regularity conditions, is guaranteed to generate an infinite-horizon optimal-production plan. We also discuss a fixed rolling-horizon procedure which provides a production plan that achieves an infinite-horizon cost within a user-specified tolerance ϵ of optimality. The fixed-horizon length T* needed in this procedure is given in terms of a closed-form formula that is independent of specific forecasted demands. We also present computational results for problems with a range of cost parameters and demand characteristics.     

Operating characteristics of a two-echelon inventory system for repairable and consumable items under batch ordering and shipment policy

In this article we have generalized previous models on multiechelon recoverable inventory systems to cover the cases of batch ordering and shipment policy, and when items can either be repaired or condemned. The batch ordering and shipment policy is appropriate when the setup cost for shipment and order and/or the demand rates of the items are relatively high. The operating characteristics of such a system have been studied. Specifically, the probability distribution of backorder levels at the bases are analyzed for different repair-time distributions. An approximation scheme is proposed for this distribution, and is evaluated using extensive simulation results. The results indicate that the scheme is very effective in providing near-optimal stocking levels in such a system.     

A multifaceted heuristic for the orienteering problem

The orienteering problem involves the selection of a path between an origin and a destination which maximizes total score subject to a time restriction. In previous work we presented an effective heuristic for this NP-hard problem that outperformed other heuristics from the literature. In this article we describe and test a significantly improved procedure. The new procedure is based on four concepts—center of gravity, randomness, subgravity, and learning. These concepts combine to yield a procedure which is much faster and which results in more nearly optimal solutions than previous procedures.     

Heuristic scheduling of resource-constrained projects with cash flows

Resource-constrained project scheduling with cash flows occurs in many settings, ranging from research and development to commercial and residential construction. Although efforts have been made to develop efficient optimal procedures to maximize the net present value of cash flows for resource-constrained projects, the inherent intractability of the problem has led to the development of a variety of heuristic methods to aid in the development of near-optimal schedules for large projects. This research focuses on the use of insights gained from the solution of a relaxed optimization model in developing heuristic procedures to schedule projects with multiple constrained resources. It is shown that a heuristic procedure with embedded priority rules that uses information from the revised solution of a relaxed optimization model increases project net present value. The heuristic procedure and nine different embedded priority rules are tested in a variety of project environments that account for different network structures, levels of resource constrainedness, and cash-flow parameters. Extensive testing with problems ranging in size from 21 to 1000 activities shows that the new heuristic procedures dominate heuristics using information from the critical path method (CPM), and in most cases outperform heuristics from previous research. The best performing heuristic rules classify activities into priority and secondary queues according to whether they lead to immediate progress payments, thus front loading the project schedule. © 1997 John Wiley & Sons, Inc. Naval Research Logistics 44: 365–381, 1997     

不同流量的复杂保障网络抗毁性仿真分析

通过引入流量强度指数和流量分布指数,建立了不同网络流量下的复杂保障网络级联失效抗毁性模型。基于该模型比较分析了无标度网络、随机网络和复杂保障网络在不同流量强度和流量分布下对单个节点的随机失效和故意攻击的抗毁性。结果表明:复杂保障网络的抗毁性随着流量强度的增加急剧下降。此外,流量分布对复杂保障网络的抗毁性也有显著影响。     

基于GAHP的作战决策方案优选模型

优选科学合理的作战方案,是指挥员作战决策的关键。根据作战实际情况,运用五标度和六标度法量化了各因素对作战决策方案的影响指标,建立了基于多人层次分析法(GAHP)理论的优选作战决策方案数学模型,以从方案中选出作战效益最好、付出代价最小且最具可行性的方案,作为决策的具体行动依据。最后通过实例验证了模型的可操作性。GAHP方法能很好地运用不同决策者对方案的不同评价,形成最终决策,对作战指挥决策有一定的现实意义。     

战场电磁环境客观复杂性分析与评估

战场电磁环境具有客观复杂性的特点,总体表现为空域上纵横交错、时域上动态变化、频域上密集交叠、能域上强弱起伏等特点。构建了用于描述战场电磁环境"四域"特征指标,给出了指标计算方法,根据战场电磁环境客观复杂性的定级标准,即可概略得出战场电磁环境的复杂程度。研究成果对复杂电磁环境问题研究具有实用价值。     

一类二阶微分方程Poincaré分岔极限环的不存在性

讨论一类二阶微分方程x¨+εf(x,x.)x.+g(x)=0的Poincar分岔极限环的不存在性,利用一阶Mel’nikov函数直接从整体上进行分析讨论,得出了若干充分条件和判别准则。