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.     

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算法用概率论和数理统计的方法进行了深入的理论分析,得出要根据所设计的射频识别系统的特点合理采用各种算法方可得到良好的效果.该算法的实现对提高高速公路上自动收费系统、人员和物流管理等各领域的工作效率具有一定的指导意义.     

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

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

Estimating moments of the minimum order statistic from normal populations—a bayesian approach

Let Yⁱ ∽ N(θⁱ, σ), i = 1, …, p, be independently distributed, where θⁱ and σ are unknown. A Bayesian approach is used to estimate the first two moments of the minimum order statistic, W = min (Y¹, …, Y^p). In order to compute the Bayes estimates, one has to evaluate the predictive densities of the Yⁱ's conditional on past data. Although the required predictive densities are complicated in form, an efficient algorithm to calculate them has been developed and given in the article. An application of the Bayesian method in a continuous-review control model with multiple suppliers is discussed. © 1994 John Wiley & Sons, Inc.     

防空反导智能战场态势估计研究

在军事科技理论面临着巨大变革的背景下,为解决防空反导战场态势估计智能化发展的问题,通过对态势估计的三层模型进行分析以及对防空反导态势的要素构成进行探讨,研究了OODA环中防空反导态势估计的过程,建立了防空反导智能战场态势估计的系统模型,深入地探讨了阻碍防空反导智能化战场态势估计研究的五方面问题以及有望解决问题的关键技术措施,从而为防空反导智能战场态势估计研究提供了新思路。     

无人直升机辨识的一种新方法

针对无人直升机的辨识建模问题,提出了把频率响应辨识法和遗传算法相结合的一种新的辨识方法.该方法充分结合了频率响应辨识法抗噪声能力强、对输入信号通用性强、以及遗传算法的全局寻优特性的优点,极大地提高了辨识的准确性.与最小二乘法、Levy方法的对比仿真结果表明,这种方法辨识精度更高,具有重要的工程使用价值.     

军队思想政治建设实现“三个确保”的路径探索

军队思想政治建设实现"三个确保",必须以强化中国特色社会主义理论体系武装为首要任务;以培育当代革命军人核心价值观为重要抓手;以全面提高完成多样化军事任务能力为实践平台;以加强各级党组织建设为关键环节;以改进创新思想政治工作为强大动力.     

传承“老西藏精神” 培育核心价值观

传承"老西藏精神",培育当代革命军人核心价值观,要在深化"老西藏精神"的认识中提升对当代革命军人核心价值观的认同感;在履行"双重职能"的实践中培育当代革命军人核心价值观;在建设"小康平安和谐西藏"的实践中培育当代革命军人核心价值观;在打造"雪域文化"的实践中培育当代革命军人核心价值观.     

基于软件无线电技术的伪码调制激光探测系统研究

为使一般伪码调制激光探测系统的升级和改进更简单、方便和廉价,提出把软件无线电技术应用于该系统.从软件无线电技术的基本原理入手阐述了系统的基本体系、硬件平台和软件系统实现.并设计了系统框图和DSP的硬件电路,编制了伪码产生的程序框图、信号处理软件流程图.实验研究表明:把软件无线电技术应用于伪码调制激光探测系统,为整个系统的模块化、小型化、智能化提供了新的有效途径.