基于空间约束的舰载机出库调度

舰载机在航母上的调度问题是制约舰载机出动和回收的重要因素,以往研究主要集中在飞行甲板调度方面。针对舰载机在航母上的出入库问题进行研究,着力解决舰载机在航母上二、三波次的出动能力。首先对舰载机出库的流程进行分析,梳理制约因素。其次,应用柔性流水车间调度理论对空间约束条件下的舰载机出库调度问题进行建模。再次,对智能粒子群算法应用于舰载机出库调度问题进行分析,对编码进行设计,并给出算法流程。最后,对出库流程进行仿真,计算出最优出库方案及时间,验证了模型的准确性。     

Evaluating appointment postponement in scheduling patients at a diagnostic clinic

Diagnostic clinics are among healthcare facilities that suffer from long waiting times which can worsen medical outcomes and increase patient no-shows. Reducing waiting times without significant capital investments is a challenging task. We tackle this challenge by proposing a new appointment scheduling policy that does not require significant investments for diagnostic clinics. The clinic in our study serves outpatients, inpatients, and emergency patients. Emergency patients must be seen on arrival, and inpatients must be given next day appointments. Outpatients, however, can be given later appointments. The proposed policy takes advantage of this by allowing the postponement of the acceptance of appointment requests from outpatients. The appointment scheduling process is modeled as a two-stage stochastic programming problem where a portion of the clinic capacity is allocated to inpatients and emergency patients in the first stage. In the second stage, outpatients are scheduled based on their priority classes. After a detailed analysis of the solutions obtained from the two-stage stochastic model, we develop a simple, non-anticipative policy for patient scheduling. We evaluate the performance of this proposed, easy-to-implement policy in a simulation study which shows significant improvements in outpatient indirect waiting times.     

Scheduling twin robots on a line

This article introduces the twin robots scheduling problem (TRSP), in which two robots positioned at the opposite ends of a rail are required to deliver items to positions along the rail, and the objective is to minimize the makespan. A proof of ‐hardness of the TRSP is presented, along with exact and heuristic algorithms. Computational results on challenging instances are provided.Copyright © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 119–130, 2014     

Maintenance scheduling for modular systems: Modeling and algorithms

We study new models of scheduled maintenance management for modular systems, consisting of multiple components with respective cycle limits. The cycle limit of each component specifies the time interval in which this component must be repaired or replaced. The goal is to compute a feasible maintenance schedule that minimizes the cost associated with component maintenance. Applications of these models arise in Air Force aircraft maintenance as well as in other arenas with required preventive maintenance. The typical cost structures that arise in practical settings are submodular, which make the resulting models computationally challenging. We develop two efficient and operationally tenable approximation algorithms. We prove constant factor worst‐case guarantees for both algorithms, and present computational experiments showing that these algorithms perform within a few percent of optimality on operationally relevant instances. © 2014 Wiley Periodicals, Inc. Naval Research Logistics 61: 472–488, 2014     

基于MPI+CUDA的异构并行可压缩流求解器

在CPU/GPU异构体系结构计算集群上,建立了基于MPI+CUDA的异构并行可压缩流求解器。讨论了异构结构上的可压缩流并行算法的并行模式,在CPU上执行计算密集度低、指令复杂的计算任务,在GPU上执行计算密集度高、指令单一的计算任务。通过数个算例,对比了异构并行计算和传统CPU并行计算计算结果和计算效率。将该算法运用于高超声速流动的数值模拟中,数值结果显示,基于MPI+CUDA的异构并行可压缩流求解器鲁棒性好,计算效率较CPU同构并行计算提高10倍以上。     

一种装甲车辆CAN总线混合调度算法

针对当前装甲车辆综合电子系统节点消息传输不公平、紧急消息传输不及时等缺点,结合某型车辆消息紧急度和截止期,按照分层处理原则对总线协议进行了改进,提出了"分级决策动态均衡"的混合调度算法,并通过试验验证了算法的可行性和有效性。     

The quay crane scheduling problem with time windows

The quay crane scheduling problem consists of scheduling tasks for loading and unloading containers on cranes that are assigned to a vessel for its service. This article introduces a new approach for quay crane scheduling, where the availability of cranes at a vessel is restricted to certain time windows. The problem is of practical relevance, because container terminal operators frequently redeploy cranes among vessels to speed up the service of high‐priority vessels while serving low‐priority vessels casually. This article provides a mathematical formulation of the problem and a tree‐search‐based heuristic solution method. A computational investigation on a large set of test instances is used to evaluate the performance of the heuristic and to identify the impact of differently structured crane time windows on the achievable vessel handling time. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

多核系统中基于动态松弛时间回收的节能实时调度算法

许多嵌入式实时任务的实际执行时间往往小于最坏情况执行时间,因此可以产生大量的动态松弛时间.针对时限等于周期的偶发任务集,提出一种基于动态松弛时间回收的多核系统节能实时调度算法LRE-DVFS-ALL.该算法基于最优在线调度算法LRE-TL,利用TL面内节能实时调度思想,在每个TL面的提前完成时刻实现动态松弛时间回收,降...     

基于拉格朗日松弛的航天测控调度上界求解算法

通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性.