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.     

Resequencing with parallel queues to minimize the maximum number of items in the overflow area

This article treats an elementary optimization problem, where an inbound stream of successive items is to be resequenced with the help of multiple parallel queues in order to restore an intended target sequence. Whenever early items block the one item to be currently released into the target sequence, they are withdrawn from their queue and intermediately stored in an overflow area until their actual release is reached. We aim to minimize the maximum number of items simultaneously stored in the overflow area during the complete resequencing process. We met this problem in industry practice at a large German automobile producer, who has to resequence containers with car seats prior to the assembly process. We formalize the resulting resequencing problem and provide suited exact and heuristic solution algorithms. In our computational study, we also address managerial aspects such as how to properly avoid the negative effects of sequence alterations. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 401–415, 2016     

基于ARM的LED指挥控制终端的设计与实现

LED显示屏是现代社会发布信息的一种重要方式,通过LED显示屏可以播放视频、文字等不同形式的信息,为人们传达最直观的视觉信息。随着科学技术的不断发展,LED显示屏的应用也日渐广泛,尤其是军事上的应用,比如基于LED显示屏的各种级别指挥控制终端的设计和运用,具有更为深入的研究价值。而ARM处理器是实现LED显示屏控制系统有效运行的基础,主要针对基于ARM的LED显示屏指挥控制终端系统的设计与实现的相关问题进行了探讨。     

弹丸速度的数字化激光幕测试技术

针对传统弹丸速度测量方法的局限,提出一种新的弹丸速度测试技术——数字化激光幕结合互相关速度测量算法的测试技术,并给出了激光总体测速方案、测速原理以及互相关测速方法,经靶场试验验证测试效果良好。     

烟幕干扰技术综述

现代战争中,面对我国重要经济目标数量多、防护力量和资源有限的现状,选择各种高效费比的防护措施才能适应我国国情。烟幕正是一种成本低、效果明显、操作简单的干扰手段。阐述了烟幕的产生、干扰原理,重点介绍了各波段的烟幕干扰材料、常用的烟幕器材及烟幕的具体应用,对重要经济目标防护工作的实际操作具有一定借鉴意义。     

中学历史教材汉代西北丝绸之路分途地商榷

中学历史教材之中汉代西北丝绸之路插图,图中中段路线南北道分途地当起自鄯善,并非敦煌玉门、阳关,南道支线分歧地当起于皮山,并非于阗。除插图所示自大宛可直抵安息路线之外,自皮山西南行,越过葱岭抵印度河流域,经今克什米尔、巴基斯坦东北部、阿富汗西南、伊朗高原亦可抵达安息。     

基于循环移位和异或运算的对合线性变换研究

在对称密码算法的设计中,为达到良好的扩散作用,设计者一般均选择分支数较大的线性变换.基于循环移位和异或运算的线性变换由于其实现效率较高,已经在很多密码算法中被采用,比如分组密码SMS4、HIGHT,Hash函数SHA -2、MD6等.此外,如果线性变换是对合的,还为解密带来了方便.研究了基于循环移位和异或运算设计的对合线性变换,给出了这类线性变换的计数公式,指出它们的分支数上界为4,并讨论了循环移位的参数与分支数之间的关系,从而为基于这类运算设计的线性变换提供了理论依据.     

The resource constrained project scheduling problem with multiple crashable modes: An exact solution method

We introduce a formulation and an exact solution method for a nonpreemptive resource constrained project scheduling problem in which the duration/cost of an activity is determined by the mode selection and the duration reduction (crashing) within the mode. This problem is a natural combination of the time/cost tradeoff problem and the resource constrained project scheduling problem. It involves the determination, for each activity, of its resource requirements, the extent of crashing, and its start time so that the total project cost is minimized. We present a branch and bound procedure and report computational results with a set of 160 problems. Computational results demonstrate the effectiveness of our procedure. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 107–127, 2001     

A logistics scheduling model: Inventory cost reduction by batching

Logistics scheduling refers to the problems where the decisions of job scheduling and transportation are integrated in a single framework. In this paper, we discuss a logistics scheduling model where the raw material is delivered to the shop in batches. By making the batching and scheduling decisions simultaneously, the total inventory and batch setup cost can be reduced. We study different models on this issue, present complexity analysis and optimal algorithms, and conduct computational experiments. Some managerial insights are observed. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

红外烟幕面积的摄像测试方法

从分析多波段红外烟幕性能和它在热像仪上的成像规则入手,阐述了应用热成像测试方法的基本思想、硬件配置与工作流程,详细介绍了热成像测试方法中有关烟幕面积计算的数学方法以及在本测试方法中使用的去除噪声和图像增强的图像处理过程,最后对整个热成像测试方法作了简单的分析。