Minimizing total completion time in two-processor task systems with prespecified processor allocations

We consider the problem of scheduling multiprocessor tasks with prespecified processor allocations to minimize the total completion time. The complexity of both preemptive and nonpreemptive cases of the two-processor problem are studied. We show that the preemptive case is solvable in O(n log n) time. In the nonpreemptive case, we prove that the problem is NP-hard in the strong sense, which answers an open question mentioned in Hoogeveen, van de Velde, and Veltman (1994). An efficient heuristic is also developed for this case. The relative error of this heuristic is at most 100%. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 231–242, 1998     

多UCAV协同控制中的任务分配模型及算法

任务分配是多UCAV协同控制的核心和有效保证。分析了影响目标价值毁伤、UCAV损耗、任务消耗时间等三项关键战技指标的因素,综合考虑实战中多UCAV同时攻击同一目标和使用软杀伤武器这两种典型情况对UCAV执行任务的影响,建立了针对攻击任务的多UCAV协同任务分配模型,并应用粒子群算法求解。仿真结果验证了模型的合理性和算法的有效性。     

A specially structured nonlinear integer resource allocation problem

We present an algorithm for solving a specially structured nonlinear integer resource allocation problem. This problem was motivated by a capacity planning study done at a large Health Maintenance Organization in Texas. Specifically, we focus on a class of nonlinear resource allocation problems that involve the minimization of a convex function over one general convex constraint, a set of block diagonal convex constraints, and bounds on the integer variables. The continuous variable problem is also considered. The continuous problem is solved by taking advantage of the structure of the Karush‐Kuhn‐Tucker (KKT) conditions. This method for solving the continuous problem is then incorporated in a branch and bound algorithm to solve the integer problem. Various reoptimization results, multiplier bounding results, and heuristics are used to improve the efficiency of the algorithms. We show how the algorithms can be extended to obtain a globally optimal solution to the nonconvex version of the problem. We further show that the methods can be applied to problems in production planning and financial optimization. Extensive computational testing of the algorithms is reported for a variety of applications on continuous problems with up to 1,000,000 variables and integer problems with up to 1000 variables. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 770–792, 2003.     

布达拉宫古建筑灭火设施优化配置研究

为配合布达拉宫的消防工程改造，优化其建筑灭火设施的配置，针对现阶段布达拉宫建筑灭火设施现状，剖析了其存在的问题和缺陷，介绍了国外文物古建筑消防保护的理念，阐明了古建筑灭火设施优化配置应遵循的原则，通过对各类灭火设施保护宫殿的可行性和适用性分析，提出了布达拉宫古建筑灭火设施优化配置方案。     

一种面向分布式寄存器文件的VLIW调度新策略

新一代面向密集计算的高性能处理器普遍采用分布式寄存器文件来支撑ALU阵列,并通过VLIW开发指令级并行.面向分布式寄存器文件的编译成为新兴的研究热点,在斯坦福大学的kernelC编译器ISCD中最早提出了面向分布式寄存器的VLIW调度问题,在该领域处于领先水平,但是没有解决重负载下的分布式寄存器分配问题,使应用编程受到极大限制.在其基础上提出了一种新的VLIW调度策略,实验结果表明能够很好地解决重负载下的分布式寄存器分配问题.     

Optimal resource allocation and redistribution strategy in military conflicts with Lanchester square law attrition

We address the problem of optimal decision‐making in conflicts based on Lanchester square law attrition model where a defending force needs to be partitioned optimally, and allocated to two different attacking forces of differing strengths and capabilities. We consider a resource allocation scheme called the Time Zero Allocation with Redistribution (TZAR) strategy, where allocation is followed by redistribution of defending forces, on the occurrence of certain decisive events. Unlike previous work on Lanchester attrition model based tactical decision‐making, which propose time sequential tactics through an optimal control approach, the present article focuses on obtaining simpler resource allocation tactics based on a static optimization framework, and demonstrates that the results obtained are similar to those obtained by the more complex dynamic optimal control solution. Complete solution for this strategy is obtained for optimal partitioning of resources of the defending forces. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Equitable bandwidth allocation in content distribution networks

Applications for content distribution over networks, such as Video‐on‐Demand (VOD), are expected to grow significantly over time. Effective bandwidth allocation schemes that can be repeatedly executed must be deployed since new programs are often installed at various servers while other are deleted. We present a model for bandwidth allocation in a content distribution network that consists of multiple trees, where the root of each tree has a server that broadcasts multiple programs throughout the tree. Each network link has limited capacity and may be used by one or more of these trees. The model is formulated as an equitable resource allocation problem with a lexicographic maximin objective function that attempts to provide equitable service performance for all requested programs at the various nodes. The constraints include link capacity constraints and tree‐like ordering constraints imposed on each of the programs. We present an algorithm that provides an equitable solution in polynomial time for certain performance functions. At each iteration, the algorithm solves single‐link maximin optimization problems while relaxing the ordering constraints. The algorithm selects a bottleneck link, fixes various variables at their lexicographic optimal solution while enforcing the ordering constraints, and proceeds with the next iteration. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

Allocating the U.S. Department of Defense Budget: Revisiting the ‘Incremental/Fair Share Model’

Abstract

This article examines the ‘incremental/fair share model’ that was proposed by Alex Mintz in 1988 concerning the budget allocation of the U.S. Department of Defense. Although Mintz was unable to confirm the correctness of his model, this study demonstrated it to be statistically significant. In the statistical analyses, I used the two-stage least squares method and Durbin’s h-test to better scrutinize the model’s adequacy. Few previous studies have addressed the allocation of the U.S. defence budget; consequently, the incremental/fair-share model should constitute a starting point for further research on the U.S. defence budget allocation.     

“协同制导通道”基本概念及其应用分析

舰艇编队协同反导作战,是海上网络中心作战的典型样式.针对舰艇编队网络化协同反导作战装备体系特殊性,提出了“协同制导通道”基本概念和数学表示方法,并对基于协同制导通道分配方法运用于网络化反导作战条件下武器资源分配进行了研究.分析了单舰反导作战“武器目标分配”的局限性,网络化反导作战“弹-目匹配”新需求和“协同制导通道”的选择方法,为确定“协同制导通道”选择的最优化指标,提出选择“协同制导通道”优化算法奠定了基础.     

车载多接入边缘网络中联合资源分配和动态任务卸载方案

针对车联网中车辆移动速度过快产生的任务卸载失败问题,设计了一个有效的任务卸载风险评估模型,并提出了联合资源分配的动态任务卸载方案。将时间、能耗和风险共同建模为系统效用,通过联合优化卸载决策、资源分配来最大化系统效用。优化问题被公式化为混合整数非线性规划,在给定卸载决策的情况下,利用凸优化技术解决计算资源分配问题,功率分配通过分式规划技术来优化。仿真分析了车辆移动性对系统效用的影响,证明了所提方案的合理性。