Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

垂直线列阵无源定位精度分析

提出了一种基于垂直线阵的系统,给出了定位模型,并简要介绍了其定位原理.利用由时延引入的距离、高低角和观测得到的方位角信息,建立了三维坐标系下的状态方程和观测方程.通过理论分析和仿真计算,讨论了声速测量误差、时延估计误差和阵元位置误差对系统定位精度的影响,给出了时延估计误差的克拉美-罗下界.综合时延估计、基线横纵扰动、三类误差的影响,在一定条件下,对目标距离估计的相对误差可控制在20%以内.     

基于最大后验概率候选集更换法的多故障诊断策略研究

给出了一种基于最大后验概率候选集更换法的多故障诊断策略，并深入阐述了基于最大后验概率候选集更换法的形式化描述，分析了对单故障诊断和多故障诊断的计算模型，提出了基本的故障诊断算法——改进二进制粒子群算法，并对抽象实例进行验证，结果表明，采用改进BPSO算法能有效地求解基于最大后验概率候选集更换法的多故障诊断问题。     

基于Bayes统计理论的射表编拟方法

全面系统阐述了Bayes统计理论下的射表编拟方法,具体研究了验前信息的处理、符合计算、编拟计算及试验用弹量的确定等几个关键难点问题,同时导出了确定先验分布中未知参数的计算公式、射表基本诸元的后验估计公式、射表试验用弹量的计算公式。通过两个实例对其具体使用方法给予了详细说明并对其结果进行了分析,指出应用该方法可以在相同精度要求下节省用弹量或在相同用弹量下提高射表精度,具有很好的经济适用价值。     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

A stochastic model for burn‐in procedures in accelerated environment

Burn‐in procedure is a manufacturing technique that is intended to eliminate early failures of system or product. Burning‐in a component or system means to subject it to a period of use prior to being used in field. Generally, burn‐in is considered expensive and so the length of burn‐in is typically limited. Thus, burn‐in is most often accomplished in an accelerated environment in order to shorten the burn‐in process. A new failure rate model for an accelerated burn‐in procedure, which incorporates the accelerated ageing process induced by the accelerated environmental stress, is proposed. Under a more general assumption on the shape of failure rate function of products, which includes the traditional bathtub‐shaped failure rate function as a special case, upper bounds for optimal burn‐in time will be derived. A numerical example will also be given for illustration. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

一类极小能控制与广义样条函数

本文讨论由一般微分方程确定的时不变线性系统的一类极小能控制问题。首先,通过引入降阶逆向系统揭示了原系统的输入与输出是由某个积分-微分算子联系着的,并利用该算子建立了极小能控制与广义样条的联系;然后在对于输出端的一类较广泛的约束条件下,导出了其输出空间与文[1]的输出空间具有类似的构造性质,从而建立了与文[1]类似的投影公式与递推公式。     

Dual‐ascent and primal heuristics for production‐assembly‐distribution system design

This article proposes two dual‐ascent algorithms and uses each in combination with a primal drop heuristic embedded within a branch and bound framework to solve the uncapacitated production assembly distribution system (i.e., supply chain) design problem, which is formulated as a mixed integer program. Computational results indicate that one approach, which combines primal drop and dual‐ascent heuristics, can solve instances within reasonable time and prescribes solutions with gaps between the primal and dual solution values that are less than 0.15%, an efficacy suiting it for actual large‐scale applications. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2013     

Path optimization for the resource‐constrained searcher

We formulate and solve a discrete‐time path‐optimization problem where a single searcher, operating in a discretized three‐dimensional airspace, looks for a moving target in a finite set of cells. The searcher is constrained by maximum limits on the consumption of one or more resources such as time, fuel, and risk along any path. We develop a specialized branch‐and‐bound algorithm for this problem that uses several network reduction procedures as well as a new bounding technique based on Lagrangian relaxation and network expansion. The resulting algorithm outperforms a state‐of‐the‐art algorithm for solving time‐constrained problems and also is the first algorithm to solve multi‐constrained problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010