Reformulating linear programs with transportation constraints—With applications to workforce scheduling

We study linear programming models that contain transportation constraints in their formulation. Typically, these models have a multistage nature and the transportation constraints together with the associated flow variables are used to achieve consistency between consecutive stages. We describe how to reformulate these models by projecting out the flow variables. The reformulation can be more desirable since it has fewer variables and can be solved faster. We apply these ideas to reformulate two well‐known workforce staffing and scheduling problems: the shift scheduling problem and the tour scheduling problem. We also present computational results. © 2003 Wiley Periodicals, Inc. Naval Research Logistics, 2004.     

基于运动学模型的灵巧成像卫星观测摆角算法

针对灵巧成像卫星对地面目标观测摆角的计算问题,考虑地球自转和卫星在轨运动等约束,利用空间坐标变换建立了基于椭球体的空间运动学模型.在此模型的基础上,给出了任意时刻卫星对目标观测摆角的计算方法.仿真结果验证了方法的正确性.任意时刻观测摆角的获取为灵巧成像卫星任务调度提供支持.     

Facility location for an extraterrestrial production/distribution system

This paper extends traditional production/distribution system analysis to address raw material, factories, and markets located beyond Earth. It explains the eventual advantages of such operations and discusses likely sites in the solar system. It furnishes a typology for production/distribution systems, assessing the fit of each type to space operations. It briefly reviews the physics of orbits. It develops transportation and inventory cost functions for the simplest case of Hohmann trajectories, and for transportation between circular orbits of similar radii using higher‐energy trajectories. These cost functions are used to derive a model of production/distribution system cost, the minimization of which selects an optimal factory location. The paper suggests potential extensions to this work, and concludes with ideas for location research on the novel reaches of extraterrestrial space. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A robust policy for serial agile production systems

One of the major problems in modeling production systems is how to treat the job arrival process. Restrictive assumptions such as Markovian arrivals do not represent real world systems, especially if the arrival process is generated by job departures from upstream workstations. Under these circumstances, cost‐effective policies that are robust with respect to the nature of the arrival process become of interest. In this paper, we focus on minimizing the expected total holding and setup costs in a two‐stage produce‐to‐order production system operated by a cross‐trained worker. We will show that if setup times are insignificant in comparison with processing times, then near‐optimal policies can be generated with very robust performances with respect to the arrival process. We also present conditions under which these near‐optimal policies can be obtained by using only the arrival and service rates. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

空域频域不确定条件下电磁探测卫星规划方法研究

电磁探测卫星对区域目标的覆盖搜索在反恐及海上搜救等领域发挥着重要作用.针对电磁探测卫星区域搜索任务中存在的空域频域不确定性,构建了电磁探测卫星区域搜索问题(EDSASP)中不确定因素的量化描述模型及决策要素模型,提出了基于贝叶斯决策的电磁卫星任务规划方法,并以信息探测收益和前端截获收益为优化目标,建立了空域频域不确定条...     

化学激光器环形与线形分流管道对比的数值分析

环柱型化学激光器中使用的分流管道的总管为环形弯曲管道,支管分布在内侧圆弧或外侧圆弧上,结构与线形分流管道有较大差别。应用计算流体力学方法,对上述各分流管道进行了三维的数值模拟及对比分析。结果表明,线形分流管道总管内的总压高于支管分布在外侧圆弧上的环形管道,但低于支管分布在内侧圆弧上的环形管道;无论是支管分流,抑或环形管道内的二次流现象都会使总管截面上产生径向速度,使得流体流动呈现明显的三维特征;分流管道各支管流量沿主流流动方向基本上是上升的,这与总管的总压分布趋势相反,而与总管的静压分布趋势相似;比较而言,支管分布在外侧圆弧上的环形分流管道的支管流量波动幅度最小,在均匀分配气流方面最具优势,线形分流管道居中,支管分布在内侧圆弧上的环形分流管道最差。     

机动管线便携式混油界面检测仪研制

机动管线大量运用于抢险、救灾、作战等特殊场合,顺序输送多种油品(水)是其主要输送工艺.及时、准确地检测和跟踪混油界面是保证输送油品质量、正确进行混油切割、减少混油损失的关键.根据机动管线特点和使用要求,在分析研究国内外常用混油界面检测技术的基础上,采用超声波“波辐射”法,研制出一种新型便携式混油界面检测仪.     

有限元法在管道水击计算中的应用探索

管道水击基本方程属于一阶双曲型偏微分方程,虽然目前水击主要采用特征线法进行计算,但有限元法也可以求解双曲型方程,据此尝试采用伽辽金加权余量法对管道水击进行有限元数值计算。根据管道水击的基本微分方程组,选取适当的速度、压力插值函数,建立管道水击的有限元模型,并通过实例分析,和特征线法相比较,证实有限元法在管道水击计算中是有应用前景的,有必要作进一步深入研究。     

嵌入式操作系统多策略调度模型

分析了目前嵌入式操作系统调度策略的现状,指出了传统调度方法的不足之处,给出了多策略调度模型,该模型根据进程的属性参数决定采用哪种调度算法。多策略调度模型采用两级调度方案,即在原传统调度方法的基础上增加一级调度。一级调度确定多个调度算法的优先顺序;二级调度确定同一种调度算法中,的进程优先顺序。该模型使进程调度更加灵活和高效,应用范围更广。     

Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006