Technical note: Reexamination of all‐or‐none inspection policies in a supply chain with endogenous product quality

This note studies the optimal inspection policies in a supply chain in which a manufacturer purchases components from a supplier but has no direct control of component quality. The manufacturer uses an inspection policy and a damage cost sharing contract to encourage the supplier to improve the component quality. We find that all‐or‐none inspection policies are optimal for the manufacturer if the supplier's share of the damage cost is larger than a threshold; otherwise, the manufacturer should inspect a fraction of a batch. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

DEA models for two‐stage processes: Game approach and efficiency decomposition

Data envelopment analysis (DEA) is a method for measuring the efficiency of peer decision making units (DMUs). This tool has been utilized by a number of authors to examine two‐stage processes, where all the outputs from the first stage are the only inputs to the second stage. The current article examines and extends these models using game theory concepts. The resulting models are linear, and imply an efficiency decomposition where the overall efficiency of the two‐stage process is a product of the efficiencies of the two individual stages. When there is only one intermediate measure connecting the two stages, both the noncooperative and centralized models yield the same results as applying the standard DEA model to the two stages separately. As a result, the efficiency decomposition is unique. While the noncooperative approach yields a unique efficiency decomposition under multiple intermediate measures, the centralized approach is likely to yield multiple decompositions. Models are developed to test whether the efficiency decomposition arising from the centralized approach is unique. The relations among the noncooperative, centralized, and standard DEA approaches are investigated. Two real world data sets and a randomly generated data set are used to demonstrate the models and verify our findings. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于证据熵对不确定性度量的决策表约简

知识约简是粗糙集理论的核心内容之一,产生的粗糙决策规则往往具有一定的不确定性.在变精度粗糙集的基础上,本文构造了符合证据理论框架的一组焦元,利用基本概率分配函数计算了证据的总体信息熵,度量了决策表的不确定性;以该度量作为启发信息,给出了决策表的启发式知识约简算法.计算实例表明了本文方法的有效性.     

基于区间直觉模糊集的目标优先级求解方法

针对复杂防空作战环境下多目标优先级难以准确评估的问题,提出了基于区间直觉模糊集理论的目标优先级求解算法。首先系统分析了影响目标优先级的因素以及各影响因素与目标优先级之间的非线性关系。其次,对区间直觉模糊集的得分函数和精确函数进行了改进,考虑了犹豫度信息对决策结果的影响,并且提出了基于得分函数和精确函数的目标优先级求解算法。最后通过仿真算例验证了算法的有效性。     

集对分析和LS-SVM相结合的装备研制风险综合评价法

为有效降低或规避武器装备研制风险,确保装备研制项目的顺利推进,提出一种基于集对分析理论与最小二乘支持向量机方法的装备研制风险综合评价方法。根据武器装备研制特点,建立装备研制风险评价指标体系。在此基础上,引入集对分析理论中的联系度和集对概念构建训练样本和测试样本。利用样本对最小二乘支持向量机进行训练测试,得到装备研制风险的评价模型,并给出评价结果。案例分析表明,所提方法过程简便,定性定量结合,形式易于理解,评价结果也更加贴近实际,对于提升装备研制项目风险管理和决策水平,具有重要的实际意义。     

Parallel machine scheduling with batch deliveries to minimize total flow time and delivery cost

Motivated by the flow of products in the iron and steel industry, we study an identical and parallel machine scheduling problem with batch deliveries, where jobs finished on the parallel machines are delivered to customers in batches. Each delivery batch has a capacity and incurs a cost. The objective is to find a coordinated production and delivery schedule that minimizes the total flow time of jobs plus the total delivery cost. This problem is an extension of the problem considered by Hall and Potts, Ann Oper Res 135 (2005) 41–64, who studied a two‐machine problem with an unbounded number of transporters and unbounded delivery capacity. We first provide a dynamic programming algorithm to solve a special case with a given job assignment to the machines. A heuristic algorithm is then presented for the general problem, and its worst‐case performance ratio is analyzed. The computational results show that the heuristic algorithm can generate near‐optimal solutions. Finally, we offer a fully polynomial‐time approximation scheme for a fixed number of machines. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 492–502, 2016     

