Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is N P‐hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst‐case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two‐machine flow shop and the open shop problems with a single server are also shown to be N P‐hard in the strong sense. However, we reduce the two‐machine flow shop no‐wait problem with a single server to the Gilmore—Gomory traveling salesman problem and solve it in polynomial time. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 304–328, 2000     

Local search methods for the discrete time/resource trade-off problem in project networks

In this paper we consider the discrete time/resource trade-off problem in project networks. Given a project network consisting of nodes (activities) and arcs (technological precedence relations), in which the duration of the activities is a discrete, nonincreasing function of the amount of a single renewable resource committed to it, the discrete time/resource trade-off problem minimizes the project makespan subject to precedence constraints and a single renewable resource constraint. For each activity, a work content is specified such that all execution modes (duration/resource requirement pairs) for performing the activity are allowed as long as the product of the duration and the resource requirement is at least as large as the specified work content. We present a tabu search procedure which is based on a decomposition of the problem into a mode assignment phase and a resource-constrained project scheduling phase with fixed mode assignments. Extensive computational experience, including a comparison with other local search methods, is reported. © 1998 John Wiley & Sons, Inc. Naval Research Logistics 45: 553–578, 1998     

基于PIC系列单片机的迫弹电子时间引信控制系统设计

介绍了迫弹电子时间引信控制系统的电路组成、工作原理及其功能,并以PIC16F873A型单片机作为控制器核心,对引信的工作过程进行控制,提高了引信的安全性和可靠性。     

基于多媒体辅助的高等数学教学模式探究

在对高等数学教学模式构建的理论基础和价值取向分析的基础上,确立了"双主-双线"的教学模式:即在高等数学教学中,发挥教师主要导向作用,体现学生自主学习的主体地位,以师生共同探究、学生自主建构为主线,以现代多媒体和传统媒体的灵活运用为辅线的教学模式.并以此为基础陈述了模式的实施步骤及遵循的原则.     

超空泡航行体双层壳结构动力稳定性分析

针对超空泡航行体轴向受力特点,建立超空泡航行体双层壳结构有限元模型,对结构动力稳定性进行分析.数值计算表明,当壳间实肋板厚度增大或环向肋骨数量和尺寸增加时,动力失稳区域整体下移,不稳定激发频率下降,失稳区域宽度减小幅度较小;当壳间间距减小或纵向肋骨数量和尺寸增加时,双层壳结构动力不稳定激发频率上升,动力失稳区域宽度较大...     

基于模糊综合评价的再制造发动机抽样方案决策研究

影响因素难以量化是再制造发动机抽样方案选择过程中的难点,不可避免地给检验人员带来了主观性和片面性的问题。提出了应用模糊综合评价方法的解决方案,建立了再制造发动机抽样方案综合评价指标体系,详细阐述了综合评价方法的算法步骤,最后以某再制造发动机抽样方案的决策为例进行了实例应用。模糊综合评价方法解决了再制造发动机抽样方案选择中所遇到的问题,可为检验人员选择合理的抽样方案提供决策支持。     

罗兰C双台链交叉定位算法研究

在推导罗兰C双台链交叉定位算法基础上,根据试验得到的时差测量结果进行了单台链双曲线定位、非时基交叉圆定位以及双台链交叉定位算法比较.结果表明:测量点几何因子GDOP较好时,单台链双曲线定位与交叉圆定位方法的定位结果基本相同,而GDOP较差时,交叉圆定位方法的定位结果明显优于单台链双曲线定位算法的定位结果,但两种情况下的...     

一种陀螺与星敏感器组合定姿算法

提出了一种利用陀螺与星敏感器进行组合定姿的方案.为了避免状态及量测向量选取不当而造成的误差,首先采用四元数法对卫星的姿态进行描述;接着分析了陀螺与星敏感器系统的误差源,选取误差四元数及陀螺的系统误差作为组合系统的状态,获得了系统状态方程;同时采用星敏感器的量测作为系统量测,并利用新的数学变换构得到更为准确的量测方程;最...     

调炮精度检测中双经纬仪优化布站方法

针对“双经纬仪法”检测调炮精度中随机布站使测量系统达不到最佳测量精度的问题,提出了一种优化布站方法.根据火炮调炮范围确定了调炮精度检测中的测量区域,推导出了双经纬仪测量系统对于该测量区域的平均测量不确定度公式.结合某型火炮设计了基于遗传算法的具体优化过程,对测量系统的3个位置参数进行优化,得到最佳测量布局,并通过仿真试...     

混沌序列网形跳频网络同步方案

跳频信号的同步过程是跳频通信系统的关键.针对网形跳频网络中同步难的问题,提出了一种基于混沌序列的动态双频跳频同步方案.该方案采用混沌系统生成分布式跳频序列,同时引入并行解调器结构实现双频跳变的时序控制.仿真结果表明,方案可有效应对慢跳频通信系统中常见的部分频带干扰和强单频干扰,且同步建立过程简单迅速,系统的稳定性和安全...