Minimizing weighted earliness and tardiness penalties in single‐machine scheduling with idle time permitted

In this paper, a single‐machine scheduling problem with weighted earliness and tardiness penalties is considered. Idle time between two adjacent jobs is permitted and due dates of jobs could be unequal. The dominance rules are utilized to develop a relationship matrix, which allows a branch‐and‐bound algorithm to eliminate a high percentage of infeasible solutions. After combining this matrix with a branching strategy, a procedure to solve the problem is proposed. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 760–780, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10039     

自适应两步滤波算法在机载IRSTS被动定位中的应用

在机载红外搜索跟踪系统被动定位研究中,针对扩展卡尔曼滤波算法要求先验的噪声统计及存在系统观测模型线性化误差影响滤波精度的特点,利用两步滤波算法并结合Sage-Husa噪声估计器构建了适用于机载IRSTS被动定位特点的自适应两步滤波算法模型,算法不仅实时在线地估计了观测噪声的统计特性,而且避免了观测模型线性化误差.仿真结果表明,在完全相同的初始条件下,自适应两步滤波算法对目标运动参数的估计结果明显优于扩展卡尔曼滤波,从而提高了机载IRSTS被动定位的精度.     

Systems composed of two types of nonidentical and dependent components

A coherent system of order n that consists two different types of dependent components is considered. The lifetimes of the components in each group are assumed to follow an exchangeable joint distribution, and the two random vectors, which represent the lifetimes of the components in each group are also assumed to be dependent. Under this particular form of dependence, all components are assumed to be dependent but they are categorized with respect to their reliability functions. Mixture representation is obtained for the survival function of the system's lifetime. Mixture representations are also obtained for the series and parallel systems consisting of disjoint modules such that all components of Type I are involved in one module (subsystem) and all components of Type II are placed in the other module. The theoretical results are illustrated with examples. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 388–394, 2015     

CFO条件下的OFDM子载波调制样式识别方法

提出了一种基于信号幅度分布特征与多次方谱线特征相结合的调制样式识别算法。该算法主要基于正交解调后的正交频分复用子载波信号的幅度分布特征,采用直方图统计的方法实现多进制相移键控和多进制正交幅度调制识别,用多方次谱特征实现多进制相移键控类的调制识别。相比基于经典的高阶累积量的调制识别算法,具有更好的载波频率残留偏差适应能力,在载波频率偏差条件下,提高了调制识别率;相比循环平稳方法,具有更好的信噪比适应能力。仿真实验结果表明了该方法的有效性,相同的识别率下能适应更低的信噪比。     

一种基于单频GPS接收机的自迭代定位算法

随着通用航空及无人机产业的发展,低成本及小型化的导航解决方案将具有广泛的市场。提出了一种基于单频GPS接收机的自迭代定位算法,用于提高定位精度,增强定位收敛性。对该算法的基本原理进行了分析,并推导出该算法的数学模型,通过静态实验的方法对该算法的收敛性进行验证,并将该算法的位置信息与最小二乘法解出的位置信息进行对比,体现了自迭代定位算法的优势。     

Single‐commodity stochastic network design under demand and topological uncertainties with insufficient data

Stochastic network design is fundamental to transportation and logistic problems in practice, yet faces new modeling and computational challenges resulted from heterogeneous sources of uncertainties and their unknown distributions given limited data. In this article, we design arcs in a network to optimize the cost of single‐commodity flows under random demand and arc disruptions. We minimize the network design cost plus cost associated with network performance under uncertainty evaluated by two schemes. The first scheme restricts demand and arc capacities in budgeted uncertainty sets and minimizes the worst‐case cost of supply generation and network flows for any possible realizations. The second scheme generates a finite set of samples from statistical information (e.g., moments) of data and minimizes the expected cost of supplies and flows, for which we bound the worst‐case cost using budgeted uncertainty sets. We develop cutting‐plane algorithms for solving the mixed‐integer nonlinear programming reformulations of the problem under the two schemes. We compare the computational efficacy of different approaches and analyze the results by testing diverse instances of random and real‐world networks. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 154–173, 2017     

Many‐server loss models with non‐poisson time‐varying arrivals

This article proposes an approximation for the blocking probability in a many‐server loss model with a non‐Poisson time‐varying arrival process and flexible staffing (number of servers) and shows that it can be used to set staffing levels to stabilize the time‐varying blocking probability at a target level. Because the blocking probabilities necessarily change dramatically after each staffing change, we randomize the time of each staffing change about the planned time. We apply simulation to show that (i) the blocking probabilities cannot be stabilized without some form of randomization, (ii) the new staffing algorithm with randomiation can stabilize blocking probabilities at target levels and (iii) the required staffing can be quite different when the Poisson assumption is dropped. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 177–202, 2017     

Statistical analysis for masked system life data from Marshall‐Olkin Weibull distribution under progressive hybrid censoring

This paper considers the statistical analysis of masked data in a series system, where the components are assumed to have Marshall‐Olkin Weibull distribution. Based on type‐I progressive hybrid censored and masked data, we derive the maximum likelihood estimates, approximate confidence intervals, and bootstrap confidence intervals of unknown parameters. As the maximum likelihood estimate does not exist for small sample size, Gibbs sampling is used to obtain the Bayesian estimates and Monte Carlo method is employed to construct the credible intervals based on Jefferys prior with partial information. Numerical simulations are performed to compare the performances of the proposed methods and one data set is analyzed.     

矿区生态型和非矿区生态型蜈蚣草对铅胁迫的生理响应

探讨不同矿区生态型蜈蚣草对铅的耐性及其耐铅机理,为进一步研究蜈蚣草植物修复射击场土壤的铅污染提供理论依据。在水培铅胁迫的环境条件,对矿区生态型和非矿区生态型蜈蚣草生长过程中的生物量、色素含量、MDA质量摩尔浓度和CAT,POD,SOD活性等进行了研究。研究发现,营养液中铅的加入抑制了蜈蚣草的生长,降低了羽叶中的色素含量,大幅度提高了MDA质量摩尔浓度和CAT,POD,SOD活性。结果表明,蜈蚣草对铅有一定的耐性,并且矿区生态型蜈蚣草的耐性明显高于非矿区生态型。主要表现为矿区生态型蜈蚣草的抗氧化酶活性高于非矿区生态型,生物量和色素含量受铅胁迫影响的程度相对较小。当铅质量浓度达到300 mg/L,铅胁迫15 d后,非矿区生态型蜈蚣草抗氧化酶系统紊乱,植株接近枯死状态,而矿区生态型蜈蚣草的耐性表现相对较好。     

Return policy: Hassle‐free or your money‐back guarantee?

This article compares the profitability of two pervasively adopted return policies—money‐back guarantee and hassle‐free policies. In our model, a seller sells to consumers with heterogeneous valuations and hassle costs. Products are subject to quality risk, and product misfit can only be observed post‐purchase. While the hassle‐free policy is cost advantageous from the seller's viewpoint, a money‐back guarantee allows the seller to fine‐tune the consumer hassle on returning the product. Thus, when the two return policies lead to the same consumer behaviors, the hassle‐free policy dominates. Conversely, a money‐back guarantee can be more profitable even if on average, high‐valuation consumers experience a lower hassle cost than the low‐valuation ones. The optimal hassle cost can be higher when product quality gets improved; thus, it is not necessarily a perfect proxy or signal of the seller's quality. We further allow the seller to adopt a mixture of these policies, and identify the concrete operating regimes within which these return policies are optimal among more flexible policies. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 403–417, 2014