Minimal LST representations of MAP(n)s: Moment fittings and queueing approximations

A Markovian arrival process of order n, MAP(n), is typically described by two n × n transition rate matrices in terms of rate parameters. While it is straightforward and intuitive, the Markovian representation is redundant since the minimal number of parameters is n² for non‐redundant MAP(n). It is well known that the redundancy complicates exact moment fittings. In this article, we present a minimal and unique Laplace‐Stieltjes transform (LST) representations for MAP(n)s. Even though the LST coefficients vector itself is not a minimal representation, we show that the joint LST of stationary intervals can be represented with the minimum number of parameters. We also propose another minimal representation for MAP(3)s based on coefficients of the characteristic polynomial equations of the two transition rate matrices. An exact moment fitting procedure is presented for MAP(3)s based on two proposed minimal representations. We also discuss how MAP(3)/G/1 departure process can be approximated as a MAP(3). A simple tandem queueing network example is presented to show that the MAP(3) performs better than the MAP(2) in queueing approximations especially under moderate traffic intensities. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 549–561, 2016     

Convolutions and generalization of logconcavity: Implications and applications

Additive convolution of unimodal and α‐unimodal random variables are known as an old classic problem which has attracted the attention of many authors in theory and applied fields. Another type of convolution, called multiplicative convolution, is rather younger. In this article, we first focus on this newer concept and obtain several useful results in which the most important ones is that if is logconcave then so are and for some suitable increasing functions ?. This result contains and as two more important special cases. Furthermore, one table including more applied distributions comparing logconcavity of f(x) and and two comprehensive implications charts are provided. Then, these fundamental results are applied to aging properties, existence of moments and several kinds of ordered random variables. Multiplicative strong unimodality in the discrete case is also introduced and its properties are investigated. In the second part of the article, some refinements are made for additive convolutions. A remaining open problem is completed and a conjecture concerning convolution of discrete α‐unimodal distributions is settled. Then, we shall show that an existing result regarding convolution of symmetric discrete unimodal distributions is not correct and an easy alternative proof is presented. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 109–123, 2016     

发射波束域MIMO-STAP雷达发射接收联合设计方法

研究了信号相关杂波背景下机载多输入多输出(multiple-input multiple-output,MIMO)雷达发射波束形成和接收滤波器的联合设计问题,建立了机载MIMO雷达发射波束域空时自适应处理(space-time adaptive processing, STAP)信号模型。为了提升杂波环境下目标的检测性能,通过最大化输出信干噪比构建了发射波束形成和接收滤波器的联合设计问题;然后,设计了一种新的基于优化最小化(majorization-minimization,MM)框架的迭代优化算法来解决联合设计问题。该算法通过合理寻找目标函数的下界可以有效提升算法的收敛速度并降低算法的运行时间。此外,与传统的相控阵雷达和MIMO雷达相比,优化后的发射波束形成和接收滤波器可以显著提升输出信干噪比,仿真实验验证了所提方法的有效性。     

Potential impact of recharging plug‐in hybrid electric vehicles on locational marginal prices

Plug‐in hybrid electric vehicles (PHEVs), upon market penetration, will create additional recharging loads to the electric power systems. This article considers different recharging scenarios and uses game theoretic models to study the potential impact of the recharging loads on locational marginal prices (wholesale electricity prices). Computational results from a Pennsylvania‐New Jersey‐Maryland Interconnection case study show that, under the existing recharging infrastructures, even a small magnitude of load increase caused by PHEV recharging could have a significant undesirable impact on locational marginal prices. The impact could be mitigated to a varying extent by the availability of possible future recharging infrastructures, including realtime pricing recharging meters, battery stations, or vehicle‐to‐grid technology.© 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010