Capacitated lot‐sizing and scheduling with parallel machines,back‐orders,and setup carry‐over

We address the capacitated lot‐sizing and scheduling problem with setup times, setup carry‐over, back‐orders, and parallel machines as it appears in a semiconductor assembly facility. The problem can be formulated as an extension of the capacitated lot‐sizing problem with linked lot‐sizes (CLSPL). We present a mixed integer (MIP) formulation of the problem and a new solution procedure. The solution procedure is based on a novel “aggregate model,” which uses integer instead of binary variables. The model is embedded in a period‐by‐period heuristic and is solved to optimality or near‐optimality in each iteration using standard procedures (CPLEX). A subsequent scheduling routine loads and sequences the products on the parallel machines. Six variants of the heuristic are presented and tested in an extensive computational study. © 2009 Wiley Periodicals, Inc. Naval Research Logistics 2009     

灰色直接迭代建模在武器故障预报中的应用

武器系统故障数据常呈现出非等时距、随机性及非准光滑特性,不满足GM(1,1)的建模条件。为此,引入故障信息序列的导数作为建模的白化值,并使用迭代优化算法进行参数优化,从而构建灰色直接迭代GM(1,1)模型。同时,直接迭代建模可有效利用数据第一点的信息,建模时不需累加生成变换和还原处理,算法简单可行,可以有效解决武器系统贫信息状态下的故障预报问题。仿真结果验证了该模型对于实际武器故障序列具有较高的拟合和预测精度。为了解和掌握武器质量状态的发展规律提供了可行的方法。     

远距离支援压制干扰实施及结果评定方法

远距离支援干扰在现代战争中发挥着重要的作用。为分析远距离支援干扰实施及对被试雷达性能影响,首先根据中心极限定理,推导了靶场试验中检飞航次数的数学模型,然后研究了基于干信比的干扰机飞行航路设计原则,最后通过仿真分析,给出了试验样本数与发现概率和置信区间的关系,讨论了不同航路点上到达被试雷达的干信比和对被试雷达性能的影响,解决了靶场抗干扰试验中试验样本数及试验航路设计等方面问题。     

Scheduling multiple products on parallel machines with setup costs

We consider a class of production scheduling models with m identical machines in parallel and k different product types. It takes a time p_i to produce one unit of product type i on any one of the machines. There is a demand stream for product type i consisting of n_i units with each unit having a given due date. Before a machine starts with the production of a batch of products of type i a setup cost c is incurred. We consider several different objective functions. Each one of the objective functions has three components, namely a total setup cost, a total earliness cost, and a total tardiness cost. In our class of problems we find a relatively large number of problems that can be solved either in polynomial time or in pseudo‐polynomial time. The polynomiality or pseudo‐polynomiality is achieved under certain special conditions that may be of practical interest; for example, a regularity pattern in the string of due dates combined with earliness and tardiness costs that are similar for different types of products. The class of models we consider includes as special cases discrete counterparts of a number of inventory models that have been considered in the literature before, e.g., Wagner and Whitin (Manage Sci 5 (1958), 89–96) and Zangwill (Oper Res 14 (1966), 486–507; Manage Sci 15 (1969), 506–527). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Scheduling parallel machines with inclusive processing set restrictions

We consider the problem of assigning a set of jobs to different parallel machines of the same processing speed, where each job is compatible to only a subset of those machines. The machines can be linearly ordered such that a higher‐indexed machine can process all those jobs that a lower‐indexed machine can process. The objective is to minimize the makespan of the schedule. This problem is motivated by industrial applications such as cargo handling by cranes with nonidentical weight capacities, computer processor scheduling with memory constraints, and grades of service provision by parallel servers. We develop an efficient algorithm for this problem with a worst‐case performance ratio of + ε, where ε is a positive constant which may be set arbitrarily close to zero. We also present a polynomial time approximation scheme for this problem, which answers an open question in the literature. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

数字交流全电炮控系统研究

通过对比分析国内外坦克炮控系统技术,提出炮控系统技术发展方向,并提出数字交流全电炮控技术控制方案,即一种基于以数字信号处理器（ＤＳＰ）为主控芯片的永磁同步电机双环控制系统,控制方法采用正弦波脉冲宽度调制（ＳＰＷＭ）的控制方案。文中还就一些关键技术,如双模双环控制技术、变参数寻优控制方法、非线性反馈和非线性给定等进行了研究分析。     

An approximate dynamic programing approach to the development of heuristics for the scheduling of impatient jobs in a clearing system

A single server is faced with a collection of jobs of varying duration and urgency. Each job has a random lifetime during which it is available for nonpreemptive service. Should a job's lifetime expire before its service begins then it is lost from the system unserved. The goal is to schedule the jobs for service to maximize the expected number served to completion. Two heuristics have been proposed in the literature. One (labeled π^S) operates a static priority among the job classes and works well in a “no premature job loss” limit, whereas the second (π^M) is a myopic heuristic which works well when lifetimes are short. Both can exhibit poor performance for problems at some distance from the regimes for which they were designed. We develop a robustly good heuristic by an approximative approach to the application of a policy improvement step to the asymptotically optimal heuristic π^S, in which we use a fluid model to obtain an approximation for the value function of π^S. The performance of the proposed heuristic is investigated in an extensive numerical study. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 2010     

Modeling and analysis of multiobjective lot splitting for N‐product M‐machine flowshop lines

Lot splitting is a new approach for improving productivity by dividing production lots into sublots. This approach enables accelerating production flow, reducing lead‐time and increasing the utilization of organization resources. Most of the lot splitting models in the literature have addressed a single objective problem, usually the makespan or flowtime objectives. Simultaneous minimization of these two objectives has rarely been addressed in the literature despite of its high relevancy to most industrial environments. This work aims at solving a multiobjective lot splitting problem for multiple products in a flowshop environment. Tight mixed‐integer linear programming (MILP) formulations for minimizing the makespan and flowtime are presented. Then, the MinMax solution, which takes both objectives into consideration, is defined and suggested as an alternative objective. By solving the MILP model, it was found that minimizing one objective results in an average loss of about 15% in the other objective. The MinMax solution, on the other hand, results in an average loss of 4.6% from the furthest objective and 2.5% from the closest objective. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

基于小波配点法的空间机械臂关节轨迹规划

针对平面型空间机械臂关节轨迹优化问题,提出一种基于小波配点法的数值算法。该算法在区间样条小波函数及其导数算法的基础上,对状态变量与控制变量在小波配点上作离散化处理,然后将原最优控制问题转化为以小波系数为优化参数的非线性规划问题,利用非线性规划算法求解该问题得到原问题的解。算法可充分利用小波具有非线性逼近的优点,提高计算精度和效率。对典型问题进行数值仿真,结果表明该算法对空间机械臂关节轨迹优化问题是有效的。     

被动声纳浮标目标运动分析及其仿真计算

针对直升机搜索潜艇的特点,研究了被动声纳浮标目标运动分析问题。对固定目标和匀速直线运动目标,分别应用确定性计算和线性最小二乘法进行数学建模及其仿真。仿真结果表明该模型可行,能对被动式声纳浮标搜潜的目标定位提供算法依据。