A load-balancing dynamic scheduling algorithm under machine failure conditions

Wenmin Miao; Dongni Li; Wei Zhang

doi:10.1109/ICICTA.2010.707

A load-balancing dynamic scheduling algorithm under machine failure conditions

Wenmin Miao^*, Dongni Li, Wei Zhang

^*Corresponding author for this work

School of Computer Science and Technology

Beijing Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

4 Citations (Scopus)

Abstract

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.

Original language	English
Title of host publication	2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010
Pages	144-147
Number of pages	4
DOIs	https://doi.org/10.1109/ICICTA.2010.707
Publication status	Published - 2010
Event	2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 - Changsha, China Duration: 11 May 2010 → 12 May 2010

Publication series

Name	2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010
Volume	1

Conference

Conference	2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010
Country/Territory	China
City	Changsha
Period	11/05/10 → 12/05/10

Keywords

Dynamic scheduling
Load-balancing
Machine failure

Access to Document

10.1109/ICICTA.2010.707

Cite this

Miao, W., Li, D., & Zhang, W. (2010). A load-balancing dynamic scheduling algorithm under machine failure conditions. In 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 (pp. 144-147). Article 5523483 (2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010; Vol. 1). https://doi.org/10.1109/ICICTA.2010.707

@inproceedings{76a1e56314ee4bd59f0ce87d9bc363bc,

title = "A load-balancing dynamic scheduling algorithm under machine failure conditions",

abstract = "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.",

keywords = "Dynamic scheduling, Load-balancing, Machine failure",

author = "Wenmin Miao and Dongni Li and Wei Zhang",

year = "2010",

doi = "10.1109/ICICTA.2010.707",

language = "English",

isbn = "9780769540771",

series = "2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010",

pages = "144--147",

booktitle = "2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010",

note = "2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010 ; Conference date: 11-05-2010 Through 12-05-2010",

}

Miao, W, Li, D & Zhang, W 2010, A load-balancing dynamic scheduling algorithm under machine failure conditions. in 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010., 5523483, 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010, vol. 1, pp. 144-147, 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010, Changsha, China, 11/05/10. https://doi.org/10.1109/ICICTA.2010.707

A load-balancing dynamic scheduling algorithm under machine failure conditions. / Miao, Wenmin; Li, Dongni; Zhang, Wei.
2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010. 2010. p. 144-147 5523483 (2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A load-balancing dynamic scheduling algorithm under machine failure conditions

AU - Miao, Wenmin

AU - Li, Dongni

AU - Zhang, Wei

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Dynamic scheduling

KW - Load-balancing

KW - Machine failure

UR - http://www.scopus.com/inward/record.url?scp=77955787226&partnerID=8YFLogxK

U2 - 10.1109/ICICTA.2010.707

DO - 10.1109/ICICTA.2010.707

M3 - Conference contribution

AN - SCOPUS:77955787226

SN - 9780769540771

T3 - 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010

SP - 144

EP - 147

BT - 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010

T2 - 2010 International Conference on Intelligent Computation Technology and Automation, ICICTA 2010

Y2 - 11 May 2010 through 12 May 2010

ER -

A load-balancing dynamic scheduling algorithm under machine failure conditions

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this