IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Journals & Magazines > Electronics Letters ...> Volume:31 Issue:23 Help

Genetic algorithm for job shop scheduling problems based on two representational schemes

Full Text Sign-In or Purchase

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 $31
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)
Lae-Jeoung Park ; Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Cheol Hoon Park

The authors explain the application of a genetic algorithm (GA) to job shop scheduling problems with a new crossover and two kinds of mutation based on two representational schemes. Simulation results show that our genetic operators and representational schemes are very powerful and suitable to job shop scheduling problems

Published in:
Electronics Letters  (Volume:31 ,  Issue: 23 )

Date of Publication: 9 Nov 1995

Page(s):
2051 - 2053
ISSN :
0013-5194
INSPEC Accession Number:
5134558
Digital Object Identifier :
10.1049/el:19951385
Product Type:
Journals & Magazines
Date of Current Version :
06 August 2002
Issue Date :
9 Nov 1995
Sponsored by :
Institution of Engineering and Technology

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.