Development programs for one‐shot systems using multiple‐state design reliability models

Design reliability at the beginning of a product development program is typically low, and development costs can account for a large proportion of total product cost. We consider how to conduct development programs (series of tests and redesigns) for one‐shot systems (which are destroyed at first use or during testing). In rough terms, our aim is to both achieve high final design reliability and spend as little of a fixed budget as possible on development. We employ multiple‐state reliability models. Dynamic programming is used to identify a best test‐and‐redesign strategy and is shown to be presently computationally feasible for at least 5‐state models. Our analysis is flexible enough to allow for the accelerated stress testing needed in the case of ultra‐high reliability requirements, where testing otherwise provides little information on design reliability change. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

关于一类特殊的（α，β）度量的S曲率

构造了一类具有5个参量的特殊的（α,β）度量,在此基础上计算了其射影平坦的条件,并通过计算得出其具有常S曲率。     

浅析我国新阶段下的“三农”问题

三农(农民、农业、农村)在中国城市化、工业化、现代化过程中具有不可逾越的地位,有着不可低估的人口影响、空间影响、素质影响和政治影响。由于受经济、产业、制度的制约,出现了农民增长缓慢、农业发展动力不足、农村剩余劳动力过多等“三农”问题。新的国际、国内发展阶段又加剧了“三农”问题,使其成为影响我国经济持续健康发展的重要因素。“三农”问题的解决需要新的思路、新的方法和新的措施,这要求我们必须从以下几方面思考:大力发展小城镇,转移农村剩余劳动力;调整产业结构,提高农产品市场竞争力;大力发展教育,增加劳动力的人力资本存量;加大对“三农”的支持力度,创造良好的发展环境。     

基于GP的计划生成方法

针对计划生成的计算复杂性和传统遗传算法在求解组合问题时的低效率,结合任务策略提出了一种基于遗传程序设计的计划生成方法。利用业务活动域的任务策略知识来指导遗传操作,减少了完全随机遗传操作造成的无效操作,并且在进化过程中使高阶模式和低阶模式获得共同的进化机会,提高了遗传算法的效率。     

航天遥感监测信息态势感知能力分析

针对遥感监测信息的效用评估问题,提出了一种态势感知能力定量分析的新方法。首先利用NIIRS等级尺度和GIQE模型建立了遥感图像与地面目标检测率之间的联系,由此得到这些目标在监视区域出现的概率分布。然后,以地面目标在监视区域的实际分布表示使用者信息需求,并利用信息理论中的Kullback Leibler距离来度量不确定性分布和信息需求之间的差异,从而得到不同遥感侦察与监视系统态势感知能力曲线,给出了传输处理时延对态势感知能力曲线的影响。     

Robust capacity planning in semiconductor manufacturing

We present a stochastic programming approach to capacity planning under demand uncertainty in semiconductor manufacturing. Given multiple demand scenarios together with associated probabilities, our aim is to identify a set of tools that is a good compromise for all these scenarios. More precisely, we formulate a mixed‐integer program in which expected value of the unmet demand is minimized subject to capacity and budget constraints. This is a difficult two‐stage stochastic mixed‐integer program which cannot be solved to optimality in a reasonable amount of time. We instead propose a heuristic that can produce near‐optimal solutions. Our heuristic strengthens the linear programming relaxation of the formulation with cutting planes and performs limited enumeration. Analyses of the results in some real‐life situations are also presented. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

Evaluating methods for the reliability of a large 2‐dimensional rectangular k‐within‐consecutive‐(r,s)‐out‐of‐(m,n):F system

A 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system consists of m × n components, and fails if and only if k or more components fail in an r × s submatrix. This system can be treated as a reliability model for TFT liquid crystal displays, wireless communication networks, etc. Although an effective method has been developed for evaluating the exact system reliability of small or medium‐sized systems, that method needs extremely high computing time and memory capacity when applied to larger systems. Therefore, developing upper and lower bounds and accurate approximations for system reliability is useful for large systems. In this paper, first, we propose new upper and lower bounds for the reliability of a 2‐dimensional rectangular k‐within‐consecutive‐(r, s)‐out‐of‐(m, n):F system. Secondly, we propose two limit theorems for that system. With these theorems we can obtain accurate approximations for system reliabilities when the system is large and component reliabilities are close to one. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production

This article considers the order batching problem in steelmaking and continuous‐casting production. The problem is to jointly specify the slabs needed to satisfy each customer order and group all the slabs of different customer orders into production batches. A novel mixed integer programming model is formulated for the problem. Through relaxing the order assignment constraints, a Lagrangian relaxation model is then obtained. By exploiting the relationship between Lagrangian relaxation and column generation, we develop a combined algorithm that contains nested double loops. At the inner loop, the subgradient method is applied for approximating the Lagrangian dual problem and pricing out columns of the master problem corresponding to the linear dual form of the Lagrangian dual problem. At the outer loop, column generation is employed to solve the master problem exactly and adjust Lagrangian multipliers. Computational experiments are carried out using real data collected from a large steel company, as well as on large‐scaled problem instances randomly generated. The results demonstrate that the combined algorithm can obtain tighter lower bound and higher quality solution within an acceptable computation time as compared to the conventional Lagrangian relaxation algorithm. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

Fashion products with asymmetric sales horizons

In this study, we explore an inventory model for a wholesaler who sells a fashion product through two channels with asymmetric sales horizons. The wholesaler can improve profitability by employing joint procurement and inventory reallocation as a recourse action in response to the dynamics of sales. In this research, a simple stochastic programming model is analyzed to specify the properties of the optimal inventory decisions. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

求最大数目不相交多约束QoS路由的一种新方法

针对多约束QoS路由问题中从资源点到目的点的最大数目的不相交路由,文章给出了一种基于罚函数与整数规划的求满足QoS约束的最大数目的互不相交路由算法。该算法利用了路由模型的结构特性,使整数规划问题转化为线性规划问题,初步的算例表明算法是有效的。