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     

New heuristic methods for the capacitated multi‐facility Weber problem

In this paper we consider the capacitated multi‐facility Weber problem with the Euclidean, squared Euclidean, and ?_p‐distances. This problem is concerned with locating m capacitated facilities in the Euclidean plane to satisfy the demand of n customers with the minimum total transportation cost. The demand and location of each customer are known a priori and the transportation cost between customers and facilities is proportional to the distance between them. We first present a mixed integer linear programming approximation of the problem. We then propose new heuristic solution methods based on this approximation. Computational results on benchmark instances indicate that the new methods are both accurate and efficient. © 2006 Wiley Periodicals, Inc. Naval Research Logistics 2006     

Power series expansions for the distribution and mean value function of a geometric process with Weibull interarrival times

The geometric process is considered when the distribution of the first interarrival time is assumed to be Weibull. Its one‐dimensional probability distribution is derived as a power series expansion of the convolution of the Weibull distributions. Further, the mean value function is expanded into a power series using an integral equation. © 2014 Wiley Periodicals, Inc. Naval Research Logistics, 61: 599–603, 2014     

Robustness of efficient server assignment policies to service time distributions in finite‐buffered lines

We study the assignment of flexible servers to stations in tandem lines with service times that are not necessarily exponentially distributed. Our goal is to achieve optimal or near‐optimal throughput. For systems with infinite buffers, it is already known that the effective assignment of flexible servers is robust to the service time distributions. We provide analytical results for small systems and numerical results for larger systems that support the same conclusion for tandem lines with finite buffers. In the process, we propose server assignment heuristics that perform well for systems with different service time distributions. Our research suggests that policies known to be optimal or near‐optimal for Markovian systems are also likely to be effective when used to assign servers to tasks in non‐Markovian systems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Replicated batch means for steady‐state simulations

This paper studies a new steady‐state simulation output analysis method called replicated batch means in which a small number of replications are conducted and the observations in these replications are grouped into batches. This paper also introduces and compares methods for selecting the initial state of each replication. More specifically, we show that confidence intervals constructed by the replicated batch means method are valid for large batch sizes and derive expressions for the expected values and variances of the steady‐state mean and variance estimators for stationary processes and large sample sizes. We then use these expressions, analytical examples, and numerical experiments to compare the replicated batch means method with the standard batch means and multiple replications methods. The numerical results, which are obtained from an AR(1) process and a small, nearly‐decomposable Markov chain, show that the multiple replications method often gives confidence intervals with poorer coverage than the standard and replicated batch means methods and that the replicated batch means method, implemented with good choices of initialization method and number of replications, provides confidence interval coverages that range from being comparable with to being noticeably better than coverages obtained by the standard batch means method. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

Identifying the spoilers in the security sector reform – disarmament demobilisation and reintegration process in the Congo

The Congolese security sector reform – disarmament demobilisation and reintegration (SSR-DDR) process has suffered from setbacks in its military sector during the last 10 years, such as insufficient funding, lack of coordination and domestic reluctance to major changes, with as a result, a very fragile and disjointed Army. These problems have deepened as officers have defected from the Army and caused new instability in the East of the Congo. This article aims to analyse the recent mutinies and the reaction by the Congolese government by applying a capabilities-based approach in combination with a typology of spoilers. The objective is to identify and classify the spoilers and answer the questions of why they emerge now and how they are dealt with on a national level. From the analysis, the author suggests that there are several spoilers involved in the current situation – the most powerful being the Congolese and the Rwandan governments, prompting the question of whether an international involvement is necessary to solve the problem.     

一种基于层次分析法的舰炮武器系统选型综合评价模型

针对舰炮武器系统选型配置决策中众多制约因素难以平衡兼顾的难题,本文基于层次分析法,综合了作战效能、全寿命周期费用、研制周期、适装性、技术可行性和发展潜力等多变量因素,提出并建立了一套综合优化舰炮武器系统选型配置方案的方法和模型,实现了舰炮武器系统选型配置问题的优化决策,最后以大口径主炮武器系统发展选型为例,给出了模型的应用实例。     

螺旋形爆炸磁压缩发生器

为了得到高电压的输出,从爆炸磁通量压缩发生器的工作原理入手,在单端起爆装置的基础上,设计了一种两端起爆的螺旋形爆磁发生器,并给出了实验结果和分析。     

四种螺线管型爆磁压缩发生器的实验研究

实验研究了四种螺线管型爆磁压缩发生器,给出了其主要实验结果和结论。     

Ambulance location for maximum survival

This article proposes new location models for emergency medical service stations. The models are generated by incorporating a survival function into existing covering models. A survival function is a monotonically decreasing function of the response time of an emergency medical service (EMS) vehicle to a patient that returns the probability of survival for the patient. The survival function allows for the calculation of tangible outcome measures—the expected number of survivors in case of cardiac arrests. The survival‐maximizing location models are better suited for EMS location than the covering models which do not adequately differentiate between consequences of different response times. We demonstrate empirically the superiority of the survival‐maximizing models using data from the Edmonton EMS system. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2008