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     

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

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

基于动态罚函数遗传算法的电磁探测卫星多星规划方法

针对电磁探测卫星的特点,考虑其主要约束条件,建立了多星联合规划数学模型,提出了基于遗传算法的电磁探测卫星多星规划算法.为处理遗传算法迭代过程中产生的不可行解,引入了基于罚函数法的约束处理方法.针对罚函数法中惩罚系数难以确定的特点,设计了惩罚系数自适应调整的动态罚函数机制.根据模拟的数据进行实验及分析,表明该方法能有效解决电磁探测卫星多星规划问题.     

On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑_jF_j where F_j(C_j) corresponds to the cost of the completion of job j at time C_j. This class of function is very large and thus interesting both from a theoretical and practical point of view: It can be used to model total (weighted) completion time, total (weighted) tardiness, earliness and tardiness, etc. We introduce a new Mixed Integer Program (MIP) based on time interval decomposition. Our MIP is closely related to the well‐known time‐indexed MIP formulation but uses much less variables and constraints. Experiments on academic benchmarks as well as on real‐life industrial problems show that our generic MIP formulation is efficient. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Scheduling policies for an antiterrorist surveillance system

This article concerns scheduling policies in a surveillance system aimed at detecting a terrorist attack in time. Terrorist suspects arriving at a public area are subject to continuous monitoring, while a surveillance team takes their biometric signatures and compares them with records stored in a terrorist database. Because the surveillance team can screen only one terrorist suspect at a time, the team faces a dynamic scheduling problem among the suspects. We build a model consisting of an M/G/1 queue with two types of customers—red and white—to study this problem. Both types of customers are impatient but the reneging time distributions are different. The server only receives a reward by serving a red customer and can use the time a customer has spent in the queue to deduce its likely type. In a few special cases, a simple service rule—such as first‐come‐first‐serve—is optimal. We explain why the problem is in general difficult and we develop a heuristic policy motivated by the fact that terrorist attacks tend to be rare events. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

基于最大保障时间的战时装备维修任务调度模型

战时维修机构承担的维修任务比较繁重,合理、科学地安排维修任务可以有效地提高作战部队的战斗力.对此,分析了战时维修任务调度的特点,建立了基于最大保障时间的维修任务静态、动态调度模型,并提出了相应的模型求解方法.利用本方法在满足作战单元最大保障时间前提下,可使得装备维修效益最大,并可以实现实时动态维修任务调度,有效地解决了一种战时维修任务调度问题.     

预定增益理论在导弹飞行控制系统中的应用

针对导弹在飞行过程中动力学特性大范围变化的特点,以俯仰通道为例,运用预定增益控制理论设计导弹飞行控制系统,即利用导弹空气动力学特性和导弹某些特征参数的强相关性来调整控制器参数,确保导弹在要求的飞行条件下满足稳定性和动态品质.最后通过仿真验证了所设计的控制器满足性能要求.     

基于线对线突然短路的同步电机瞬态参数辨识

准确地辨识同步电机参数,是分析电力系统运行和控制系统设计的前提.利用最小二乘或卡尔曼滤波等方法辨识电机三相同时突然短路试验数据,是传统电机参数辨识的主要方式.受同步电机三相同时突然短路的可操作性和电机参数模型的强非线性等因素的影响,电机瞬态参数难以准确测量.利用改进的小波变换和人工神经元网络辨识参数的新方法,结合容易实现的同步电机线对线突然短路试验,辨识得到了三相同步电机的瞬态参数,有效提高了电机参数的辨识精度.仿真试验表明,该方法是有效的.     

基于灰度共生三角阵的炮膛图像分析

为解决炮膛疵病图像粗分类时缺少聚类和分类特征的问题,引入了灰度共生三角阵（Grey Level Co-occurrence Triangular Matrix,GLCTM）的方法。通过对炮膛样本图像GLCTM特征参量的计算与分析,确定了GLCTM的参数;根据特征参量的相关性分析结果,选择了其中7个作为炮膛图像的特征参量。样本图像的实验结果表明,炮膛图像的GLCTM特征参量取值与图像灰度的直观特点之间存在对应关系。