具有吞吐量和时延约束的软件无线电波形部署决策算法

针对当前具有吞吐量和时延约束的软件无线电波形部署决策算法在内存开销方面考虑的不足,提出一个更为通用的波形部署决策系统模型,将波形的处理开销、内存开销和通信带宽开销都纳入到波形部署决策过程中,并设计了一种基于动态规划的波形部署决策算法以最小化波形对平台各种计算资源的占用总和。仿真结果表明,内存对波形部署决策具有重要影响,与未考虑内存开销的解决方案相比,平台支持的平均最大波形数目和平均处理资源利用率均下降40%左右。     

A decomposition heuristic for the twin robots scheduling problem

This article provides an efficient heuristic based on decomposition for the twin robots scheduling problem (TRSP). TRSP concerns two moving robots executing storage and retrieval requests in parallel along a shared pathway. The depots are located at both ends of the line and a dedicated robot is assigned to each of them. While moving goods between their respective depots and some storage locations on the line, noncrossing constraints among robots need to be considered. Our heuristic uses a dynamic programming framework to determine the schedule of one robot while keeping the other one's fixed. It finds near‐optimal solutions even for large problem instances with hundreds of jobs in a short time span. © 2014 Wiley Periodicals, Inc. 62:16–22, 2015     

指定目标不延误条件下的拦截决策算法

从现有的拦截排序准则出发,根据实际作战中进袭目标的特点,应用现代排序理论,分别建立了动态目标拦截排序模型和总损失最小化模型,给出相应的求解算法。最后实例计算得出模型既体现了现有的拦截准则,又对现有的准则进行了推广。     

舰载机多机一体化机务保障调度研究

针对舰载机多机一体化机务保障调度问题,以出树、入树的形式描述实际保障过程中并行工序的约束关系,以最大保障完工时间和资源负载均衡性为目标,构建了舰载机多机一体化机务保障非线性多目标混合流水车间调度模型,并设计了一种结合基于Insert的动态邻域爬山搜索策略和并行工序的同步化修正的Memetic算法求解该模型。最后通过实例仿真验证了模型和所提算法的可行性和有效性。     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

钢质管道挤压变形实验研究与结果分析

野外埋地敷设的长距离输油管道发生断裂等较大破坏时,采用管道局部挤压的方式,在较短时间内将管道快速压扁以截断流油。为了设计管道挤压截流装置,使用18 mm宽度的压头对?325 mm×6 mm的X60钢管进行挤压变形实验,得到了管道挤压的载荷-位移曲线、管道的变形范围、管道压扁后的回弹情况和挤压过程中的塑性载荷等数据,并验证了管道挤压过程中的安全性。通过实验,不仅可以研究管道塑性破坏后的变形规律,而且为管道泄漏抢修提供了理论和实践参考。     

径向载荷作用下管道挤压变形过程数值模拟

野外埋地敷设的长距离输油管道发生断裂等较大事故时,采用管道局部挤压的方式可以在较短时间内将管道快速压扁以截断流油。为设计管道挤压截流装置,运用ANSYS Workbench建立上下压头加载作用下管道挤压的有限元模型,完成对ф159 mm×5 mm的45号钢挤压变形模拟仿真,得到管道挤压的等效应力、位移分布、变形范围和载荷-位移曲线等。将模拟数据与实验数据进行对比,两者结果比较吻合,可以为管道泄漏抢修提供理论和实践参考。     

天基预警系统资源调度问题分析

在介绍天基预警系统作战流程,以及天基预警系统资源和任务的分析和描述的基础上,提出天基预警系统资源调度问题,给出其输入输出结构,并以五元组的形式对该问题进行形式化描述。 关键词：天基预警系统、资源调度、形式化描述     

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

We study a single batching machine scheduling problem with transportation and deterioration considerations arising from steel production. A set of jobs are transported, one at a time, by a vehicle from a holding area to the single batching machine. The machine can process several jobs simultaneously as a batch. The processing time of a job will increase if the duration from the time leaving the holding area to the start of its processing exceeds a given threshold. The time needed to process a batch is the longest of the job processing times in the batch. The problem is to determine the job sequence for transportation and the job batching for processing so as to minimize the makespan and the number of batches. We study four variations (P1, P2, P3, P4) of the problem with different treatments of the two criteria. We prove that all the four variations are strongly NP‐hard and further develop polynomial time algorithms for their special cases. For each of the first three variations, we propose a heuristic algorithm and analyze its worst‐case performance. For P4, which is to find the Pareto frontier, we provide a heuristic algorithm and an exact algorithm based on branch and bound. Computational experiments show that all the heuristic algorithms perform well on randomly generated problem instances, and the exact algorithm for P4 can obtain Pareto optimal schedules for small‐scale instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 269–285, 2014     

Review of the ordered and proportionate flow shop scheduling research

Ordered flow shop models have appeared in the literature since the mid‐1970s and proportionate flow shop models have appeared since the early 1980s. We provide a detailed review of these models along with some analysis and potential topics for future research. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013