An Assorted Dynamic Job-Shop Scheduling Algorithm Based on Impact Degree

An assorted dynamic job-shop scheduling algorithm based on impact degree is proposed in this paper. According to the craft´s constraint relations among jobs to be processed, the craft trees are drawn first, there will be N or more than N craft trees for N-jobs, and then the length of each craft tree´s critical path should be calculated. The longer the craft tree is, the more influence the craft tree will exert on the makespan, thus advancing the formula of impact degree. In terms of the impact degree, the craft tree can be classified into two sets: the first set and the second set. For the first set, the job is scheduled based on the priority schedule strategy whereas for the second set, the job is scheduled by adopting first fit insertion strategy on the basis of the scheduling results of the first set. This algorithm also takes into consideration the occurrence of emergencies by proposing the strategy of dynamic scheduling. The algorithm is efficient and very adaptable, so excellent results for solving dynamic job-shop scheduling problems can be achieved which has been and will be validated by experiments.