By Topic

A Load-Balancing Dynamic Scheduling Algorithm under Machine Failure Conditions

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wenmin Miao ; Sch. of Comput. Sci., Beijing Inst. of Technol., Beijing, China ; Dongni Li ; Wei Zhang

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.

Published in:

Intelligent Computation Technology and Automation (ICICTA), 2010 International Conference on  (Volume:1 )

Date of Conference:

11-12 May 2010