Dynamic Scheduling of Dual-Resource Constrained Blocking Job Shop

A dynamic scheduling problem of blocking job shop constrained by machines and workers is studied based on genetic algorithm and simulated annealing algorithm (GASA). The problem is characterized by two resources and no storage buffer, and different disturbances. The objective is to minimize the completing time. The static scheduling results are obtained based on GASA, and the dynamic scheduling results are given according to the disturbance type. Judging whether it is rescheduled or minor adjusted according to the influence to the completing time. If it has little influence to the completion time, try not to disorder the original scheduling result, otherwise, it is rescheduled. When these factors are considered, a more effective schedule result can be obtained based on the method proposed in this paper. The performance of the method is proved based on two cases, and the results show that the method proposed in this paper is effective and feasible.