论文标题
新颖的合奏协作方法，用于动态调度问题
Novel ensemble collaboration method for dynamic scheduling problems
论文作者
论文摘要
动态调度问题是许多实际应用程序的重要优化问题。由于在动态调度中并非所有信息都在开始时可用，因此通常通过派遣规则（DRS）来解决此类问题，这些规则会在系统执行时创建时间表。最近，DRS已通过基因编程成功开发。但是，单个DR可能无法有效地解决不同的问题实例。因此，许多研究集中在通过组建合奏来协作使用DRS。在本文中，提出了一种用于动态调度的新颖集合协作方法。在此方法中，DRS在每个决策点独立应用，以为所有当前发布的作业的时间表创建时间表。基于这些模拟，确定哪个博士做出了最佳决定，并应用了决定。结果表明，对于不同的合奏尺寸，合奏很容易胜过单个DR。此外，结果表明，从一组独立发展的DRS创建好的合奏相对容易。
Dynamic scheduling problems are important optimisation problems with many real-world applications. Since in dynamic scheduling not all information is available at the start, such problems are usually solved by dispatching rules (DRs), which create the schedule as the system executes. Recently, DRs have been successfully developed using genetic programming. However, a single DR may not efficiently solve different problem instances. Therefore, much research has focused on using DRs collaboratively by forming ensembles. In this paper, a novel ensemble collaboration method for dynamic scheduling is proposed. In this method, DRs are applied independently at each decision point to create a simulation of the schedule for all currently released jobs. Based on these simulations, it is determined which DR makes the best decision and that decision is applied. The results show that the ensembles easily outperform individual DRs for different ensemble sizes. Moreover, the results suggest that it is relatively easy to create good ensembles from a set of independently evolved DRs.
