Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function

We consider open‐shop scheduling problems where operation‐processing times are a convex decreasing function of a common limited nonrenewable resource. The scheduler's objective is to determine the optimal job sequence on each machine and the optimal resource allocation for each operation in order to minimize the makespan. We prove that this problem is NP‐hard, but for the special case of the two‐machine problem we provide an efficient optimization algorithm. We also provide a fully polynomial approximation scheme for solving the preemptive case. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

语义对等网中资源元数据混合索引策略研究

面向对等网络信息资源语义共享问题,首先提出了一种基于多本体的资源元数据描述框架,将资源元数据分为核心和扩展两部分,在此基础上重点对资源元数据索引策略进行了研究,提出了一种混合索引机制,针对资源核心元数据采用一种社区策略来进行组织索引,针对扩展元数据采取DHT和语义关联相结合的方式进行组织索引,其中结合了本地索引和全局索引的特点,并在此基础上对资源发现流程和负载均衡方法进行了设计。与现有相关系统相比,本索引体系有效地提高了对等网络环境下资源定位的效率和系统的可扩展能力。     

充分利用农业资源优势 推进新疆农业可持续发展

新疆地大物博,有着发展农业的资源优势,只有抓住“西部大开发”这个机遇,以市场为导向,加大产业 结构调整力度,积极推进农业产业化进程,以保护生态环境为前提,发展生态农业,才能促进新疆农业可持续发展。     

Non‐zero‐sum nonlinear network path interdiction with an application to inspection in terror networks

A simultaneous non‐zero‐sum game is modeled to extend the classical network interdiction problem. In this model, an interdictor (e.g., an enforcement agent) decides how much of an inspection resource to spend along each arc in the network to capture a smuggler. The smuggler (randomly) selects a commodity to smuggle—a source and destination pair of nodes, and also a corresponding path for traveling between the given pair of nodes. This model is motivated by a terrorist organization that can mobilize its human, financial, or weapon resources to carry out an attack at one of several potential target destinations. The probability of evading each of the network arcs nonlinearly decreases in the amount of resource that the interdictor spends on its inspection. We show that under reasonable assumptions with respect to the evasion probability functions, (approximate) Nash equilibria of this game can be determined in polynomial time; depending on whether the evasion functions are exponential or general logarithmically‐convex functions, exact Nash equilibria or approximate Nash equilibria, respectively, are computed. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 139–153, 2017     

论火灾与可持续发展观的内在联系

可持续发展是人类迫切解决的问题,火灾对可持续发展构成巨大威胁.针对火灾的危害,从防灾角度研究可持续发展观,揭示火灾与可持续发展的内在联系,为人类有效控制火灾提供正确的认识论和科学的方法论.     

集中控制混合网络中基于流的资源分配算法

集中控制混合网络中,异构化网络内部的流量具有一定的规律和特性,如果使用原有的单一的离散式最大极值和无状态的网络资源调度算法,忽略了异构网络规律,会造成网络利用率较低、易震荡、部分网络流延迟等问题。通过分析由集中控制网络和普通网络组成的混合网络的拓扑结构,对混合网络结构中常见问题如流闪现、不能估计的流、路径堵塞或连接震荡场景进行分析,并提出基于期望和状态的流量评价资源规划算法POS和POS-FME。算法考虑混合网络的运行状态,对系统可用资源进行评估,为系统中各种流匹配对应可用资源,并具有一定的预测作用,从而避免混合网络出现运行效率低下的场景。通过实验,POS算法和POS-FME算法相对传统算法,利用率提高了10%～30%,并降低了震荡和平均延迟。     

基于军民融合的军事信息资源效能转化

军事信息资源效能转化的强弱,事关军队信息化建设和军队战斗力生成,需要引起高度重视。本文阐述军民融合对军事信息效能转化工作的巨大推动力,并通过分析当前制约军民融合军事信息资源效能转化的内因和外因,提出完善军民融合军事信息资源效能转化工作的措施建议。     

我国西部矿产资源可持续发展利用研究

我国西部矿产资源丰富,矿产资源开发利用中存在的问题,提出了西部矿产资源可持续开发利用的正确途径.     

试论我国人力资源状况的改善

人力资源是社会人力、物力、财力三大资源中最具活力的,对经济影响最大的资源,人力资源状况与国民经济的发展关系十分密切.研究我国人力资源的基本状况和我国人力资源状况的途径,对充分利用我国的人力资源具有十分重要的现实意义.     

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.