Back to search

North Dakota State University

Job Scheduling with Genetic Algorithm

Abstract

dc:description.abstract

In this paper, we have used a Genetic Algorithm (GA) approach for providing a solution to the Job Scheduling Problem (JSP) of placing 5000 jobs on 806 machines. The GA starts off with a randomly generated population of 100 chromosomes, each of which represents a random placement of jobs on machines. The population then goes through the process of reproduction, crossover and mutation to create a new population for the next generation until a predefined number of generations are reached. Since the performance of a GA depends on the parameters like population size, crossover rate and mutation rate, a series of experiments were conducted in order to identify the best parameter combination to achieve good solutions to the JSP by balancing makespan with the running time. We found that a crossover rate of 0.3, a mutation rate of 0.15 and a population size of 100 yield the best results.

Degree

thesis:*
Grantor dc:publisher
North Dakota State University
Year dc:date.issued
2013

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Barat, Debarshi

Subjects

dc:subject × 2

Rights

dc:rights
Statement dc:rights
  • NDSU Policy 190.6.2

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/10365/22775

Chain of custody

source
Harvested from
North Dakota State University
Base URL
library.ndsu.edu/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Barat, Debarshi. Job Scheduling with Genetic Algorithm. North Dakota State University, 2013. https://hdl.handle.net/10365/22775