Maximizing project cash availability

Consider a project during the life cycle of which there are cash payouts and in‐flows. To better meet his financial commitments, the project owner would like to meet all deadlines without running out of cash. We show that the cash availability objective is similar to the total weighted flowtime used to measure work‐in‐progress performance in the scheduling and inventory control literatures. In this article we provide several specialized solution methods for the problem of minimizing total weighted flowtime in an arbitrary acyclic project network, subject to activity release times and due dates, where the activity weights may be positive or negative and represent cash in‐ and out‐flows. We describe the structure of an optimal solution and provide several efficient algorithms and their complexity based on mincost and maxflow formulations. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

雷达智能BIT故障预测方法研究

在总结了几种比较常见的故障预测方法的基础上，介绍了基于统计学习理论的支持向量回归算法。提出将智能遗传算法用来对支持向量回归模型的参数进行优化选取，并详细介绍了模型参数的选取过程，避免了参数的盲目设置。将建立起来的模型应用于雷达智能BIT故障预测领域，并以一组智能BIT状态监测的数据对预测模型进行训练和验证，实验结果表明支持向量回归模型能有效地对雷达故障进行预测。     

巨型机通用数学库软件与并行算法

本文介绍了巨型机通用数学库软件的概念和意义,指出了巨型机数学软件开发的技术途径与发展趋势,讨论了并行算法在其中的关键性作用,结合实例分析了巨型机通用数学库软件研制中的并行算法设计与实现。     

平面 NURBS 曲线的椭圆弧自适应逼近

给出了用椭圆弧及双椭圆弧自适应逼近平面NURBS曲线的算法。算法所得到的椭圆样条能够G1连续 ,双椭圆样条还能够保形。与现行的圆弧逼近算法相比 ,本算法不需要求解非线性方程组 ,而是由给定的插补误差自动计算参数增量 ,得到椭圆曲线的特征点 ,还可以将误差控制在预期的范围之内 ;与现行的直线插补方法相比 ,不需要额外的时间和空间 ,也适用于CNC环境。本算法在腔体加工、二维轮廓加工等方面有特别的实用价值。     

分段线性凸费用网络流的两个算法

本文讨论了分段线性凸费用网络流问题,推广了线性费用网络流中的负回路方法和最小费用路方法,从而得到了求分段线性凸费用网络的最小费用流的两个算法。     

辛算法应用于Duffing方程的保结构性

讨论了不受外力的Duffing方程在辛算法和非辛算法作用下，相轨线被保持和破坏的性质。证明了当时间步长充分小时，辛算法可以保持原系统的大部分不变闭曲线，而非辛算法却做不到这一点。     

Aggregating courier deliveries

We consider the problem of efficiently scheduling deliveries by an uncapacitated courier from a central location under online arrivals. We consider both adversary‐controlled and Poisson arrival processes. In the adversarial setting we provide a randomized (3βΔ/2δ ? 1) ‐competitive algorithm, where β is the approximation ratio of the traveling salesman problem, δ is the minimum distance between the central location and any customer, and Δ is the length of the optimal traveling salesman tour overall customer locations and the central location. We provide instances showing that this analysis is tight. We also prove a 1 + 0.271Δ/δ lower‐bound on the competitive ratio of any algorithm in this setting. In the Poisson setting, we relax our assumption of deterministic travel times by assuming that travel times are distributed with a mean equal to the excursion length. We prove that optimal policies in this setting follow a threshold structure and describe this structure. For the half‐line metric space we bound the performance of the randomized algorithm in the Poisson setting, and show through numerical experiments that the performance of the algorithm is often much better than this bound.     

Approximation methods for the analysis of a multicomponent,multiproduct assemble‐to‐order system

In this article, we consider the performance evaluation of a multicomponent, multiproduct assemble‐to‐order (ATO) system. Each component is managed independently using a base‐stock policy at a supply facility with limited production capacity and an infinite buffer. The arrivals of demands follow a multivariate Poisson process and unfilled demands are backlogged. Because exact analysis of the proposed system is not feasible, we propose two approximation methods which provide upper and lower bounds for various performance measures such as fill rate, average waiting time, and average number of backorders of the proposed system. Our computational experiments demonstrate the effectiveness of the two approximation methods under various system settings. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

C2组织的通信结构优化设计与分析

指挥控制(Command and Control,C2)组织的通信结构设计是解决网络中心战条件下指控信息高效交互的核心问题.围绕C2组织通信结构的延时、可靠性及成本进行建模,在虚拟全连通网络中采用路由随机搜索的方法避免路由及拓扑的局部搜索,并基于遗传算进行全局搜索求解.实验分析表明该方法可以实现优化目标和效果.