三组元喷嘴混合特性的试验研究

本文对四种类型的气氢／液氧／煤油三组元喷嘴进行了混合特性试验, 研究了内喷嘴的缩进长度对同轴离心外混式喷嘴混合特性的影响, 对比了相同的三组元工况下各喷嘴的混合特性, 分析了喷嘴结构对混合特性的影响, 进行了单喷嘴和三喷嘴的混合特性试验, 试验结果表明： 在相同的三组元工况下, 同轴直流式喷嘴的流强分布跨度比同轴离心式喷嘴小。所得结论对三组元喷嘴和气液同轴式喷嘴的优化设计有参考价值。     

一个基于面向对象模型的并行系统

为了开发分布式系统中的计算资源,我们设计了一个基于面向对象大粒度数据流模型的并行Ｃ＋＋系统ＯＯＣＰＣＳ．该系统的底层计算模型是面向对象范式和数据流模型的结合体。它将状态对象引入到数据流模型中,并且支持面向对象的特性。本文讨论了此模型在ＯＯＣＰＣＳ系统中的实现;并行化编译器;ＰＯＣ程序设计语言;面向对象网络文件Ｉ／Ｏ和虚拟ＯＯＬＧＤＦＭ机     

燃烧对固体燃料冲压发动机附着点的影响

应用 PHOENICS软件模拟了固体燃料冲压发动机 ( SFRJ)的冷流和以 HTPB、PS为推进剂的简单反应流。结果表明 :在相同入口条件下 ,燃烧使附着点明显前移 ,从而改变了流场结构 ;入口温度不影响冷流时的附着点 ,但在有反应情况下则有一定影响 ;在两种情况下入口流量对附着点均无影响。     

Transshipment through crossdocks with inventory and time windows

A major challenge in making supply meet demand is to coordinate transshipments across the supply chain to reduce costs and increase service levels in the face of demand fluctuations, short lead times, warehouse limitations, and transportation and inventory costs. In particular, transshipment through crossdocks, where just‐in‐time objectives prevail, requires precise scheduling between suppliers, crossdocks, and customers. In this work, we study the transshipment problem with supplier and customer time windows where flow is constrained by transportation schedules and warehouse capacities. Transportation is provided by fixed or flexible schedules and lot‐sizing is dealt with through multiple shipments. We develop polynomial‐time algorithms or, otherwise, provide the complexity of the problems studied. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Disruption management in production planning

We study the problem of recovering a production plan after a disruption, where the disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery plan we seek after has to not only suit the changed environment brought about by the disruption, but also be close to the initial plan so as not to cause too much customer unsatisfaction or inconvenience for current‐stage and downstream operations. For the general‐cost case, we propose a dynamic programming method for the problem. For the convex‐cost case, a general problem which involves both cost and demand disruptions can be solved by considering the cost disruption first and then the demand disruption. We find that a pure demand disruption is easy to handle; and for a pure cost disruption, we propose a greedy method which is provably efficient. Our computational studies also reveal insights that will be helpful to managing disruptions in production planning. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

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.     

基于引擎成员的仿真调度问题

仿真引擎作为仿真系统的核心,是HLA仿真联邦中的特殊联邦成员。论述了基于实体、成员和引擎的层次式仿真调度概念结构,及其采用的基于时间序和事件序的仿真调度方案,将作战实体的时间推进和交战处理都归入仿真引擎,确保了全局时间统一性、实体同步性和交战事件的有序性,而且各种参量的设置灵活,便于控制。介绍了仿真引擎成员的设计与实现。该引擎成员在某指挥自动化作战效能仿真与评估系统中得以应用。     

高性能路由器中的分组非精确调度技术

随着网络带宽的不断提高,分组到达路由器的时间间隔不断缩短,对路由器处理分组的速度提出了新的要求。传统的分组调度算法,如WFQ,由于性能和可扩展性等问题,难以在高性能核心路由器中实现。为此,提出了分组非精确调度技术,在不影响应用QoS的前提下对经典的调度算法进行修改,通过简化硬件设计提高调度器的服务能力。模拟分析表明,采用非精确调度技术的SLQF算法的延时特性与传统算法LQF基本一致。     

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

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

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015