装备经济性分析中的结构制造复杂度参数建模

参数估算法是当前装备经济性分析的主要方法,TruePlanning软件为国际主流的装备经济性分析软件。基于TruePlanning软件,以制造复杂度(Manufacturing Complexity)为研究对象,通过对TrueH模块进行深度剖析,分析并确立了结构制造复杂度(Manufacturing Complexity for Structure)的建模思路和模型形式。通过一个实例分析,选取5个必要的输入参数,构建结构制造复杂度的初步模型,并进一步考虑附加参数的输入,对模型进行修正。结果显示了结构制造复杂度对各技术参数的不同响应形式和敏感程度,为开发国产费用估算模型提供了可行的思路。     

康特洛维奇的数值方法在矩形薄板横向弯曲振动中的应用

本文提出的解决矩形薄板弯曲振动问题的康特洛维奇的数值方法,大大减少了所需要的计算机内存。通过算例表明它具有比较高的计算精度和计算速度,是一种有前途的计算方法。     

舰载装备系统效费权衡分析

借助于趋势分析法进行效费权衡 ,分析了装备系统效能和费用随性能指标变化的发展趋势 ,确定了性能指标的变化对效能与费用的影响大小 ,进而可为装备的研制发展提供有价值的权衡依据 .     

Global planning of accelerated degradation tests based on exponential dispersion degradation models

The accelerated degradation test (ADT) is an efficient tool for assessing the lifetime information of highly reliable products. However, conducting an ADT is very expensive. Therefore, how to conduct a cost-constrained ADT plan is a great challenging issue for reliability analysts. By taking the experimental cost into consideration, this paper proposes a semi-analytical procedure to determine the total sample size, testing stress levels, the measurement frequencies, and the number of measurements (within a degradation path) globally under a class of exponential dispersion degradation models. The proposed method is also extended to determine the global planning of a three-level compromise plan. The advantage of the proposed method not only provides better design insights for conducting an ADT plan, but also provides an efficient algorithm to obtain a cost-constrained ADT plan, compared with conventional optimal plans by grid search algorithms.     

Capacity expansion and cost efficiency improvement in the warehouse problem

The warehouse problem with deterministic production cost, selling prices, and demand was introduced in the 1950s and there is a renewed interest recently due to its applications in energy storage and arbitrage. In this paper, we consider two extensions of the warehouse problem and develop efficient computational algorithms for finding their optimal solutions. First, we consider a model where the firm can invest in capacity expansion projects for the warehouse while simultaneously making production and sales decisions in each period. We show that this problem can be solved with a computational complexity that is linear in the product of the length of the planning horizon and the number of capacity expansion projects. We then consider a problem in which the firm can invest to improve production cost efficiency while simultaneously making production and sales decisions in each period. The resulting optimization problem is non‐convex with integer decision variables. We show that, under some mild conditions on the cost data, the problem can be solved in linear computational time. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 367–373, 2016     

带有可信度因子的直觉模糊近似推理方法

针对基于相似度的直觉模糊近似推理问题,提出一种基于加权相似度量的直觉模糊推理方法。首先定义一种新的直觉模糊相似度度量公式,加入权重参数解决各维特征分配不均匀的问题,弥补了现有直觉模糊相似度量的缺陷。然后构建基于直觉模糊产生式规则的直觉模糊近似推理模型,加入可信度因子解决了随机性引起的信息不确定问题,同时给出模型的推理算法和计算步骤。最后通过实例验证了该方法的实用性和有效性,其在意图识别、目标识别等信息融合领域有良好的应用前景。     

Scheduling with variable time slot costs

In this article, we study a class of new scheduling models where time slot costs have to be taken into consideration. In such models, processing a job will incur certain cost which is determined by the time slots occupied by the job in a schedule. The models apply when operational costs vary over time. The objective of the scheduling models is to minimize the total time slot costs plus a traditional scheduling performance measure. We consider the following performance measures: total completion time, maximum lateness/tardiness, total weighted number of tardy jobs, and total tardiness. We prove the intractability of the models under general parameters and provide polynomial‐time algorithms for special cases with non‐increasing time slot costs.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于One-port模式的测试点选取问题

在故障诊断过程中 ,每个测试点检测故障所需的时间可能不同。对于每个测试点一次检测所有可检测故障点的问题已经获得解决。对于每个测试点一次只能检测一个故障点 ,分两种情况加以讨论。若要求检测时间之和最小 ,给出了最优算法 ;若要求最大检测时间最小 ,证明了其是NP完全问题 ,并给出近似算法。最后给出一个实例对算法加以说明     

Determining optimal sizes of bounded batches with rejection via quadratic min‐cost flow

In this article, we consider a single machine scheduling problem, in which identical jobs are split into batches of bounded sizes. For each batch, it is allowed to produce less jobs than a given upper bound, that is, some jobs in a batch can be rejected, in which case a penalty is paid for each rejected job. The objective function is the sum of several components, including the sum of the completion times, total delivery cost, and total rejection cost. We reduce this problem to a min‐cost flow problem with a convex quadratic function and adapt Tamir's algorithm for its solution. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 217–224, 2017     

Progress payments and cost overruns in defence contracts

In recent years military procurement agencies have used “progress payments” in contracting. Although, overall, the adoption of such a policy may well have contributed to a decrease in total costs of procurement, we identify a class of inefficiencies that are likely to have been generated by it.