防空导弹武器系统目标分配的多种算法

叙述了防空导弹武器系统目标分配的一般数学模型。在此基础上,建立了防空导弹的5种目标分配数学优化算法,并讨论了数学模型的求解问题。最后,对这5种数学优化算法进行了比较。     

基于机械故障诊断的算法及小波基选择研究

针对小波分析在机械故障诊断应用中的快速算法和小波基选择存在的问题,对常用的正交、半正交、双正交小波提取信号特征的能力进行了分析比较,研究表明半正交B样条小波因具有线性相位和采用较长的分解序列而具有较好的频率局部化特性和较小的变换误差,具有比较好的综合性能。推导了正交小波包的图形显示算法,利用该算法解决了小波变换快速算法中存在的数据长度随分解层数成倍减小的问题。研究结果为机械故障诊断中选择小波基进行信号处理提供了依据和途径。     

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Note: On the two‐machine no‐idle flowshop problem

In this short note we study a two‐machine flowshop scheduling problem with the additional no‐idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these claims can be rectified. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47:353–358, 2000     

并串联系统设计优化

建立了并串联系统设计优化的两类模型,提出了遗传算法与模式搜索、启发式算法相结合的求解方法．     

高精度分数时延滤波器设计的边界拟合Remez算法

在卫星星间测距模拟信号仿真及实际测试中,为提高测距模拟信号精度和系统可用带宽,提出基于边界拟合Remez算法的高精度分数时延滤波器的设计算法。该算法利用Farrow结构的多项式近似思想,采用多项式拟合Remez算法设计滤波器的冲激响应边界系数,通过多相分解实现分数时延滤波器组。该算法改善了当设计的滤波器阶数较高时冲激响应边界的不连续现象,进而降低了群时延误差,提高了精度。仿真结果表明,该算法设计的滤波器的分数时延精度得到了提高,同时系统可用带宽提高近一倍,实现时需使用的乘法器数目也有明显降低。     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

Heuristic procedures for scheduling job families with setups and due dates

This paper examines heuristic solution procedures for scheduling jobs on a single machine to minimize the maximum lateness in the presence of setup times between different job families. It reviews the state of knowledge about the solution of this problem, which is known to be difficult to solve in general, and examines natural solution approaches derived from some of the underlying theory. The emphasis is on the design and computational evaluation of new heuristic procedures. © 1999 John Wiley & Sons, Inc. Naval Research Logistics 46: 978–991, 1999