Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

一种用于机电产品测试性设计的传感器优选MINLP模型

在单故障假设条件下,考虑了传感器的失效概率和设备的故障率,提出一种以故障检测率和故障隔离率为约束条件的降低传感器费用和失效概率的混合整数非线性规划(MINLP)模型,从而为机电产品测试性设计中传感器选择问题提供了一种可行和有效的解决方法,并进行了案例验证,说明了该方法的有效性。     

基于模糊商空间理论的产品粒化过程分析

模块形成与划分是展开模块化设计及大规模定制生产的关键环节。为了进一步扩展产品模块化的定量分析手段,提出了一种基于模糊商空间理论的产品粒化方法。通过引入粒度计算,将基于相关性分析的产品模块化过程转化为基于粒度计算的产品粒化过程,并应用模糊商空间理论对其进行了分析,给出了基于归一化距离和综合模糊相似关系的产品粒度空间构建方法,建立了基于两阶段优化算法的最佳产品粒层确定流程,进而得到了最优模块划分方案,最后以某堆垛机货叉机构为例对该方法进行了有效性验证。此方法为产品模块聚类与优化提供了一种新的数值分析和评价手段,应用结果表明该方法具有一定的可行性和合理性,能够有效指导产品模块化过程的实施。     

考虑CCD噪声条件下的编码曝光最优码字搜索方法

编码曝光技术将病态的运动模糊图像复原问题转化为良态问题,寻找最优码字是编码曝光技术的关键。面向实用化目的,提出了一种考虑CCD传感器噪声的编码曝光相机最优码字搜索方法。基于仿射噪声模型对图像成像过程中的噪声成分进行了系统分析,首次从理论上分析了Raskar码字选取依据并基于复原图像信噪比增益提出了光子噪声对最优码字构造影响的解析表达式。在对实际编码曝光相机进行噪声标定的基础上,提出了最优码字搜索的准则并构造出适应度函数,采用遗传算法进行优化搜索得到最优码字。仿真图像和真实图像的复原结果证实了该方法的有效性,复原图像信噪比得到有效的提高。     

基于分段连续推力的中途修正方法(英文)

基于小偏差理论,对无摄三体动力学方程沿标称轨道线性化,推导了三体动力模型的误差线性模型。在此基础上,进一步利用该最优控制方法推导了转移轨道周期内的连续小推力控制方案,验证了控制加速度及状态量的收敛。同时针对整周期控制方式在超调后状态量收敛速度慢的问题,通过分段连续推力控制模式(Segm en ta l Con tinuous T hrust Con tro l,SCTC)来近似瞬时脉冲推力控制模式,并给出了最短分段控制时间的计算方法。实验表明,SCTC模式加快了轨道状态的收敛速度。对于km级入轨偏差,通过1次控制即可使实际轨道收敛至标称轨道。     

车辆悬挂系统的主动优化控制器设计及仿真

基于特征结构配置参数化结果,提出了车辆悬挂系统的主动优化控制器设计方法。该方法直接基于车辆悬挂系统的参数矩阵,便于工程应用。车辆悬挂系统的仿真实例表明所提主动优化控制器设计方法简单且有效。     

Determination of burn‐in parameters and residual life for highly reliable products

Today, many products are designed and manufactured to function for a long period of time before they fail. Determining product reliability is a great challenge to manufacturers of highly reliable products with only a relatively short period of time available for internal life testing. In particular, it may be difficult to determine optimal burn‐in parameters and characterize the residual life distribution. A promising alternative is to use data on a quality characteristic (QC) whose degradation over time can be related to product failure. Typically, product failure corresponds to the first passage time of the degradation path beyond a critical value. If degradation paths can be modeled properly, one can predict failure time and determine the life distribution without actually observing failures. In this paper, we first use a Wiener process to describe the continuous degradation path of the quality characteristic of the product. A Wiener process allows nonconstant variance and nonzero correlation among data collected at different time points. We propose a decision rule for classifying a unit as normal or weak, and give an economic model for determining the optimal termination time and other parameters of a burn‐in test. Next, we propose a method for assessing the product's lifetime distribution of the passed units. The proposed methodologies are all based only on the product's initial observed degradation data. Finally, an example of an electronic product, namely contact image scanner (CIS), is used to illustrate the proposed procedure. © 2002 Wiley Periodicals, Inc. Naval Research Logistics, 2003     

Optimal control of an M/G/1 queue with impatient priority customers

An optimal operating policy is characterized for the infinite‐horizon average‐cost case of a single server queueing control problem. The server may be turned on at arrival epochs or off at departure epochs. Two classes of customers, each of them arriving according to an independent Poisson processes, are considered. An arriving 1‐customer enters the system if the server is turned on upon his arrival, or if the server is on and idle. In the former case, the 1‐customer is selected for service ahead of those customers waiting in the system; otherwise he leaves the system immediately. 2‐Customers remain in the system until they complete their service requirements. Under a linear cost structure, this paper shows that a stationary optimal policy exists such that either (1) leaves the server on at all times, or (2) turns the server off when the system is empty. In the latter case, we show that the stationary optimal policy is a threshold strategy, this feature being commonplace in most of priority queueing systems and inventory models. However, the optimal policy in our model is determined by two thresholds instead of one. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 201–209, 2001     

Optimal material control in an assembly system with component commonality

Allocation of scarce common components to finished product orders is central to the performance of assembly systems. Analysis of these systems is complex, however, when the product master schedule is subject to uncertainty. In this paper, we analyze the cost—service performance of a component inventory system with correlated finished product demands, where component allocation is based on a fair shares method. Such issuing policies are used commonly in practice. We quantify the impact of component stocking policies on finished product delays due to component shortages and on product order completion rates. These results are used to determine optimal base stock levels for components, subject to constraints on finished product service (order completion rates). Our methodology can help managers of assembly systems to (1) understand the impact of their inventory management decisions on customer service, (2) achieve cost reductions by optimizing their inventory investments, and (3) evaluate supplier performance and negotiate contracts by quantifying the effect of delivery lead times on costs and customer service. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:409–429, 2001