论文标题
循环工作店调度问题：工作店问题的新子类并应用模拟退火来解决该问题
The cyclic job-shop scheduling problem: The new subclass of the job-shop problem and applying the Simulated annealing to solve it
论文作者
论文摘要
在论文中，描述了调度问题的新方法。该方法涉及规划循环生产的问题，并建议考虑调度问题，例如k级的循环作业股问题，其中k是重申的次数。人们发现，只有一次迭代的计划比整个周期的规划效果不佳。在实验研究中，使用了通过操作研究库进行的许多工作店调度问题的测试实例。使用模拟退火来解决实例。该实验证明，提出的方法允许大幅提高循环调度的效率。
In the paper, the new approach to the scheduling problem are described. The approach deals with the problem of planning the cyclic production and proposes to consider such scheduling problem as the cyclic job-shop problem of the order k, where k is the number of reiterations. It was found out that planning of only one iteration of the loop is less effective than planning of the entire cycle. To the experimental research, a number of test instances of the job-shop scheduling problem by Operation Research Library were used. The Simulated Annealing was applied to solve the instances. The experiments proved that the approach proposed allows increasing the efficiency of cyclic scheduling significantly.
