Skip to Main Content
A load-balancing dynamic scheduling (LBDS) algorithm is proposed in this paper, which is concentrated on the how-to-reschedule issue with interruptions of machine failures. It adjusts the original scheme based on the principle of balancing load and minimizing the makespan. Three rules are considered in our algorithm: (1) priority rule regarding makespan and due date, (2) priority rule regarding processing time and machine unused time segment, and (3) the rule that all machines will be added unused time segment if there is no matching one. The performance of this algorithm is compared with the traditional earliest-due-date-based scheduling strategy algorithms. Simulation results show that the proposed algorithm performs better in more balanced load and less changes to the original scheduling result.