基于NR-Transformer的集群作业运行时间预测

高性能集群的作业调度通常使用作业调度系统来实现，准确填写作业运行时间能在很大程度上提升作业调度效率。现有的研究通常使用机器学习的预测方式，在预测精度和实用性上还存在一定的提升空间。为了进一步提高集群作业运行时间预测的准确率，考虑先对集群作业日志进行聚类，将作业类别信息添加到作业特征中，再使用基于注意力机制的NR-Transformer网络对作业日志数据建模和预测。在数据处理上，根据与预测目标的相关性、特征的完整性和数据的有效性，从历史日志数据集中筛选出7维特征，并按作业运行时间的长度将其划分为多个作业集，再对各作业集分别进行训练和预测。实验结果表明，相比于传统机器学习和BP神经网络，时序神经网络结构有更好的预测性能，其中NR-Transformer在各作业集上都有较好的性能。     

Automatic design for shop scheduling strategies based on hyper-heuristics: A systematic review

Against the background of smart manufacturing and Industry 4.0, how to achieve real-time scheduling has become a problem to be solved. In this regard, automatic design for shop scheduling based on hyper-heuristics has been widely studied, and a number of reviews and scheduling algorithms have been presented. Few studies, however, have specifically discussed the technical points involved in algorithm development. This study, therefore, constructs a general framework for automatic design for shop scheduling strategies based on hyper-heuristics, and various state-of-the-art technical points in the development process are summarized. First, we summarize the existing types of shop scheduling strategies and classify them using a new classification method. Second, we summarize an automatic design algorithm for shop scheduling. Then, we investigate surrogate-assisted methods that are popular in the current algorithm field. Finally, current problems and challenges are discussed, and potential directions for future research are proposed.     

Container-based cluster orchestration systems: A taxonomy and future directions

Containers, enabling lightweight environment and performance isolation, fast and flexible deployment, and fine-grained resource sharing, have gained popularity in better application management and deployment in addition to hardware virtualization. They are being widely used by organizations to deploy their increasingly diverse workloads derived from modern-day applications such as web services, big data, and internet of things in either proprietary clusters or private and public cloud data centers. This has led to the emergence of container orchestration platforms, which are designed to manage the deployment of containerized applications in large-scale clusters. These systems are capable of running hundreds of thousands of jobs across thousands of machines. To do so efficiently, they must address several important challenges including scalability, fault tolerance and availability, efficient resource utilization, and request throughput maximization among others. This paper studies these management systems and proposes a taxonomy that identifies different mechanisms that can be used to meet the aforementioned challenges. The proposed classification is then applied to various state-of-the-art systems leading to the identification of open research challenges and gaps in the literature intended as future directions for researchers.     

Couple-based particle swarm optimization for short-term hydrothermal scheduling

A novel couple-based particle swarm optimization (CPSO) is presented in this paper, and applied to solve the short-term hydrothermal scheduling (STHS) problem. In CPSO, three improvements are proposed compared to the canonical particle swarm optimization, aimed at overcoming the premature convergence problem. Dynamic particle couples, a unique sub-group structure in maintaining population diversity, is adopted as the population topology, in which every two particles compose a particle couple randomly in each iteration. Based on this topology, an intersectional learning strategy using the partner learning information of last iteration is employed in every particle couple, which can automatically reveal useful history information and reduce the overly rapid evolution speed. Meanwhile, the coefficients of each particle in a particle couple are set as distinct so that the particle movement patterns can be described and controlled more precisely. In order to demonstrate the effectiveness of our proposed CPSO, the algorithm is firstly tested with four multimodal benchmark functions, and then applied to solve an engineering multimodal problem known as STHS, in which two typical test systems with four different cases are tested, and the results are compared with those of other evolutionary methods published in the literature.     

Common due date assignment scheduling for a no-wait flowshop with convex resource allocation and learning effect

This article addresses the no-wait flowshop scheduling problem with simultaneous consideration of common due date assignment, convex resource allocation and learning effect in a two machine setting. The processing time of each job can be controlled by its position in a sequence and also by allocating extra resource, which is a convex function of the amount of a common continuously divisible resource allocated to the job. The objective is to determine the optimal common due date, the resource allocation and the schedule of jobs such that the total earliness, tardiness and common due date cost (the total resource consumption cost) are minimized under the constraint condition that the total resource consumption cost (the total earliness, tardiness and common due date cost) is limited. Polynomial time algorithms are developed for two versions of the problem.     

An improved method for the hot strip mill production scheduling problem

In most research on the hot strip mill production scheduling problem (HSMPSP) arising in the steel industry, it is accepted that a schedule with lower penalty caused by jumps of width, hardness, and gauge will result in lower roller wear, so it is regarded as a better schedule. However, based on the analysis of production processes, it is realised that rolling each coil also cause roller wear. In order to assessing the roller wear associated with production scheduling more precisely, it is necessary to consider it as another factor besides those jumps, especially when complicated constraints are involved. In this paper, an improved method is proposed to quantify the expected wear of the rollers done by those jumps and rolling processes. Then the HSMPSP whose objective is to maximise the total length of all scheduled coils is formulated as a team orienteering problem with time windows and additional production constraints. A heuristic method combining an improved Ant Colony Extended algorithm with local search procedures dedicated to HSMPSP is developed. Finally, computational results on instances generated based on production data from an integrated steel mill in China indicate that the proposed algorithm is a promising solution specific to HSMPSP.     

论三峡水库“蓄清排浑”运用方式及其优化

泥沙问题是三峡工程的关键技术问题之一,在三峡工程论证和初步设计阶段提出水库采取"蓄清排浑"的运用方式,可以解决泥沙问题。2003年水库蓄水运用以来的实践表明,水库基本遵循了"蓄清排浑"调度运用原则,并根据上游来水来沙减少等新情况对水库运用方式进行了优化调整。本文系统分析了三峡水库"蓄清排浑"运行方式及其优化调整的利弊,包括提前5年实施175 m试验性蓄水、汛期水位动态变化、汛末提前蓄水等对水库淤积和坝下游河道演变的影响,提出了进一步优化水库调度方式,形成"蓄清排浑"运用的新模式,保持水库长期使用的建议,试图为三峡水库科学高效安全运用提供科技支撑。     

基于分支定界法的相控阵雷达事件调度算法

为解决相控阵雷达事件调度问题中调度成功率、时间偏移率与算法时效性三者之间的矛盾，本文提出一种基于分支定界法的调度算法；该算法首先在现有调度结果上调取所有可执行事件，即获得若干"节点"，多步递推后由多"层"节点形成若干条备选"分支"，扩大解空间范围，提高算法性能；然后通过"删减"操作删减掉收益较低分支，将解空间控制在一适当范围内，减小搜索盲目性，降低算法计算量.仿真实验表明，与基于综合优先级算法的调度结果相比，利用本文算法调度时调度成功率提升了52%；与基于时间指针算法的调度结果相比，本身算法时间偏移率降低了61%；与基于遗传算法的调度结果相比，本文算法调度耗时仅为前者1~2%.