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     

串并联结构分解目标毁伤评估

针对仿真中空地导弹攻击复杂目标的毁伤评估问题,提出了一种基于串并联结构分解的目标毁伤评估算法,并引入了修复时间作为毁伤评估的一项指标.该算法首先按结构布局和功能关系将目标分解成多个子系统,并组成串并联结构图,然后根据导弹的精确落点对每个子系统进行毁伤评估,最后综合所有子系统的毁伤情况得出目标整体的毁伤程度和恢复正常所需...