军事物流的若干问题刍议

针对军事物流的特点,本文分析了军事物流中物资储备、仓储管理和技术革新等存在的问题,并提出了相应的发展对策。     

车辆悬挂系统扭杆弹簧疲劳寿命的统计分析

本文对车辆悬挂系统扭杆弹簧的寿命作了统计分析,得到服从形状参数m=1.5～2.0的威布尔分布.论证了把可靠度R(t)=0.9的工作寿命作为规范中所规定的额定寿命值的合理性,同时对影响其寿命的若干因素进行了讨论.     

MPP Fortran 程序中串行循环的优化

在大规模并行处理系统中,通讯开销是影响程序性能的一个重要因素。本文提出了一种ＭＰＰＦｏｒｔｒａｎ程序中串行循环的优化技术：在串行循环中加入同步控制、将串行循环转换成共享循环。该技术能减少通讯开销、提高程序的性能。     

五参数寿命分布S(α,β,λ,μ,δ)

在四参数寿命分布的基础上增加了一个非中心参数,进而提出五参数寿命分布S(α,β,λ,μ,δ),并给出了定义、基本性质及其证明。     

多自由度系统及结构非线性自由振动的摄动谐波平衡法

本文在谐波平衡法的基础上,引入摄动的思想,得出了解多自由度系统及结构的非线性自由振动的新方法。其解的形式为小参数和谐波的级数形式,因此,其解不会遗漏任何项,方程为线性的代数方程;利用线性变换,将系数矩阵变换为对角阵,一旦求出线性模态,就可得其解,比线性化迭代法优越得多。算例表明,本文方法对于小振幅有较高的精度,对于较大振幅其结果也是令人满意的。     

对数正态分布加速因子的Bayes估计

基于对数正态分布形式以及分布对数标准差不变的条件,运用Bayes方法对对数正态分布加速寿命试验条件下的加速因子进行分析。首先基于全寿命试验数据和随机变量函数分布的理论推导出加速因子的先验分布;然后由Bayes公式结合少量的现场截尾试验数据,得出加速因子的Bayes估计模型;最后给出实例进行说明。     

谱分析方法在仿真结果分析中的运用

文中给出了谱估计的分析，并将它直接应用于仿真系统输出量的特性分析。对于仿真的可信性问题，讨论了相容性检验方法，特别是小子样现场试验下，仿真与现场试验之间的一致性问题。     

Dynamic server assignment policies for assembly‐type queues with flexible servers

We seek dynamic server assignment policies in finite‐capacity queueing systems with flexible and collaborative servers, which involve an assembly and/or a disassembly operation. The objective is to maximize the steady‐state throughput. We completely characterize the optimal policy for a Markovian system with two servers, two feeder stations, and instantaneous assembly and disassembly operations. This optimal policy allocates one server per station unless one of the stations is blocked, in which case both servers work at the unblocked station. For Markovian systems with three stations and instantaneous assembly and/or disassembly operations, we consider similar policies that move a server away from his/her “primary” station only when that station is blocked or starving. We determine the optimal assignment of each server whose primary station is blocked or starving in systems with three stations and zero buffers, by formulating the problem as a Markov decision process. Using this optimal assignment, we develop heuristic policies for systems with three or more stations and positive buffers, and show by means of a numerical study that these policies provide near‐optimal throughput. Furthermore, our numerical study shows that these policies developed for assembly‐type systems also work well in tandem systems. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

A dual criteria sequencing problem with earliness and tardiness penalties

We consider the problem of sequencing n jobs on a single machine, with each job having a processing time and a common due date. The common due date is assumed to be so large that all jobs can complete by the due date. It is known that there is an O(n log n)‐time algorithm for finding a schedule with minimum total earliness and tardiness. In this article, we consider finding a schedule with dual criteria. The primary goal is to minimize the total earliness and tardiness. The secondary goals are to minimize: (1) the maximum earliness and tardiness; (2) the sum of the maximum of the squares of earliness and tardiness; (3) the sum of the squares of earliness and tardiness. For the first two criteria, we show that the problems are NP‐hard and we give a fully polynomial time approximation scheme for both of them. For the last two criteria, we show that the ratio of the worst schedule versus the best schedule is no more than . © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 422–431, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10020     

Dynamic pricing under first order Markovian competition

We evaluate the effect of competition on prices, profits, and consumers' surplus in multiperiod, finite horizon, dynamic pricing settings. In our base model, a single myopic consumer visits two competing retailers, who offer identical goods, in a (first order Markovian) probabilistic fashion—if the posted price exceeds the consumer's valuation for the good, he returns to the same store in the following period with a certain probability. We find that even a small reduction in the return probability from one—which corresponds to the monopoly case at which prices decline linearly—is sufficient to revert the price decline from a linear into an exponential shape. Each retailer's profit is particularly sensitive to changes in his return probability when it is relatively high, and is maximized under complete loyalty behavior (i.e., return probability is one). On the other hand, consumer surplus is maximized under complete switching behavior (i.e., return probability is zero). In the presence of many similar consumers, the insights remain valid. We further focus on the extreme scenario where all consumers follow a complete switching behavior, to derive sharp bounds, and also consider the instance where, in this setting, myopic consumers are replaced with strategic consumers. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011