Assessing the value of demand sharing in supply chains

We consider the problem of assessing the value of demand sharing in a multistage supply chain in which the retailer observes stationary autoregressive moving average demand with Gaussian white noise (shocks). Similar to previous research, we assume each supply chain player constructs its best linear forecast of the leadtime demand and uses it to determine the order quantity via a periodic review myopic order‐up‐to policy. We demonstrate how a typical supply chain player can determine the extent of its available information in the presence of demand sharing by studying the properties of the moving average polynomials of adjacent supply chain players. The retailer's demand is driven by the random shocks appearing in the autoregressive moving average representation for its demand. Under the assumptions we will make in this article, to the retailer, knowing the shock information is equivalent to knowing the demand process (assuming that the model parameters are also known). Thus (in the event of sharing) the retailer's demand sequence and shock sequence would contain the same information to the retailer's supplier. We will show that, once we consider the dynamics of demand propagation further up the chain, it may be that a player's demand and shock sequences will contain different levels of information for an upstream player. Hence, we study how a player can determine its available information under demand sharing, and use this information to forecast leadtime demand. We characterize the value of demand sharing for a typical supply chain player. Furthermore, we show conditions under which (i) it is equivalent to no sharing, (ii) it is equivalent to full information shock sharing, and (iii) it is intermediate in value to the two previously described arrangements. Although it follows from existing literature that demand sharing is equivalent to full information shock sharing between a retailer and supplier, we demonstrate and characterize when this result does not generalize to upstream supply chain players. We then show that demand propagates through a supply chain where any player may share nothing, its demand, or its full information shocks (FIS) with an adjacent upstream player as quasi‐ARMA in—quasi‐ARMA out. We also provide a convenient form for the propagation of demand in a supply chain that will lend itself to future research applications. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 515–531, 2014     

Constructing a strict total order for alternatives characterized by multiple criteria: An extension

The problem of finding a strict total order for a finite set of multiple criteria alternatives is considered. Our research extends previous work by us, which considered finding a partial order for a finite set of alternatives. We merge the preference information extracted from the preference cones and corresponding polyhedral sets, with the information derived from pairwise comparisons of two alternatives, yielding a preference matrix. This preference matrix is used as input to an integer programming model to obtain a strict total order that provides a transitive ranking for the set of alternatives. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 155–163, 2014     

Landau相变中的自由能

Landau用序参量的幂级数展开来表示相变温度附近的自由能,强调对称性与序参量在相变中的作用.正确书写自由能形式,可以计算可能相的温度曲线,得到关于序参量的方程,从而推知系统的结构.     

阶比谱分析与汽车起动电机故障的实时诊断

本文主要论述阶比谱分析方法及其在汽车起动电机故障实时诊断中的应用。首先阐述了阶比谱分析的原理以及阶比采样中混迭与泄漏的产生及其抑制方法,然后讨论了如何在起动电机运行过程短、升速快的情况下获取感兴趣的噪声信号,进而采用阶比谱分析方法从信号中提取故障特征信息,最后利用阀值判别法起动电机的故障进行实时诊断。     

论治安行政指导的性质及表现形式

从治安行政法律关系、治安行政指导依据分析探讨治安行政指导的性质,从治安行政性、治安性、主动性、方式多样性等方面探讨治安行政指导特征,并对其表现形式等理论问题进行研究,有利于治安行政指导基本问题的研究。     

Commitment decisions with partial information updating

In this paper, we extend the results of Ferguson M. Naval Research Logistics 8 . on an end‐product manufacturer's choice of when to commit to an order quantity from its parts supplier. During the supplier's lead‐time, information arrives about end‐product demand. This information reduces some of the forecast uncertainty. While the supplier must choose its production quantity of parts based on the original forecast, the manufacturer can wait to place its order from the supplier after observing the information update. We find that a manufacturer is sometimes better off with a contract requiring an early commitment to its order quantity, before the supplier commits resources. On the other hand, the supplier sometimes prefers a delayed commitment. The preferences depend upon the amount of demand uncertainty resolved by the information as well as which member of the supply chain sets the exchange price. We also show conditions where demand information updating is detrimental to both the manufacturer and the supplier. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

基于二阶锥规划的MIMO雷达稳健自适应波束形成

针对MIMO雷达自适应波束形成中期望目标导向矢量的失配问题,提出了一种基于二阶锥规划(SOCP)的稳健自适应波束形成算法。该算法首先将1个MN维(M,N分别为发射和接收阵元数)的权矢量分解成2个低维(1个M维和1个N维)权矢量的Kronecker积,然后分别限制实际的目标发射导向矢量和目标接收导向矢量与假定的导向矢量之间的误差范数的边界,通过优化最差性能,利用SOCP求得分解后的2个权矢量,最后再合成原权矢量。通过降维处理,算法在保证波束形成器性能的基础上,有效地降低了运算复杂度。仿真结果验证了算法的有效性。     

舰艇自防御的威胁排序方法研究

威胁评估与排序是舰艇自防御系统必须具备的重要功能。在多指标决策理论的基础上,结合灰色系统理论和逼近理想解方法,提出了灰色逼近理想解的威胁排序算法。首先通过建立舰艇自防御的空中威胁排序指标体系,得到各个指标的隶属度函数,再通过主客观结合的有序二元比较法得到威胁评估指标的权重,最后通过逼近理想解的灰色关联度方法对空中目标进行威胁评估与排序,并研究了分辨系数对威胁排序的影响。通过舰艇自防御防空作战实例证明了算法的有效性和工程实用性。     

基于实值离散Gabor变换的阶比跟踪滤波

提出了基于实值离散Gabor变换的阶比跟踪滤波方法．分析了阶比跟踪滤波为时频滤波的实质,给出了如何通过实值离散Gabor变换实现阶比跟踪滤波的步骤．通过对仿真信号阶比跟踪滤波前后的时频分布、阶比谱和时域信号对比,证实本方法能有效滤除阶比混叠成分．通过延长信号两端采样长度的方法可以消除阶比跟踪滤波后端点的误差．     

Selecting T for a periodic review inventory model with staggered deliveries

Consider a single‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. Orders can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T periods, one audits the current stock level and decides on deliveries for the next T periods, thus incurring a fixed audit cost and—when one schedules deliveries—a fixed order cost. The problem is to find a review period T and an ordering policy that satisfy the average cost criterion. The current article extends an earlier treatment of this problem, which assumed that the fixed order cost is automatically incurred once every T periods. We characterize an optimal ordering policy when T is fixed, prove that an optimal review period T** exists, and develop a global search algorithm for its computation. We also study the behavior of four approximations to T** based on the assumption that the fixed order cost is incurred during every cycle. Analytic results from a companion article (where μ/σ is large) and extensive computational experiments with normal and gamma demand test problems suggest these approximations and associated heuristic policies perform well when μ/σ ≥ 2. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 329–352, 2000