On the asymptotic optimality of algorithms for the flow shop problem with release dates

We consider the nonpermutation flow shop problem with release dates, with the objective of minimizing the sum of the weighted completion times on the final machine. Since the problem is NP‐hard, we focus on the analysis of the performance of several approximation algorithms, all of which are related to the classical Weighted Shortest Processing Time Among Available Jobs heuristic. In particular, we perform a probabilistic analysis and prove that two online heuristics and one offline heuristic are asymptotically optimal. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

战后美苏矛盾的演变与冷战的开始

第二次世界大战末期及战后初期,由于政治、经济、军事利益的尖锐对立,美苏矛盾迅速上升。为了达到自己的目的,它们确定新的战略策略,争夺势力范围,并把欧洲作为争夺的重点。但是,世界大战的惨痛记忆使美苏都不敢贸然发动战争,只是以冷战的形态对抗。     

中流砥柱--八路军对抗日民族解放战争的历史贡献

抗日战争中,八路军在中国共产党的领导下,深入敌后创建抗日根据地,开展抗日游击战争,浴血奋战,为夺取抗日战争的伟大胜利作出了巨大贡献.     

强化战斗精神要体现在全面提高素质能力上

强化战斗精神培育一个十分重要的方面,就是要体现在全面提高素质能力上。要深刻认识把强化战斗精神体现在全面提高素质能力上的重要意义,牢牢把握关键环节,并自觉坚持正确的途径。     

试论政治工作的信息建模

政治工作信息建模是信息技术与政治工作有机融合的基本条件和关键环节。推动政治工作信息化建设应认识政治工作信息建模的重要作用,整理政治工作信息建模的基本方法,科学评价不同建模方法的适用范围和有效性,全面把握政治工作信息建模的复杂性和可行性。     

基于混沌-鲸鱼优化算法的MIMO雷达相位编码信号集设计

针对MIMO雷达相位编码信号集的优化设计问题,基于鲸鱼优化算法提出了两种改进策略.一是通过混沌映射生成初始种群,提高种群的多样性以及初始解的质量,扩大种群范围,防止结果陷入局部最优;二是借鉴粒子群算法的权重思想改变自适应更新方程,均衡全局搜索和局部搜索能力,提高收敛精度,从而达到寻求最佳结果的目的.混沌-鲸鱼优化算法不...     

Word文件自动管理系统的设计和实现

论述了研制新型文档自动管理系统的原因及其重要性,给出了系统的软件结构和文档自动管理系统的部分设计界面.重点介绍了大文本的读写、Microsoft Word 的控制、Word的感知、套打、数据库的连接等主要技术难点,使系统能够存放文档文件的所有信息,按权限管理,保证文档文件在查询和网络传递中操作简单、安全可靠.     

热力设备可靠性分析的问题与对策

以热力设备为研究对象 ,从可靠性分析特点出发 ,对应用故障统计方法所遇到的典型问题作了探讨 ,就分析方法、建模技术等方面论述了作者的观点     

Integrated scheduling of loading and transportation with tractors and semitrailers separated

Motivated by some practical applications, we study a new integrated loading and transportation scheduling problem. Given a set of jobs, a single crane is available to load jobs, one by one, onto semitrailers with a given capacity. Loaded semitrailers are assigned to tractors for transportation tasks. Subject to limited resources (crane, semitrailers, and tractors), the problem is to determine (1) an assignment of jobs to semitrailers for loading tasks, (2) a sequence for the crane to load jobs onto semitrailers, (3) an assignment of loaded semitrailers to tractors for transportation tasks, and (4) a transportation schedule of assigned tractors such that the completion time of the last transportation task is minimized. We first formulate the problem as a mixed integer linear programming model (MILPM) and prove that the problem is strongly NP‐hard. Then, optimality properties are provided which are useful in establishing an improved MILPM and designing solution algorithms. We develop a constructive heuristic, two LP‐based heuristics, and a recovering beam search heuristic to solve this problem. An improved procedure for solutions by heuristics is also presented. Furthermore, two branch‐and‐bound (B&B) algorithms with two different lower bounds are developed to solve the problem to optimality. Finally, computational experiments using both real data and randomly generated data demonstrate that our heuristics are highly efficient and effective. In terms of computational time and the number of instances solved to optimality in a time limit, the B&B algorithms are better than solving the MILPM. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 416–433, 2015     

采用时序多属性评价方法的空战威胁排序

鉴于空战中威胁目标的多属性及动态变化特点,提出采用时序多属性评价方法来解决空战目标动态威胁排序问题。在建立空战威胁指标体系基础上,采用熵权法确定目标属性权重,并通过指数分布法确定各时刻权重,最后综合依据威胁目标多时刻的属性信息,实现了空战动态威胁排序。仿真结果说明该方法的合理性。