Index policies for the routing of background jobs

Arriving (generic) jobs may be processed at one of several service stations, but only when no other (dedicated) jobs are waiting there. We consider the problem of how to route these incoming background jobs to make best use of the spare service capacity available at the stations. We develop an approximative approach to Whittle's proposal for restless bandits to obtain an index policy for routing. The indices concerned are increasing and nonlinear in the station workload. A numerical study testifies to the strong performance of the index policies developed. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

Higher‐order Markov chain models for categorical data sequences*

In this paper we study higher‐order Markov chain models for analyzing categorical data sequences. We propose an efficient estimation method for the model parameters. Data sequences such as DNA and sales demand are used to illustrate the predicting power of our proposed models. In particular, we apply the developed higher‐order Markov chain model to the server logs data. The objective here is to model the users' behavior in accessing information and to predict their behavior in the future. Our tests are based on a realistic web log and our model shows an improvement in prediction. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004     

基于TOPSIS的战区高层反导威胁评估

在分析战区高层反导威胁评估特点的基础上,建立了以来袭TBM发射点、预测落点、射程等为核心的战区高层反导威胁评估模型指标体系并进行了相应的量化,然后利用基于熵值权重确定的TOPSIS理论对模型进行求解。通过实例证明所提出的战区高层反导威胁评估模型和算法的有效性,对研究美军的战区高层反导武器系统具有一定的借鉴意义。     

抢险救灾非战争军事行动中应急资源调度网络的优化方法

抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性.     

远程反舰导弹弹道规划研究

以保证远程反舰导弹迅速捕捉目标为出发点,以远程反舰导弹的作战需求为牵引,论述了对远程反舰导弹进行弹道规划的重要意义;从战术和技术两个方面探索了对远程反舰导弹进行弹道规划的主要依据、基本原则、规划思路和基本方法。     

Optimal service and arrival rates in Jackson queueing networks

In this paper we present an algorithm for solving a class of queueing network design problems. Specifically, we focus on determining both service and arrival rates in an open Jackson network of queueing stations. This class of problems has been widely studied and used in a variety of applications, but not well solved due to the difficulty of the resulting optimization problems. As an example, consider the classic application in computer network design which involves determining the minimum cost line capacities and flow assignments while satisfying a queueing performance measure such as an upper limit on transmission delay. Other application areas requiring the selection of both service and arrival rates in a network of queues include the design of communication, manufacturing, and health care systems. These applications yield optimization problems that are difficult to solve because typically they are nonconvex, which means they may have many locally optimal solutions that are not necessarily globally optimal. Therefore, to obtain a globally optimal solution, we develop an efficient branch and bound algorithm that takes advantage of the problem structure. Computational testing on randomly generated problems and actual problems from a health care organization indicate that the algorithm is able to solve realistic sized problems in reasonable computing time on a laptop computer. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 1–17, 2000     

面向Agent的海军军械勤务辅助支持系统的逻辑构建

结合分布式人工智能中的Agent技术和军械勤务辅助支持系统的特点 ,研究了面向A gent的军械勤务辅助支持结构。结合该系统介绍了Agent和多Agent系统的概念 ,讨论了A gent的通信机制     

Scheduling to minimize the total compression and late costs

We consider a single-machine scheduling model in which the job processing times are controllable variables with linear costs. The objective is to minimize the sum of the cost incurred in compressing job processing times and the cost associated with the number of late jobs. The problem is shown to be NP-hard even when the due dates of all jobs are identical. We present a dynamic programming solution algorithm and a fully polynomial approximation scheme for the problem. Several efficient heuristics are proposed for solving the problem. Computational experiments demonstrate that the heuristics are capable of producing near-optimal solutions quickly. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 67–82, 1998     

非磁性建筑物空间磁场预测技术

提出了一种预测非磁性建筑物空间磁场分布的新技术.基于等效宏观磁导率和磁化率的概念,利用静磁场积分方程法的正演计算和反演计算技术,找出了试验模块磁场测量值与非磁性建筑物空间整体磁场之间的关系.通过试验模块测量和数学模型仿真相结合的手段,达到了预测低磁钢筋混凝土结构非磁性建筑物空间磁场分布的目的.     

Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost

We consider a make‐to‐order production–distribution system with one supplier and one or more customers. A set of orders with due dates needs to be processed by the supplier and delivered to the customers upon completion. The supplier can process one order at a time without preemption. Each customer is at a distinct location and only orders from the same customer can be batched together for delivery. Each delivery shipment has a capacity limit and incurs a distribution cost. The problem is to find a joint schedule of order processing at the supplier and order delivery from the supplier to the customers that optimizes an objective function involving the maximum delivery tardiness and the total distribution cost. We first study the solvability of various cases of the problem by either providing an efficient algorithm or proving the intractability of the problem. We then develop a fast heuristic for the general problem. We show that the heuristic is asymptotically optimal as the number of orders goes to infinity. We also evaluate the performance of the heuristic computationally by using lower bounds obtained by a column generation approach. Our results indicate that the heuristic is capable of generating near optimal solutions quickly. Finally, we study the value of production–distribution integration by comparing our integrated approach with two sequential approaches where scheduling decisions for order processing are made first, followed by order delivery decisions, with no or only partial integration of the two decisions. We show that in many cases, the integrated approach performs significantly better than the sequential approaches. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005