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     

Optimizing usage and maintenance decisions for k‐out‐of‐n systems of moving assets

We consider an integrated usage and maintenance optimization problem for a k‐out‐of‐n system pertaining to a moving asset. The k‐out‐of‐n systems are commonly utilized in practice to increase availability, where n denotes the total number of parallel and identical units and k the number of units required to be active for a functional system. Moving assets such as aircraft, ships, and submarines are subject to different operating modes. Operating modes can dictate not only the number of system units that are needed to be active, but also where the moving asset physically is, and under which environmental conditions it operates. We use the intrinsic age concept to model the degradation process. The intrinsic age is analogous to an intrinsic clock which ticks on a different pace in different operating modes. In our problem setting, the number of active units, degradation rates of active and standby units, maintenance costs, and type of economic dependencies are functions of operating modes. In each operating mode, the decision maker should decide on the set of units to activate (usage decision) and the set of units to maintain (maintenance decision). Since the degradation rate differs for active and standby units, the units to be maintained depend on the units that have been activated, and vice versa. In order to minimize maintenance costs, usage and maintenance decisions should be jointly optimized. We formulate this problem as a Markov decision process and provide some structural properties of the optimal policy. Moreover, we assess the performance of usage policies that are commonly implemented for maritime systems. We show that the cost increase resulting from these policies is up to 27% for realistic settings. Our numerical experiments demonstrate the cases in which joint usage and maintenance optimization is more valuable. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 418–434, 2017     

Relative Aging of Coherent Systems

In this article, we carry out the stochastic comparison between coherent systems through the relative aging order when component lifetimes are independent and identically distributed. We make use of the signature to characterize the structure of coherent systems, and derive several sufficient conditions under which the compared systems with the common size can be ordered in the sense of relative aging. Specially, we present some scenarios wherein the better a coherent system is, the faster it ages. Moreover, we discuss the relative aging of dual systems as well. Several numerical examples are provided to illustrate the theoretical results. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 345–354, 2017     

基于年龄更换策略的威布尔分布备件需求计算方法

备件需求量预测在装备保障工作中发挥着重要作用。预防性维修可以消除装备潜在的故障或避免装备发生故障后所导致的严重后果,从而使装备始终处于期望状态。预防性维修策略下备件需求量建模能够以可预见的可靠性数据为基础进行,其关键问题是最佳更换间隔时间的确定。针对威布尔分布装备备件,采用年龄更换策略,确定最佳更换间隔时间,并在此基础上导出威布尔型备件需求计算模型,为备件需求量的预测提供了一种简单有效的方法。     

单机攻击多目标逻辑的遗传优化求解

攻击逻辑的优化决策对于机载多目标攻击武器系统具有重要意义。本文建立了单机多目标攻击逻辑的解算模型 ,提出了解算要求 ,给出了采用遗传算法求解多目标攻击逻辑的应用方案。在此基础上 ,采用该方案进行大量的试探性仿真研究 ,对仿真结果进行了分析 ,并选择了合适的遗传算法参数。文章最后阐述了用遗传算法求解多目标攻击逻辑问题的发展前景     

多传感器融合系统航迹号管理方法

多目标杂波环境下 ,多传感器探测形成的航迹之间呈现错综复杂的关系 ,多传感器系统融合中心航迹管理成了迫切需要解决的问题。在原有单航迹号分配方法的基础上 ,提出多航迹号分配方法 ,并扩展到立体图航迹号管理方法。尤其是航迹号立体图的引入 ,为航迹管理提供了一个新的思路。     

Centralized inventory control in a two‐level distribution system with Poisson demand

This paper introduces a new replenishment policy for inventory control in a two‐level distribution system consisting of one central warehouse and an arbitrary number of nonidentical retailers. The new policy is designed to control the replenishment process at the central warehouse, using centralized information regarding the inventory positions and demand processes of all installations in the system. The retailers on the other hand are assumed to use continuous review (R, Q) policies. A technique for exact evaluation of the expected inventory holding and backorder costs for the system is presented. Numerical results indicate that there are cases when considerable savings can be made by using the new (α₀, Q₀) policy instead of a traditional echelon‐ or installation‐stock (R, Q) policy. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 798–822, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10040     

嵌入式微处理器的多层次可配置仿真工具

为了适应嵌入式定制微处理器的开发的需要 ,克服现有微处理器仿真工具的某些不足 ,文中介绍了微处理器的仿真验证工具———VCPU的设计和实现方法。同其它微处理器仿真工具相比 ,该工具具有多层次 ,可配置 ,功能全面的特点。利用该工具 ,设计者可在设计早期进行系统集成验证 ,缩短设计周期并减少设计错误。该工具已经在嵌入式微处理器开发过程中得到成功应用     

A self‐adapting genetic algorithm for project scheduling under resource constraints

This papers deals with the classical resource‐constrained project scheduling problem (RCPSP). There, the activities of a project have to be scheduled subject to precedence and resource constraints. The objective is to minimize the makespan of the project. We propose a new heuristic called self‐adapting genetic algorithm to solve the RCPSP. The heuristic employs the well‐known activity list representation and considers two different decoding procedures. An additional gene in the representation determines which of the two decoding procedures is actually used to compute a schedule for an individual. This allows the genetic algorithm to adapt itself to the problem instance actually solved. That is, the genetic algorithm learns which of the alternative decoding procedures is the more successful one for this instance. In other words, not only the solution for the problem, but also the algorithm itself is subject to genetic optimization. Computational experiments show that the mechanism of self‐adaptation is capable to exploit the benefits of both decoding procedures. Moreover, the tests show that the proposed heuristic is among the best ones currently available for the RCPSP. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 433–448, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10029