Free riding in a multi‐channel supply chain

Free riding in a multichannel supply chain occurs when one retail channel engages in the customer service activities necessary to sell a product, while another channel benefits from those activities by making the final sale. Although free riding is, in general, considered to have a negative impact on supply chain performance, certain recent industry practices suggest an opposite view: a manufacturer may purposely induce free riding by setting up a high‐cost, customer service‐oriented direct store to allow consumers to experience the product, anticipating their purchase at a retail store. This article examines how the free riding phenomenon affects a manufacturer's supply chain structure decision when there are fixed plus incremental variable costs for operating the direct store. We consider factors such as the effort required to find and buy the product at a retail store after visiting the direct store, the existence of competing products in the market, and the extent of consumer need to obtain direct‐store service. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Two‐machine flow shop scheduling with common due window to minimize weighted number of early and tardy jobs

This article studies two due window scheduling problems to minimize the weighted number of early and tardy jobs in a two‐machine flow shop, where the window size is externally determined. These new scheduling models have many practical applications in real life. However, results on these problems have rarely appeared in the literature because of a lack of structural and optimality properties for solving them. In this article, we derive several dominance properties and theorems, including elimination rules and sequencing rules based on Johnsos order, lower bounds on the penalty, and upper bounds on the window location, which help to significantly trim the search space for the problems. We further show that the problems are NP‐hard in the ordinary sense only. We finally develop efficient pseudopolynomial dynamic programming algorithms for solving the problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

Approximation algorithms for general one‐warehouse multi‐retailer systems

Logistical planning problems are complicated in practice because planners have to deal with the challenges of demand planning and supply replenishment, while taking into account the issues of (i) inventory perishability and storage charges, (ii) management of backlog and/or lost sales, and (iii) cost saving opportunities due to economies of scale in order replenishment and transportation. It is therefore not surprising that many logistical planning problems are computationally difficult, and finding a good solution to these problems necessitates the development of many ad hoc algorithmic procedures to address various features of the planning problems. In this article, we identify simple conditions and structural properties associated with these logistical planning problems in which the warehouse is managed as a cross‐docking facility. Despite the nonlinear cost structures in the problems, we show that a solution that is within ε‐optimality can be obtained by solving a related piece‐wise linear concave cost multi‐commodity network flow problem. An immediate consequence of this result is that certain classes of logistical planning problems can be approximated by a factor of (1 + ε) in polynomial time. This significantly improves upon the results found in literature for these classes of problems. We also show that the piece‐wise linear concave cost network flow problem can be approximated to within a logarithmic factor via a large scale linear programming relaxation. We use polymatroidal constraints to capture the piece‐wise concavity feature of the cost functions. This gives rise to a unified and generic LP‐based approach for a large class of complicated logistical planning problems. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009     

C~4ISR系统军事需求模型并行开发与一致性检验

介绍了C4ISR系统军事需求模型的概念、特点及其开发的并行性,并根据我军联合作战指挥信息系统的需求开发实践需要,针对C4ISR系统军事需求模型的模块划分以及分组建模过程进行分析,在此基础上给出了一个C4ISR系统军事需求模型并行开发过程的参考模型,并探讨了并行开发过程在系统需求周期内的一致性检验问题,包括了需求模型的语法、语义和语用一致性检验的过程和方法.     

状态空间表达下控制系统的稳态误差

经典控制理论对系统稳态误差的讨论从传递函数入手,重点是对系统开环传递函数的研究,当系统的输入是任意函数时,引入动态误差系数方法来研究稳态误差,但是当输入具有高阶导数时,动态误差系数将很难得到.现代控制理论中的状态空间表达下求系统的稳态误差很好地解决了这个问题.利用矩阵之间的运算来表示动态误差系数,并且可以得到任意输入下的稳态误差值,在线性定常系统下的推导结果还可以适用于线性时变系统,具有一定的普遍性.     

PD体制地面情报雷达相关问题研究

中脉冲重复频率的PD体制对于杂波的抑制能力较强,一般应用于机载雷达.目前,地面对空情报雷达为更有效地检测低空目标以及小目标,也采用了PD体制.在分析了杂波重叠和PRF组限制的基础上,对比了M/N准则、检测概率以及盲区图,讨论了采用3/7准则的优越性,该结论对于PD体制雷达的研制和改装有实际的应用价值.     

指挥坦克指控系统仿真

根据主战坦克指控系统的使用情况,建立了一个指挥坦克仿真指控系统模型.对运行环境生成、指控网络接口、指挥决心推理、指挥语言编译等方面进行了建模、算法的研究,"高聚合,低耦合"地集成了多个功能子模块,为新型主战坦克的作战仿真研究提供了参考.     

提升当代革命军人核心价值观培育的针对性思想性科学性

进一步增强当代革命军人核心价值观培育的效果,要着眼增强培育工作的针对性,努力实现从自发到自觉的转变;着眼增强培育工作的思想性,努力实现从感性到理性的升华;着眼增强培育工作的科学性,努力实现从零碎到系统的集成.     

某型子母弹子弹稳定带参数筛选技术分析

本文以某型子母弹子弹研制过程中遇到的问题为背景,分析了子母弹子弹稳定带对子弹落姿和可靠性影响,通过机理分析和试验验证得出了稳定带参数优化调整方案,对相关产品优化设计及技术改进有一定借鉴意义。     

基于ELECTRE方法的模糊多属性决策

针对传统ELECTRE法的弱点,将ELECTRE法拓展到了模糊环境下,得到一种解决模糊多属性决策问题的新方法,决策评估中涉及到的属性值与属性权重值等模糊信息以三角模糊数形式给出。首先集结决策者对各方案属性的评价,确定出模糊决策矩阵;其次根据信息熵原理,求解出三角模糊数型的属性权重向量;最后给出新的模糊ELECTRE方法的决策步骤。新方法既具有统一的表达形式,又克服了传统方法中和谐性与不和谐性之间具有一定相关性的缺陷。新方法计算简单,给出的实例验证了此方法的可行性和有效性。