Dynamic service rate control for a single‐server queue with Markov‐modulated arrivals

We consider the problem of service rate control of a single‐server queueing system with a finite‐state Markov‐modulated Poisson arrival process. We show that the optimal service rate is nondecreasing in the number of customers in the system; higher congestion levels warrant higher service rates. On the contrary, however, we show that the optimal service rate is not necessarily monotone in the current arrival rate. If the modulating process satisfies a stochastic monotonicity property, the monotonicity is recovered. We examine several heuristics and show where heuristics are reasonable substitutes for the optimal control. None of the heuristics perform well in all the regimes and the fluctuation rate of the modulating process plays an important role in deciding the right heuristic. Second, we discuss when the Markov‐modulated Poisson process with service rate control can act as a heuristic itself to approximate the control of a system with a periodic nonhomogeneous Poisson arrival process. Not only is the current model of interest in the control of Internet or mobile networks with bursty traffic, but it is also useful in providing a tractable alternative for the control of service centers with nonstationary arrival rates. © 2013 Wiley Periodicals, Inc. Naval Research Logistics 60: 661–677, 2013     

基于方位特征序列的地雷鉴别算法

在使用低频超宽带合成孔径雷达(UWB-SAR)对地雷进行探测的过程中,根据目标电磁散射随方位角和入射角的变化特性,提出一种利用双峰间距和频率凹点特征沿方位向变化的隐马尔科夫模型(HMM)鉴别算法。该算法首先针对目标感兴趣区域(ROI)图像估计其各方位回波响应,然后利用时频原子提取时域双峰间距和频率凹点,进而得到随方位角变化的特征序列,再通过SAR工作时方位角和入射角的变化特点以及训练样本确定HMM参数,并在此基础上计算疑似目标新的特征矢量,采用马氏距离进行判别。实验结果表明了本文所提方法在目标鉴别方面的有效性。     

Integrated production scheduling and preventive maintenance planning for a single machine under a cumulative damage failure process

This paper finds the optimal integrated production schedule and preventive maintenance plan for a single machine exposed under a cumulative damage process, and investigates how the optimal preventive maintenance plan interacts with the optimal production schedule. The goal is to minimize the total tardiness. The optimal policy possesses the following properties: Under arbitrary maintenance plan when jobs have common processing time, and different due dates, the optimal production schedule is to order the jobs by earliest due date first rule; and when jobs have common due date and different processing times, the optimal production schedule is shortest processing time first. The optimal maintenance plan is of control limit type under any arbitrary production schedule when machine is exposed under a cumulative damage failure process. Numerical studies on the optimal maintenance control limit of the maintenance plan indicate that as the number of jobs to be scheduled increases, the effect of jobs due dates on the optimal maintenance control limit diminishes. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

A note on the forecast performance of temporal aggregation

Earlier research on the effects of nonoverlapping temporal aggregation on demand forecasting showed the benefits associated with such an approach under a stationary AR(1) or MA(1) processes for decision making conducted at the disaggregate level. The first objective of this note is to extend those important results by considering a more general underlying demand process. The second objective is to assess the conditions under which aggregation may be a preferable approach for improving decision making at the aggregate level as well. We confirm the validity of previous results under more general conditions, and we show the increased benefit resulting from forecasting by temporal aggregation at lower frequency time units. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 489–500, 2014     

基于MCMC方法的Lorenz混沌系统的参数估计

基于贝叶斯理论,提出用马尔科夫链蒙特卡罗(MCMC)方法来估计Lorenz混沌系统的未知参数。首先导出了未知参数分布规律的后验概率密度函数;接着采用自适应Metropolis算法构造Markov链;然后截取收敛的链序列,计算混沌系统参数的估计值。数值试验表明:该方法具有很高的估计精度,同时具有较好的抗噪声性能。     

经马氏修正的Poisson过程的极大似然估计

近年来 ,隐马氏模型成为研究相依随机变量的一个十分有用的工具。实际应用过程中的一个很重要的问题是如何对隐马氏模型的参数进行估计。将一类连续时间隐马氏模型的问题转化为离散时间隐马氏模型的问题 ,给出了具体的隐马氏模型———经马氏修正的Poisson过程的极大似然估计及其算法。此类过程被广泛用来对复杂电信网络的交通流进行建模     

军事物流配送中心作业流程建模与仿真

军事物流配送中心是军事物流的重要组成部分,加强军事物流配送中心的作业研究对于提高我军后勤保障能力有着重要的现实意义。根据军事物流配送中心的作业特点,分析了军事物流配送中心作业流程,建立了相应的作业过程仿真模型,并用Flex-sim仿真软件对军事物流配送中心作业流程进行了仿真。通过仿真结果分析,找出了作业流程中的瓶颈,为配送中心资源和流程的改进提供了依据。     

Modeling and analysis of flexible queueing systems

We consider queueing systems with multiple classes of customers and heterogeneous servers where customers have the flexibility of being processed by more than one server and servers possess the capability of processing more than one customer class. We provide a unified framework for the modeling and analysis of these systems under arbitrary customer and server flexibility and for a rich set of control policies that includes customer/server‐specific priority schemes for server and customer selection. We use our models to generate several insights into the effect of system configuration and control policies. In particular, we examine the relationship between flexibility, control policies and throughput under varying assumptions for system parameters. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Double Mover–Stayer model on customer switching in telecommunications industry

Customer acquisition and customer retention are the most important challenges in the increasingly competitive telecommunications industry. Traditional studies of customer switching always assume that customers are homogeneous, and thus that model customer switching behavior follows a Markov formulation. However, this postulation is obviously inappropriate in most instances. Blumen et al. (Cornell Studies of Industrial and Labor Relations, Cornell University Press, Ithaca, NY, 1955) developed the Mover–Stayer (MS) model, a generalization of the Markov chain model, to relax the requirement of homogeneity and allow the presence of heterogeneity with two different types of individuals—“stayers,” who purchase the same kinds of products or services throughout the entire observation period; and “movers,” who look for variety in products or services over time. There are two purpose of this article. First, we extend the MS model to a Double Mover‐Stayer (DMS) model by assuming the existence of three types of individuals in the market: (1) stable and loyal customers, who have stable usage within the same company; (2) instable but loyal customers, whose usage varies within the same company over time; and (3) disloyal customers, who switch from one company to another to seek for new experiences or/and benefits. We also propose an estimation method for the DMS model. Second, we apply the DMS model to telecommunications data and demonstrate how it can be used for pattern identification, hidden knowledge discovery, and decision making. © 2012 Wiley Periodicals, Inc. Naval Research Logistics, 2012     

Approximations and empirics for stochastic war equations

The article develops a theorem which shows that the Lanchester linear war equations are not in general equal to the Kolmogorov linear war equations. The latter are time‐consuming to solve, and speed is important when a large number of simulations must be run to examine a large parameter space. Run times are provided, where time is a scarce factor in warfare. Four time efficient approximations are presented in the form of ordinary differential equations for the expected sizes and variances of each group, and the covariance, accounting for reinforcement and withdrawal of forces. The approximations are compared with “exact” Monte Carlo simulations and empirics from the WWII Ardennes campaign. The band spanned out by plus versus minus the incremented standard deviations captures some of the scatter in the empirics, but not all. With stochastically varying combat effectiveness coefficients, a substantial part of the scatter in the empirics is contained. The model is used to forecast possible futures. The implications of increasing the combat effectiveness coefficient governing the size of the Allied force, and injecting reinforcement to the German force during the Campaign, are evaluated, with variance assessments. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.