2K-H 行星传动的极限传动比

在行星轮系机构综合中,研究行星轮数目与极限传动比的关系有着极其重要的意义。本文根据２Ｋ─Ｈ行星轮系机构的同心条件、安装条件和邻接条件,采用统一的符号,对满足上述条件的所有（六种）２Ｋ─Ｈ行星轮系机构,导出了行星轮个数与极限传动比的统一关系式,得到了所有２Ｋ─Ｈ行星轮系机构的极限传动比计算公式,为２Ｋ─Ｈ行星轮系机构的综合提供了理论根据。     

炸药装药在压剪加载下的起爆特点

进行了两类压剪加载实验：（１）利用石英的平面正碰撞产生压剪加载的实验,采用电磁质速法测试装药试件内部不同质点的运动情况,分析炸药装药中发生化学反应的可能性;（２）在压剪炮上采用平行倾斜碰撞产生压剪加载的实验,观测炸药装药爆炸的可能性。由实验可以看出：在亚爆轰状态的压缩加载应力条件下,剪切的联合作用对炸药的起爆起到敏化作用,适当比例的压剪加载造成更加敏感的炸药起爆响应。文中给出了起爆响应规律和响应机制的实验分析。     

面向卫星的在轨服务任务规划方法

针对空间在轨服务日趋成熟以及在轨服务现实需求增长的背景,以在轨服务航天器为研究对象,研究面向卫星的在轨服务任务规划问题,探讨如何合理安排与调配在轨服务资源。将问题分解为在轨服务资源分配和在轨服务路径规划两层,并建立双层优化数学模型。设计在轨服务任务规划算法求解问题,包括基于多种群并行进化的混沌遗传算法和基于全局坐标转换的NSGA-Ⅱ+GSDE算法,并通过仿真结果对比分析,验证算法的可行性和有效性。     

Replacing nonidentical vital components to extend system life

We consider a system that depends on a single vital component. If this component fails, the system life will terminate. If the component is replaced before its failure then the system life may be extended; however, there are only a finite number of spare components. In addition, the lifetimes of these spare components are not necessarily identically distributed. We propose a model for scheduling component replacements so as to maximize the expected system survival. We find the counterintuitive result that when comparing components' general lifetime distributions based on stochastic orderings, not even the strongest ordering provides an a priori guarantee of the optimal sequencing of components. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A bidirectional heuristic for maximizing the net present value of large‐scale projects subject to limited resources

We consider the scheduling of large‐scale projects to maximize the project net present value given temporal and resource constraints. The net present value objective emphasizes the financial aspects of project management. Temporal constraints between the start times of activities make it possible to handle practical problem assumptions. Scarce resources are an expression of rising cost. Since optimization techniques are not expedient to solve such problems and most heuristic methods known from literature cannot deal with general temporal constraints, we propose a new bidirectional priority‐rule based method. Scheduling activities with positive cash flows as early and activities with negative cash flows as late as possible results in a method which is completed by unscheduling techniques to cope with scarce resources. In a computational experiment, we compare the well‐known serial generation scheme where all activities are scheduled as early as possible with the proposed bidirectional approach. On the basis of a comprehensive data set known from literature containing instances with up to 1002 activities, the efficiency of the new approach is demonstrated. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

The effectiveness of the longest delivery time rule for the flow shop delivery time problem

In the flow shop delivery time problem, a set of jobs has to be processed on m machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize maximum delivery completion time over all the jobs, where the delivery completion time of a job is the sum of its completion time, and the delivery time associated with that job. In this paper, we prove the asymptotic optimality of the Longest Delivery Time algorithm for the static version of this problem, and the Longest Delivery Time among Available Jobs (LDTA) algorithm for the dynamic version of this problem. In addition, we present the result of computational testing of the effectiveness of these algorithms. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Scheduling jobs with piecewise linear decreasing processing times

We study the problems of scheduling a set of nonpreemptive jobs on a single or multiple machines without idle times where the processing time of a job is a piecewise linear nonincreasing function of its start time. The objectives are the minimization of makespan and minimization of total job completion time. The single machine problems are proved to be NP‐hard, and some properties of their optimal solutions are established. A pseudopolynomial time algorithm is constructed for makespan minimization. Several heuristics are derived for both total completion time and makespan minimization. Computational experiments are conducted to evaluate their efficiency. NP‐hardness proofs and polynomial time algorithms are presented for some special cases of the parallel machine problems. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 531–554, 2003     

Mean sojourn times in multiclass feedback queues with gated disciplines

In this paper, we investigate multiclass feedback queues with gated disciplines. The server selects the stations by a nonpreemptive priority scheduling algorithm and serves customers in the selected station by either a gated FCFS discipline or a gated priority discipline. We take a rather systematic approach to their mean sojourn times. We define conditional expected sojourn times for all customers and derive their expressions from an analysis of busy periods. Since they are shown to be linear in some components of the system states, their steady state mean values can be derived from simple limiting procedures. These mean values can be obtained from a set of linear equations. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 719–741, 2003.     

面向I/O优化调度器的磁盘特征提取

外存I/O一直是影响I/O密集型应用系统性能的决定性因素。在系统分析I/O优化调度策略及其对磁盘特征参数的需求的基础上,提出了一组面向I/O优化调度器的磁盘特征抽取方法。这些抽取方法已经被证明是高效的,并且在Traxtents Cello调度器的实现中得到采用。     

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