A note on optimal pricing for finite capacity queueing systems with multiple customer classes

This article investigates optimal static prices for a finite capacity queueing system serving customers from different classes. We first show that the original multi‐class formulation in which the price for each class is a decision variable can be reformulated as a single dimensional problem with the total load as the decision variable. Using this alternative formulation, we prove an upper bound for the optimal arrival rates for a fairly large class of queueing systems and provide sufficient conditions that ensure the existence of a unique optimal arrival rate vector. We show that these conditions hold for M/M/1/m and M/G/s/s systems and prove structural results on the relationships between the optimal arrival rates and system capacity. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

连续波DF/HF化学激光器喷管中氟原子复合计算

氟原子是连续波DF/HF化学激光器泵浦反应的重要参与者,其浓度分布尤其直接影响冷反应型激光器的泵浦效率及激射强度.在参与反应之前,氟原子将受到三体复合和壁面复合因素的影响而部分复合为氟分子.研究该因素对氟原子浓度的影响对激光器的分析优化是十分重要的.已有一定的实验方法可对其浓度进行测量研究,并建立了理论模型描述.将其与计算流体力学方法相结合对氟原子分布进行计算,研究了该方法的有效性,并对不同收缩段型面下氟原子复合进行了计算研究.     

基于先验信息的分布式星载单基线SAR/ATI方法

在综述了分布式星载SAP/ATI技术的基础上,阐述了单基线SAP/ATI技术的原理和杂波、噪声对检测、测速性能的影响,给出了一种基于先验信息的单基线SAR/ATI检测和测速方法,最后基于多功能的天基雷达仿真系统进行了仿真实验和性能分析.     

空军武器装备体系作战效能分析

根据空军“攻防兼备”的作战要求 ,将空军的武器装备分为作战力量装备和保障力量装备 ,并按进攻和防守两种主要的作战样式对空军的武器装备体系进行了作战效能分析 ,探讨了分析空军武器装备体系作战效能的方法和思路 ,为建立空军武器装备体系作战效能评估仿真系统提供了基础。     

防空通信系统效能评估

防空通信系统是保障防空指挥和控制有效性的重要手段,其效能的好坏将直接影响到作战结果.在分析效能评估方法的基础上,根据防空通信系统的特点,建立了防空通信系统综合评估指标体系.对防空通信系统的效能评估过程进行了描述,给出了效能评估模型和评估方法,并进行了实例分析.对全面而科学地评价防空通信系统的效能具有较强的实用性.     

DS/FH信号跟踪的频率相位修正技术

直序/跳频(direct sequence/frequency hopping, DS/FH)扩频信号的跟踪受到多普勒效应和电离层效应的严重影响,使其难以应用于卫星导航的抗干扰领域。为了解决该问题,提出将递归最小二乘滤波修正的方法应用在DS/FH信号跟踪上。将处于不同通道中心频率的多普勒频率估计转化到DS/FH信号的整体中心频率进行并滤波,在频率捷变时对载波数控振荡器进行修正。根据对频率跳变前后载波相位和码相位突变的观察,实时估计电离层的电子密度,在频率捷变时修正载波相位和码相位。仿真实验证明,所提方法能够有效地消除DS/FH信号跟踪中的频率相位不连续问题,其跟踪精度与直序扩频信号度基本是相同量级。     

Contractual agreements for coordination and vendor‐managed delivery under explicit transportation considerations

We consider the coordination problem between a vendor and a buyer operating under generalized replenishment costs that include fixed costs as well as stepwise freight costs. We study the stochastic demand, single‐period setting where the buyer must decide on the order quantity to satisfy random demand for a single item with a short product life cycle. The full order for the cycle is placed before the cycle begins and no additional orders are accepted by the vendor. Due to the nonrecurring nature of the problem, the vendor's replenishment quantity is determined by the buyer's order quantity. Consequently, by using an appropriate pricing schedule to influence the buyer's ordering behavior, there is an opportunity for the vendor to achieve substantial savings from transportation expenses, which are represented in the generalized replenishment cost function. For the problem of interest, we prove that the vendor's expected profit is not increasing in buyer's order quantity. Therefore, unlike the earlier work in the area, it is not necessarily profitable for the vendor to encourage larger order quantities. Using this nontraditional result, we demonstrate that the concept of economies of scale may or may not work by identifying the cases where the vendor can increase his/her profits either by increasing or decreasing the buyer's order quantity. We prove useful properties of the expected profit functions in the centralized and decentralized models of the problem, and we utilize these properties to develop alternative incentive schemes for win–win solutions. Our analysis allows us to quantify the value of coordination and, hence, to identify additional opportunities for the vendor to improve his/her profits by potentially turning a nonprofitable transaction into a profitable one through the use of an appropriate tariff schedule or a vendor‐managed delivery contract. We demonstrate that financial gain associated with these opportunities is truly tangible under a vendor‐managed delivery arrangement that potentially improves the centralized solution. Although we take the viewpoint of supply chain coordination and our goal is to provide insights about the effect of transportation considerations on the channel coordination objective and contractual agreements, the paper also contributes to the literature by analyzing and developing efficient approaches for solving the centralized problem with stepwise freight costs in the single‐period setting. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

纳米颗粒和非晶相复合刷镀层n-Al2O3／Ni-P的制备

采用纳米电刷镀技术在钢基体表面制备了n-Al2O3/Ni-P复合刷镀层,研究了复合刷镀液中纳米颗粒含量、刷镀电压和刷镀笔移动速度对复合刷镀层中P和Al2O3含量的影响.优化后的工艺参数范围为刷镀液中n-Al2O3颗粒含量20～30 g/L、刷镀电压8～12 V、刷镀笔移动速度5～10 m/min.制备的n-Al2O3/Ni-P复合刷镀层组织致密,含有纳米颗粒和非晶相.     

Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem

We consider a two‐stage supply chain, in which multi‐items are shipped from a manufacturing facility or a central warehouse to a downstream retailer that faces deterministic external demand for each of the items over a finite planning horizon. The items are shipped through identical capacitated vehicles, each incurring a fixed cost per trip. In addition, there exist item‐dependent variable shipping costs and inventory holding costs at the retailer for items stored at the end of the period; these costs are constant over time. The sum of all costs must be minimized while satisfying the external demand without backlogging. In this paper we develop a search algorithm to solve the problem optimally. Our search algorithm, although exponential in the worst case, is very efficient empirically due to new properties of the optimal solution that we found, which allow us to restrict the number of solutions examined. Second, we perform a computational study that compares the empirical running time of our search methods to other available exact solution methods to the problem. Finally, we characterize the conditions under which each of the solution methods is likely to be faster than the others and suggest efficient heuristic solutions that we recommend using when the problem is large in all dimensions. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2006.     

The stochastic joint replenishment problem: A new policy,analysis, and insights

In this study, we propose a new parsimonious policy for the stochastic joint replenishment problem in a single‐location, N‐item setting. The replenishment decisions are based on both group reorder point‐group order quantity and the time since the last decision epoch. We derive the expressions for the key operating characteristics of the inventory system for both unit and compound Poisson demands. In a comprehensive numerical study, we compare the performance of the proposed policy with that of existing ones over a standard test bed. Our numerical results indicate that the proposed policy dominates the existing ones in 100 of 139 instances with comparably significant savings for unit demands. With batch demands, the savings increase as the stochasticity of demand size gets larger. We also observe that it performs well in environments with low demand diversity across items. The inventory system herein also models a two‐echelon setting with a single item, multiple retailers, and cross docking at the upper echelon. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006