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     

Short‐term capacity allocation problem with tool and setup constraints

We consider a short‐term capacity allocation problem with tool and setup constraints that arises in the context of operational planning in a semiconductor wafer fabrication facility. The problem is that of allocating the available capacity of parallel nonidentical machines to available work‐in‐process (WIP) inventory of operations. Each machine can process a subset of the operations and a tool setup is required on a machine to change processing from one operation to another. Both the number of tools available for an operation and the number of setups that can be performed on a machine during a specified time horizon are limited. We formulate this problem as a degree‐constrained network flow problem on a bipartite graph, show that the problem is NP‐hard, and propose constant factor approximation algorithms. We also develop constructive heuristics and a greedy randomized adaptive search procedure for the problem. Our computational experiments demonstrate that our solution procedures solve the problem efficiently, rendering the use of our algorithms in real environment feasible. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

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

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

水中大肠杆菌检测传感器的稳定性

为了找到传感器稳定性最好时的脉冲周期,对传感器检测系统进行优化,实验研究了传感器检测饮用水中大肠杆菌时,脉冲周期对传感器稳定性的影响。传感器的构成属于三电极系统,采用常规脉冲伏安法进行检测。结果显示:脉冲周期为20,40,80 ms时传感器稳定性较好,基本不会影响检测结果;脉冲周期为100 ms时稳定性很差,对检测结果有较大影响。实验表明,选择合适的脉冲周期,加以硬件和软件补偿,可以使传感器获得较好的稳定性。     

土体泊松比对压入管桩单桩挤土位移场的影响

基于ABAQUS有限元软件,采用主从接触算法模拟桩-土相互作用、修正剑桥模型作为土体本构模型,通过在桩顶施加竖向位移荷载以及合适的网格划分技术建立了较为符合压入管桩压桩实际的有限元模型。利用得到的有限元模型模拟了压入管桩压桩产生的挤土位移场,对不同泊松比时压入管桩单桩挤土位移场进行了对比分析。结果表明:不同泊松比时竖向和水平挤土位移场沿深度方向和径向的分布规律趋于一致;土体泊松比的变化会对压入管桩压桩产生的竖向和水平挤土位移场产生较大影响;泊松比越大,压桩产生的竖向和水平挤土位移越大。     

螺旋形爆炸磁压缩发生器

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

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

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