基于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.     

Distributed two‐stage state estimation with event‐triggered strategy for multirate sensor networks

This paper investigates the state estimation issue for a class of wireless sensor networks (WSNs) with the consideration of limited energy resources. First, a multirate estimation model is established, and then, a new event‐triggered two‐stage information fusion algorithm is developed based on the optimal fusion criterion weighted by matrices. Compared with the existing methods, the presented fusion algorithm can significantly reduce the communication cost in WSNs and save energy resources of sensors efficiently. Furthermore, by presetting a desired containment probability over the interval [0,1] with the developed event‐triggered mechanism, one can obtain a suitable compromise between the communication cost and the estimation accuracy. Finally, a numerical simulation for the WSN tracking system is given to demonstrate the effectiveness of the proposed method.     

灾害孤岛潜势风险分群与降雨警戒值探讨

台湾本身地貌特性以及近年来强降雨事件发生频繁,促使山区地带发生复合式灾害,如崩塌、泥石流与山洪等,因此灾害孤岛效应有必要仿效泥石流以及洪水灾害,制定出参考警戒值以及警戒线,将有助于防灾决策、救难资源投入以及灾害风险判释。本文针对台湾发生过灾害孤岛效应的114个村进行分析,且着重于首次发生灾害的台风降雨事件。首先通过群集分析并依照各样本的6个灾因指标进行分类,群集结果显示可分为8个群,并再以象限分布描述各群的潜势相对风险。采用2004—2015年台风降雨事件的观测雨量数据,并利用距离反比权重法,得出各村的累积降雨量(R)与最大时雨量(I)。整合各群集样本雨量数据后,使用台湾水土保持局使用的RTI模式概念,计算出各群集之RTImin、RTI30、RTI50和RTI70,以绘制低风险区(0～30%)、中风险区(30～70%)和高风险区(70%～100%),其中着重探讨灾害孤岛事件的下限值RTImin,以便可得知最易发生灾害的群集。结果显示,各群的潜势风险反映RTImin的效果良好,如潜势风险越高则其RTImin值越低,即雨量驱动灾害发生的条件较低。群集中,第1与2群为低风险群、第3、5与6群为中风险群、第4、7与8群为高风险群,仅第5群无法透过RTImin验证潜势风险关系,故本文挑选的6项灾因指标,为辨别灾害孤岛效应潜势等级的重要因子。     

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.