Site By: Lio Technolgies        
Javascript DHTML Drop Down Menu Powered by dhtml-menu-builder.com
Abstract Details
 
Title:
GENETIC ALGORITHM FOR MULTIPROCESSOR TASK SCHEDULING
Author:

Ritu Verma , Sunita Dhingra

Keywords:

Genetic Algorithm (GA), crossover, mutation, Multiprocessor task scheduling (MPTS), permutation flow shop scheduling

Abstract:
Multiprocessor task scheduling (MPTS) is an important and computationally difficult problem. Multiprocessors have emerged as a powerful computing means for running real-time applications especially due to limitation of uni-processor system for not having sufficient enough capability to execute all the tasks. This paper describes multiprocessor task scheduling in the form of permutation flow shop scheduling, which has an objective function for minimizing the makespan. Here, we will conclude how the performance of genetic algorithms (value of the makespan of the schedule) varies with the variation of Genetic Algorithm (GA) control parameters (population size, crossover probability and mutation probability).
Download Paper:
 
© Copyright 2011 IJCSMS - All rights reserved. Use of this Web site signifies your agreement to the terms and conditions.