Application of local clustering organization to reactive job-shop scheduling

Application of local clustering organization to reactive job-shop scheduling
复制标题

DOI:
10.1007/s00500-014-1416-4
复制
发表时间:
2014-08
期刊:
影响因子:
4.1
通讯作者:
Yasumasa Tamura;H. Iizuka;Masahito Yamamoto;M. Furukawa
Yasumasa Tamura;H. Iizuka;Masahito Yamamoto;M. Furukawa
中科院分区:
计算机科学3区
文献类型:
--
作者:
Yasumasa Tamura;H. Iizuka;Masahito Yamamoto;M. Furukawa

文献摘要

被引文献

相似文献

本文研究了制造系统中的反应式调度问题。在实际生产中,由于工厂环境的不可预测性和多变性,预定的生产计划往往会发生变化。反应式调度(RS)是一种在不中断调度进程的情况下,科普变化的情况修改预定调度的方法。因此,RS需要一种方法来改进具有快速计算时间的调度。为了获得一种有效的RS方法,本文提出了一种新的RS方法使用局部聚类组织。最后通过数值实验验证了该方法的有效性.我们的结果表明,所提出的方法是更有效的方法,使用遗传算法。
This study focuses on the reactive scheduling in manufacturing systems. In practical situations, the predetermined schedule often changes under the influence of the unpredictable or variable environment in the factory. The reactive scheduling (RS) is a methodology to modify the predetermined schedule to cope with variable situations without suspending the proceeding of the processes on the schedule. Therefore, the RS requires a method to improve the schedule with fast computational time. To obtain an effective method for the RS, this paper proposes a novel RS method using local clustering organization. Also, this paper examines its effectiveness by a numerical experiment. Our results suggest that the proposed method is more effective than the method using genetic algorithm.