On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于柔性基础的双层隔振系统概率灵敏度分析

对基于柔性基础的双层隔振系统的功率流传递特性进行了分析,利用有限元分析软件ANSYS计算了传递到基础的功率流,并用概率灵敏度分析方法研究了功率流对隔振系统给定参数的灵敏度,为双层隔振系统的优化设计奠定了基础.     

一类有增益网络的最大流模型

一般带容量限制的网络图中流出源点与流入汇点的流量相等,但在实际应用中,存在一类流量经过弧发生变化的网络,使得流出源点与流入汇点的流量不相等。针对此类问题,建立了增益网络最大流模型,并通过增设虚弧将增益网络转换成循环网络,利用循环网络中汇点流量瞬间平衡的优点简化了模型。最后,结合实例进行分析,编写程序对实例进行了计算,计算结果验证了该模型的有效性。     

油-水旋流器流场数值模拟研究

采用改进后的双方程湍流模型和SIMPLE计算方法,对切流式单入口油-水旋流器内部流场进行了模拟研究。结果表明:旋流器内部三维流场各向异性,即同一位置流体在不同方向的流动参数变化很大,流体质点在不同条件下的运动轨迹、速度、分离特性等方面都有较大差别;圆柱段与圆锥段的流场在柱锥结合面发生变化,旋流器的主要分离过程在圆锥段完成;单入口旋流器的流场中心与几何中心有偏差,对流场的稳定和分离会产生影响。该模拟结果与他人所做实验结果比较接近,说明该模型和算法是可靠的,为旋流器的实际应用提供了参考。     

进气口位置和进气体积流量对油罐油气惰化置换效率的影响

采用机械通风方式对油罐油气进行处理,具有安全性差、通风时间长和效率低下的缺点;利用燃惰气对油罐油气进行处理,可较好地克服上述缺点。在前期研究的基础上,设计模拟实验台架,以燃惰气为介质,实验研究进气口位置和进气体积流量对燃惰气惰化置换油罐油气的影响。     

基于任务的连续出动舰载机航空保障重调度研究

对舰载机和各种保障资源进行调度是提高舰载机航空保障效率、保证舰载机所承担作战任务顺利完成的有效手段。为了克服以往研究中没有考虑作战任务变更对舰载机航空保障调度的影响,使用重调度的理论与方法研究了基于任务的连续出动舰载机航空保障重调度问题,建立了连续出动舰载机航空保障重调度模型。采用免疫算法对模型进行求解,可以避免模型的解空间可能出现组合爆炸问题。最后通过一个实例表明该模型可以很好的应对由作战任务变更所引起的重调度问起,算法求解速度满足作战需求,从而验证了模型的准确性及算法的有效性。     

An efficient metaheuristic for integrated scheduling and staffing IT projects based on a generalized minimum cost flow network

Scheduling IT projects and assigning the project work to human resources are an important and common tasks in almost any IT service company. It is particularly complex because human resources usually have multiple skills. Up to now only little work has considered IT‐specific properties of the project structure and human resources. In this article, we present an optimization model that simultaneously schedules the activities of multiple IT projects with serial network structures and assigns the project work to multiskilled internal and external human resources with different efficiencies. The goal is to minimize costs. We introduce a metaheuristic that decomposes the problem into a binary scheduling problem and a continuous staffing problem where the latter is solved efficiently by exploiting its underlying network structure. For comparison, we solve the mixed–binary linear program with a state–of–the–art commercial solver. The impacts of problem parameters on computation time and solution gaps between the metaheuristic and the solver are assessed in an experimental study. Our results show that the metaheuristic provides very favorable results in considerable less time than the solver for midsize problems. For larger problems, it shows a similar performance while the solver fails to return feasible solutions. © 2012 Wiley Periodicals, Inc. Naval Research Logistics 59: 111–127, 2012     

k-ary n-cube中的移动气泡流控策略

在k-ary n-cube网络中,气泡流控是一种有效、实用的死锁避免技术,它不必依赖虚通道就能避免环网中出现的死锁问题。如果流控策略能感知到维度内缓冲区的总体使用情况,就能够更加高效地进行调度,从而提高网络性能。为了避免关键气泡机制引起的阻塞,提出了伪报文协议;结合伪报文协议,设计了移动气泡流控策略,它有效实现了维度内的全局资源感知能力。与局部气泡流控相比,路由器每条输入通道仅设置一个报文缓冲区就可以避免环网中的死锁,即最小资源需求减少了一半。网络模拟结果表明,该机制不会出现永久阻塞;在distribute、hotregion和uniform传输模式中,该机制可以有效提高网络吞吐率20%以上,并且在网络饱和后吞吐率依然维持稳定。     

Polynomial‐time approximation schemes for two‐machine open shop scheduling with nonavailability constraints

This paper addresses a two‐machine open shop scheduling problem, in which the machines are not continuously available for processing. The processing of an operation affected by a non‐availability interval can be interrupted and resumed later. The objective is to minimize the makespan. We present two polynomial‐time approximation schemes, one of which handles the problem with one non‐availability interval on each machine and the other for the problem with several non‐availability intervals on one of the machines. Problems with a more general structure of the non‐availability intervals are not approximable in polynomial time within a constant factor, unless . © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

低功率霍尔推力器阳极供气环工程设计关键参数仿真

为了提高低功率霍尔推力器放电通道内中性原子分布均匀性,采用有限元方法对阳极供气环关键结构参数进行优化研究。针对双腔式阳极供气环结构,重点分析了缓冲腔容积比以及缓冲腔隔板导流小孔数量等关键参数对阳极供气均匀性的影响。研究结果表明:随着缓冲腔容积比的增大,阳极供气环出气孔差异率先快速减小后趋于稳定,其中当容积率k=1.0时,平均差异率和最大差异率分别为1.77%和3.79%;隔板间导流小孔数量从8增加到14时,出气孔差异率呈现浴盆曲线特性,其中导流孔数量为10时,平均差异率和最大差异率分别为1.8%和3.8%。研究结果可为霍尔推力器阳极供气环工程设计提供理论支撑。