Exact algorithms for scheduling multiple families of jobs on parallel machines

In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003.     

GIS技术在消防指挥中的应用

当前 ,消防指挥和管理的现状已不适应国民经济的发展和社会发展的需要 ,日益严峻的火灾形势也对消防指挥提出了新的要求。GIS技术的不断成熟和在各个行业的广泛应用 ,为在消防工作中的应用提供了技术保证和可借鉴的经验。文章分析了GIS技术在消防工作中应用的必要性和可行性 ,并指出了其未来发展趋势。     

浅谈大学生英文写作能力及培养

英文写作是衡量英语学习者能力的重要指标,特别是在现阶段的四六级考试中都是单项算分,因此对于大学生来说就尤为重要了。本文就如何提高英文写作,着重阐述了大学生英文写作应具备的六种能力,并分别提出了每种写作能力的培养方法,旨在全面提高大学生英文写作水平及素养。     

磁探针位置及角度偏移对电磁发射过程测试的影响

简化电磁发射装置中的导轨和电枢为线电流下的直导体,建立发射装置的物理模型。利用毕奥-萨伐尔定律和感应电动势原理,推导出磁探针线圈中心放置点的磁感强度。假设线圈范围内的磁场为均匀磁场,计算得到磁探针线圈产生的电动势。以此设计测量所用的磁探针,并和测试数据对比验证模型的正确性。在多次试验中发现,发射过程中装置振动导致磁探针距离变化和角度偏转问题。测量并分析三组单次发射中的故障测试状态。仿真和实验数据表明:小范围距离变化没有使磁探针的测试性能失效,但角度偏移对下一步的速度拟合带来误差干扰,且随着角度增大拟合速度逐步减小。     

Inventory policies with quantized ordering

This article studies (nQ, r) inventory policies, under which the order quantity is restricted to be an integer multiple of a base lot size Q. Both Q and r are decision variables. Assuming the one-period expected holding and backorder cost function is unimodal, we develop an efficient algorithm to compute the optimal Q and r. The algorithm is facilitated by simple observations about the cost function and by tight upper bounds on the optimal Q. The total number of elementary operations required by the algorithm is linear in these upper bounds. By using the algorithm, we compare the performance of the optimal (nQ, r) policy with that of the optimal (s, S) policy through a numerical study, and our results show that the difference between them is small. Further analysis of the model shows that the cost performance of an (nQ, r) policy is insensitive to the choice of Q. These results establish that (nQ, r) models are potentially useful in many settings where quantized ordering is beneficial.     

射频识别系统的多目标识别-反碰撞算法

对多目标识别技术的二进制搜索算法、时隙ALOHA算法进行了剖析,并对ALOHA算法用概率论和数理统计的方法进行了深入的理论分析,得出要根据所设计的射频识别系统的特点合理采用各种算法方可得到良好的效果.该算法的实现对提高高速公路上自动收费系统、人员和物流管理等各领域的工作效率具有一定的指导意义.     

牢固树立科学人才观——学习胡锦涛主席关于科学人才观的重要论述

科学人才观是做好人才工作,落实人才强军战略的思想基础。全面理解和践行科学人才观,一要牢固树立人才资源是第一资源、人人都可以成才、以人为本的观念;二要始终坚持党管人才原则,加强各级党委对人才工作的领导;三要构建与科学人才观相适应的军事人才激励机制。     

Weighted vertex packing problem for specially structured geometric graphs

Consider a set of vertices V = {1, 2,…, n} placed on a two-dimensional Euclidean plane R² with each vertex attached a nonnegative weight w: V → R. For a given constant d>0, the geometric graph G = (V, E) is defined to have edge set E = {(i, j): d_ij ⩽ d} with d_ij being the Euclidean distance between vertices i and j. The geometric vertex packing (GVP) problem, which is often called the independent set problem, is defined as selecting the set of pairwise nonadjacent vertices with maximum total weight. We limit our attention to the special case that no vertex is within a distance βd of any other vertices where 0 ⩽ β < 1. A special value of β (= 1/2) is referred to frequently because of its correspondence to a manufacturing problem in circuit board testing. In this article we show that the weighted vertex packing problem for the specially structured geometric graph (SGVP) defined with the above restriction is NP-complete even for the case that all vertex weights are unity and for any β. Polynomial procedures have been designed for generating cuts to obtain tight LP upper bounds for the SGVP. Two heuristics with bounded worst-case performance are applied to the LP solution to produce a feasible solution and a lower bound. We then use a branch-and-bound procedure to solve the problem to optimality. Computational results on large-scale SGVP problems will be discussed. © 1995 John Wiley & Sons, Inc.     

C4ISR网络安全态势的可拓云理论综合评估方法

为了对C4ISR网络的安全态势进行精确评估,提出了一种基于云理论和可拓学的评估方法。分析了影响C4ISR网络安全态势的评价指标体系,通过主客观综合赋权法确定各评价指标的权系数。在此基础上,利用云理论和可拓学中的基元理论,构建C4ISR网络安全态势的综合评估方法。通过对实例的分析,表明了该方法的可操作性和优越性。