Dynamic real-time scheduling for multi-processor tasks using genetic algorithm

Shu Chen Cheng, Yueh Min Huang

Research output: Contribution to journalConference article

11 Citations (Scopus)

Abstract

With the exponential growth of time to obtain an optimal solution, the job-shop scheduling problems have been categorized as NP-complete problems. The time complexity makes the exhaustive search for a global optimal schedule infeasible or even impossible. Recently, genetic algorithms have shown the feasibility to solve the job-shop scheduling problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators. It is often the case that the gene expression or the genetic operators need to be specially tailored to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This paper presents a GA-based approach with a feasible energy function to generate good-quality schedules. This work concentrates mainly on dynamic real-time scheduling problems with constraint satisfaction. In our work, we design an easy-understood genotype to generate legal schedules and induce that the proposed approach can converge rapidly to address its applicability.

Original languageEnglish
Pages (from-to)154-160
Number of pages7
JournalProceedings - International Computer Software and Applications Conference
Volume1
Publication statusPublished - 2004 Dec 1
EventProceedings of the 28th Annual International Computer Software and Applications Conference, COMPSAC 2004 - Hong Kong, China, Hong Kong
Duration: 2004 Sep 282004 Sep 30

Fingerprint

Genetic algorithms
Scheduling
Gene expression
Computational complexity
Job shop scheduling

All Science Journal Classification (ASJC) codes

  • Software
  • Computer Science Applications

Cite this

@article{dcbfab87c6244e40a2c59cb44deced9b,
title = "Dynamic real-time scheduling for multi-processor tasks using genetic algorithm",
abstract = "With the exponential growth of time to obtain an optimal solution, the job-shop scheduling problems have been categorized as NP-complete problems. The time complexity makes the exhaustive search for a global optimal schedule infeasible or even impossible. Recently, genetic algorithms have shown the feasibility to solve the job-shop scheduling problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators. It is often the case that the gene expression or the genetic operators need to be specially tailored to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This paper presents a GA-based approach with a feasible energy function to generate good-quality schedules. This work concentrates mainly on dynamic real-time scheduling problems with constraint satisfaction. In our work, we design an easy-understood genotype to generate legal schedules and induce that the proposed approach can converge rapidly to address its applicability.",
author = "Cheng, {Shu Chen} and Huang, {Yueh Min}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "1",
pages = "154--160",
journal = "Proceedings - IEEE Computer Society's International Computer Software and Applications Conference",
issn = "0730-6512",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Dynamic real-time scheduling for multi-processor tasks using genetic algorithm. / Cheng, Shu Chen; Huang, Yueh Min.

In: Proceedings - International Computer Software and Applications Conference, Vol. 1, 01.12.2004, p. 154-160.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Dynamic real-time scheduling for multi-processor tasks using genetic algorithm

AU - Cheng, Shu Chen

AU - Huang, Yueh Min

PY - 2004/12/1

Y1 - 2004/12/1

N2 - With the exponential growth of time to obtain an optimal solution, the job-shop scheduling problems have been categorized as NP-complete problems. The time complexity makes the exhaustive search for a global optimal schedule infeasible or even impossible. Recently, genetic algorithms have shown the feasibility to solve the job-shop scheduling problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators. It is often the case that the gene expression or the genetic operators need to be specially tailored to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This paper presents a GA-based approach with a feasible energy function to generate good-quality schedules. This work concentrates mainly on dynamic real-time scheduling problems with constraint satisfaction. In our work, we design an easy-understood genotype to generate legal schedules and induce that the proposed approach can converge rapidly to address its applicability.

AB - With the exponential growth of time to obtain an optimal solution, the job-shop scheduling problems have been categorized as NP-complete problems. The time complexity makes the exhaustive search for a global optimal schedule infeasible or even impossible. Recently, genetic algorithms have shown the feasibility to solve the job-shop scheduling problems. However, a pure GA-based approach tends to generate illegal schedules due to the crossover and the mutation operators. It is often the case that the gene expression or the genetic operators need to be specially tailored to fit the problem domain or some other schemes may be combined to solve the scheduling problems. This paper presents a GA-based approach with a feasible energy function to generate good-quality schedules. This work concentrates mainly on dynamic real-time scheduling problems with constraint satisfaction. In our work, we design an easy-understood genotype to generate legal schedules and induce that the proposed approach can converge rapidly to address its applicability.

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

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

M3 - Conference article

AN - SCOPUS:18744380988

VL - 1

SP - 154

EP - 160

JO - Proceedings - IEEE Computer Society's International Computer Software and Applications Conference

JF - Proceedings - IEEE Computer Society's International Computer Software and Applications Conference

SN - 0730-6512

ER -