Approximation results for min‐max path cover problems in vehicle routing

This article studies a min‐max path cover problem, which is to determine a set of paths for k capacitated vehicles to service all the customers in a given weighted graph so that the largest path cost is minimized. The problem has wide applications in vehicle routing, especially when the minimization of the latest service completion time is a critical performance measure. We have analyzed four typical variants of this problem, where the vehicles have either unlimited or limited capacities, and they start from either a given depot or any depot of a given depot set. We have developed approximation algorithms for these four variants, which achieve approximation ratios of max{3 ‐ 2/k,2}, 5, max{5 ‐ 2/k,4}, and 7, respectively. We have also analyzed the approximation hardness of these variants by showing that, unless P = NP , it is impossible for them to achieve approximation ratios less than 4/3, 3/2, 3/2, and 2, respectively. We have further extended the techniques and results developed for this problem to other min‐max vehicle routing problems.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

考虑运行故障的工程安全设施使用检查可用度模型

使用检查是发现工程安全设施系统隐蔽功能故障的有效措施。在考虑检查期间可能发生运行故障的前提下,建立了基于使用检查策略的系统可用度模型。应用该模型对应急柴油发电机的使用检查过程进行可用度分析,确定了其最优检查问隔期和给定可用度条件下的检查间隔期区间;探讨了检查时间和维修时间对可用度的影响。研究表明,该模型对于工程安全设施系统的可用度分析是有效可行的,其结果能够为维修决策提供依据。     

一种基于数据仓库的通用OLAP数据接入构件的新型设计

为了解决异构数据源融合和数据仓库的迁移问题,结合数据仓库和构件技术的思想,提出了一种基于数据仓库的通用OLAP(online analysis process)数据接入构件的设计方案.该方案针对完成数据操作封装的数据接入构件进行了建模,并且针对这种模型设计了一个基于构件的OLAP通用数据接入原型系统,实现了OLAP界面展示工具和异构数据源的自由配对和无缝迁移.     

Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

领导干部经济责任审计风险成因及其防范

当前,领导干部经济责任审计风险的成因主要有外部原因和内部原因两个方面。防范经济责任审计风险,必须创造良好的审计环境,加强审计工作管理,努力提高审计人员的综合素质。     

Sojourn times in G/M/1 fork‐join networks

We consider a processing network in which jobs arrive at a fork‐node according to a renewal process. Each job requires the completion of m tasks, which are instantaneously assigned by the fork‐node to m task‐processing nodes that operate like G/M/1 queueing stations. The job is completed when all of its m tasks are finished. The sojourn time (or response time) of a job in this G/M/1 fork‐join network is the total time it takes to complete the m tasks. Our main result is a closed‐form approximation of the sojourn‐time distribution of a job that arrives in equilibrium. This is obtained by the use of bounds, properties of D/M/1 and M/M/1 fork‐join networks, and exploratory simulations. Statistical tests show that our approximation distributions are good fits for the sojourn‐time distributions obtained from simulations. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Designing a screening experiment for highly reliable products

Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024     

基于“当前”统计模型的综合滤波-参数识别模型

在机动目标“当前”统计模型的基础上建立了新的综合滤波－参数识别模型,并用识别－滤波两步走的方法在线识别机动示性参数和量测噪音参数,由此实现对机动目标跟踪的动态建模,使数学模型更加符合实际情况。     

双自旋卫星的姿态稳定性判据

本文推证了一个双自旋卫星的姿态稳定性新判据。判据的论证基于没有活动部件但有能量耗散的半刚体概念,并且采用了有关系统稳定性的李雅普诺夫方法。然后,将这个结论同Iorillo、Landon、Likins 采用离散参数法和能沉法所得到的结论进行了比较。     

核反应堆最小烧毁比计算的新方法

用传统算法求得最小烧毁比的值总是大于实际值,使计算结果偏于危险.根据实验测量的实际情况提出了一个新的算法,克服了上述缺点,这对反应堆热工设计与安全分析都有重要的意义.