By Topic

A genetic algorithm with a machine order-based representation scheme for a class of job shop scheduling problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Song, Y. ; Sch. of Inf. & Software Eng., Ulster Univ., Jordanstown, UK ; Hughes, J.G.

In this paper, we propose a genetic algorithm (GA) with a machine order-based representation scheme (MORS) and apply it to a class of job shop scheduling problems (JSSP), the n/m/J/Cmax problems, where n⩾3*m. The proposed approach uses a special genotype-to-phenotype decoding method which guarantees to generate feasible schedules for any chromosomes and aims at using genetic algorithm to solve some kind of large JSSP with reasonable solution and reasonable computation time. The approach has been tested with three sets of benchmark JSSP. Experimental results show that the GA with MORS (MORS-GA) can solve the benchmark JSSP of the type mentioned above to optimal or near-optimal with simple GA-operators and fewer objective evaluations. Compared with other GA methods, MORS-GA is shown to be a competitive and promising approach for solving this kind of JSSP

Published in:

American Control Conference, 1999. Proceedings of the 1999  (Volume:2 )

Date of Conference:

2-4 Jun 1999