大型工程项目集成化管理环境下的知识协同与任务调度

将各个项目单元抽象为不同的知识源,详细分析了集成化管理环境下的知识协同问题,提出了基于权威性加权原则的知识协同处理策略,并就策略修正、协同求解等问题作了分析说明。在此基础上,采取前向调度算法和逆向调度算法相结合的迭代算法,建立了协同工作中的任务调度模型,算例证明,模型能够有效满足各约束条件下任务的增删需求。     

Transporting jobs through a two‐machine open shop

We consider the two‐machine open shop scheduling problem in which the jobs are brought to the system by a single transporter and moved between the processing machines by the same transporter. The purpose is to split the jobs into batches and to find the sequence of moves of the transporter so that the time by which the completed jobs are collected together on board the transporter is minimal. We present a ‐approximation algorithm. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2009     

基于LMI的不确定性无尾飞行器鲁棒变增益控制器设计

无尾式飞行器是飞行器发展的方向,研究无尾式控制具有重要意义.研究了线性变参数系统的增益调度控制器的设计方法,采用多胞形进行增益调度,提出了一种简单实用的变参数顶点凸分解方法,该方法在保证系统稳定的情况下,确保系统达到最优性能指标.同时还充分考虑了系统的不确定性因素,利用线性矩阵不等式(LMI)对系统进行鲁棒控制器设计,大大减少了计算量以及对系统的约束,设计出了基于LMI的增益调度控制器,通过非线性仿真结果可以看出,该控制器在调节变量变化很大的情况下,使得系统在0.5s内收敛,而且超调量很小,论证了该方法在无尾式飞控系统中应用的可行性.     

考虑随机回放的卫星数传调度问题的一种求解方法

针对考虑随机回放的卫星数传调度问题,从置换空间到调度解空间的映射方法和置换空间的搜索算法两方面进行了研究.提出了一种时间窗优先的置换序列映射算法,并证明该映射算法可以将置换序列映射到调度解空间上的最优解.提出了一种遗传随机搜索算法,基于有记忆功能的随机邻域搜索,在置换空间上搜索产生优化调度的置换序列.仿真计算表明,遗传随机搜索算法可以增强遗传算法的局部搜索能力,在搜索结果上平均获得了2.72%的改进.     

Linear compound algorithms for the partitioning problem

For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S₁ and S₂ such that the sum of elements in S₁ is equal to the sum of elements in S₂. If additionally two elements (the kernels) r₁, r₂ ∈ S are given which must not be assigned to the same set S_i, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000     

A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times

We investigate a single‐machine scheduling problem for which both the job processing times and due windows are decision variables to be determined by the decision maker. The job processing times are controllable as a linear or convex function of the amount of a common continuously divisible resource allocated to the jobs, where the resource allocated to the jobs can be used in discrete or continuous quantities. We use the common flow allowances due window assignment method to assign due windows to the jobs. We consider two performance criteria: (i) the total weighted number of early and tardy jobs plus the weighted due window assignment cost, and (ii) the resource consumption cost. For each resource consumption function, the objective is to minimize the first criterion, while keeping the value of the second criterion no greater than a given limit. We analyze the computational complexity, devise pseudo‐polynomial dynamic programming solution algorithms, and provide fully polynomial‐time approximation schemes and an enhanced volume algorithm to find high‐quality solutions quickly for the considered problems. We conduct extensive numerical studies to assess the performance of the algorithms. The computational results show that the proposed algorithms are very efficient in finding optimal or near‐optimal solutions. © 2017 Wiley Periodicals, Inc. Naval Research Logistics, 64: 41–63, 2017     

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     

军事云环境下基于动态博弈的资源调度方法

针对军事云环境下联合指挥资源调度优化问题,综合考虑了多部队任务需求,多目标优化,多部队资源竞争等约束条件,运用动态博弈理论及方法,建立并提出了一种基于完全信息扩展博弈的资源调度模型及方法,提高了资源调度效率,兼顾了多部队利益,增加了联合作战效益。最后通过实验验证了其有效性及准确性。     

基于Pareto排序法的战时装备维修任务多目标调度方法

针对战时武器装备维修保障问题,建立了包括最大完工时间、延迟时间和维修单元负荷在内的多目标优化调度模型。为提高解的多样性和收敛性,构建了一种基于Pareto排序法和小生境技术相结合的遗传算法用于模型求解,引入Pareto排序和拥挤距离进行适应度计算,通过混沌系统随机生成权重系数,并使用小生境技术改进选择方式。通过实例验证表明,该方法能够有效地解决装备维修多目标调度问题。     

基于时间窗的宽带阵列多目标干扰资源调度

随着宽带数字阵列技术和有源干扰技术的不断发展和成熟,舰载有源干扰设备的未来发展方向将是宽带数字阵列有源干扰系统。针对多目标干扰问题,提出了目标干扰时间窗概念和两种时间窗的处理方法,并建立干扰资源调度模型,通过仿真计算和对比分析,得出基于模糊时间窗的资源调度模型性能优于基于硬时间窗的资源调度模型,能够对干扰资源进行合理的调度,提高宽带阵列多目标干扰能力。