Skip to main navigation Skip to search Skip to main content

Multi-objective evolutionary job-shop scheduling using jumping genes genetic algorithm

  • Kazi Shah Nawaz Ripon
  • , Chi-Ho Tsang
  • , Sam Kwong

Research output: Chapters, Conference Papers, Creative and Literary WorksRGC 32 - Refereed conference paper (with host publication)peer-review

Abstract

The Job-Shop Scheduling Problem (JSSP) is a hard combinatorial optimization problem. Several evolutionary approaches have been proposed to solve JSSP. But most of them are limited to single objective and fail in real-world applications, which naturally involve multiple objectives. In this paper, we present an evolutionary approach for solving multi-objective JSSP using Jumping Genes Genetic Algorithm (JGGA) that heuristically searches for the near-optimal solutions optimizing multiple criteria simultaneously. Experimental results reveal that our proposed approach can search for the near-optimal solutions by optimizing multiple criteria and also capable of finding a set of diverse and non-dominated scheduling solutions. © 2006 IEEE.
Original languageEnglish
Title of host publicationThe 2006 IEEE International Joint Conference on Neural Network Proceedings
PublisherIEEE
Pages3100-3107
ISBN (Print)0780394909, 9780780394902
DOIs
Publication statusPublished - 2006
Event2006 International Joint Conference on Neural Networks (IJCNN '06) - Vancouver, BC, Canada
Duration: 16 Jul 200621 Jul 2006

Publication series

Name
ISSN (Print)2161-4393
ISSN (Electronic)2161-4407

Conference

Conference2006 International Joint Conference on Neural Networks (IJCNN '06)
PlaceCanada
CityVancouver, BC
Period16/07/0621/07/06

Fingerprint

Dive into the research topics of 'Multi-objective evolutionary job-shop scheduling using jumping genes genetic algorithm'. Together they form a unique fingerprint.

Cite this