单件车间生产作业计划再生方法研究

针对单件车间生产作业计划的再生问题，用ＶｉｓｕａｌＦｏｘｐｒｏ开发了一个时间调整算法和实现了禁忌搜索算法．当干扰发生时，前者用于无可替代机床情况下对受影响工序的开工时间和完工时间的调整；后者用于有可替代机床情况下对在替代机床上加工工件的排序．实验表明，它们能较好地解决各种情况下生产作业计划再生问题．

Study of Job Shop Rescheduling

Time modify and tabu search algorithms are realized in job shop rescheduling. The operations starting and completion time are calculated in the time modify algorithm when the sequence and all processing times are known. It can be applied to inflexible rescheduling. When the disturbance occurs, the affected operations time parameters can be modified. The tabu search algorithm used to solve combination optimization problem is applied to flexible rescheduling. When the disturbance occurs, the number of affected jobs is decided and the jobs on the substitute machine are resequenced. The experiment shows that the two algorithms can be used to solve rescheduling in all operations.