Cyclic scheduling in robotic flowshops with bounded work‐in‐process levels

This study addresses cyclic scheduling in robotic flowshops with bounded work‐in‐process (WIP) levels. The objective is to minimize the cycle time or, equivalently, to maximize the throughput, under the condition that the WIP level is bounded from above by a given integer number. We present several strongly polynomial algorithms for the 2‐cyclic robotic flowshop scheduling problems for various WIP levels. © 2010 Wiley Periodicals, Inc. Naval Research Logistics 58: 1–16, 2011     

科学工作流技术研究综述

科学工作流管理系统(Scientific Workflow Management Systems,SWfMS)为科学家提供一个管理大规模复杂科学计算的有效平台,通过管理复杂应用程序对海量科学数据进行管理、分析、仿真和可视化以帮助科学家进行科学发现.本文首先对科学工作流(Scientific Workflow,SWF)...     

基于星上天线仰角约束的星间可视卫星集解析算法

星座自主导航需要对星间可视性规律做定量分析,可为进一步研究星间自主组网策略以及星间网络拓扑设计提供理论依据,同时星上自主建立星间链路需要卫星已知其可视卫星集合,因此有必要研究星间可视性解析算法.建立了基于星上环带天线仰角约束的星间可视性判定模型,结合星座几何特性以及卫星运动规律,以时间为变量,推导了卫星在运动过程中对同...     

一种对地观测卫星应用任务描述模型

对地观测卫星(EOS)的应用任务建模是任务规划与调度的重要组成部分.从对地观测卫星系统的组成、应用任务特点以及建模基本要素等3个方面,对应用任务进行了详细的分析,其中特点包括任务周期性、严格的时间限制性、实体属性的复杂性以及任务的突发性等,建模基本要素主要包括约束条件和活动.在此基础上,使用规划领域定义语言(PDDL)...     

基于逆向分层的工作流时间-费用优化方法

针对效用网格下基于优先级因子的工作流时间-费用优化问题,基于工作流的同步完成特征对任务进行分层并提出三种实时调度算法:基于逆向分层的sufferage(BLSuff)、基于逆向分层的min-min(BLMin)及基于逆向分层的min-max(BLMax)。算法设计基于优先级因子的衡量标准对时间与费用同时进行优化,并为任务设置期望完成时间以达到充分利用费用优化空间进行费用优化的目标。实验结果表明这三种算法在各种优先级因子下都能对工作流的执行时间与执行费用进行较好的优化。     

预警卫星对战术弹道导弹预警能力研究

从研究DSP预警卫星预警原理出发,分析了战术弹道导弹主动段的弹道特征和尾焰的红外辐射特性,从关机点速度预报偏差与射程偏差的角度,基于弹道学原理并利用三次样条插值方法,建立了DSP预警卫星对常规战术弹道预警能力仿真模型,通过仿真计算,可以发现在无干扰条件下,DSP预警卫星对弹道导弹落点预报精度非常高。     

STK在空间探测相控阵雷达效能仿真中的应用

搜索和跟踪是空间探测相控阵雷达的两种基本工作方式。介绍了应用STK软件对相控阵雷达的搜索、跟踪空间目标能力的仿真过程和方法,介绍了STK与其他应用软件相链接扩充功能的方法。总结了应用仿真安排雷达工作方式,论证雷达技术指标,确定系统总体方案的作用和意义,研究的内容可运用于STK软件对各类雷达的仿真设计。     

弹炮混编防空群火力分配优化问题研究

以火力分配原则为依据,在确定防空武器对目标的可射击系数、火力重叠修正系数和转火矛盾修正系数的基础上,结合防空作战的实际,通过对高炮、地空导弹不同运用方式的分析,介绍了解决弹炮混编防空群火力分配优化问题的一般步骤。通过算例,证明了该方法的可行性。     

基于Multi-Agent的武器装备虚拟维修训练系统

提出了一种基于Multi-Agent的虚拟维修训练系统(VMTS)结构框架,整个系统分别由主控Agent、仿真Agent、和接口Agent3个具有交互作用的Agent组成,从而将虚拟维修训练系统的开发转化为一个多Agent系统的设计与开发.基于多Agent的框架结构可实现受训者的智能模型及虚拟训练场景中虚拟物体的行为模型,从而可以提高VMTS的健壮性和可重用性.基于Agent的概念模型实现了Agent之间的交互和协作,并介绍了主控Agent和仿真Agent的具体实现方法.     

Cyclic preference scheduling for nurses using branch and price

This paper presents a new methodology to solve the cyclic preference scheduling problem for hourly workers. The focus is on nurse rostering but is applicable to any organization in which the midterm scheduling decision must take into account a complex of legal, institutional, and preferential constraints. The objective is to strike a balance between satisfying individual preferences and minimizing personnel costs. The common practice is to consider each planning period independently and to generate new rosters at the beginning of each. To reduce some of the instability in the process, there is a growing trend toward cyclic schedules, which are easier to manage and are generally perceived to be more equitable. To address this problem, a new integer programming model is presented that combines the elements of both cyclic and preference scheduling. To find solutions, a branch‐and‐price algorithm is developed that makes use of several branching rules and an extremely effective rounding heuristic. A unique feature of the formulation is that the master problem contains integer rather than binary variables. Computational results are reported for problem instances with up to 200 nurses. Most were solved within 10 minutes and many within 3 minutes when a double aggregation approach was applicable. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.