By Topic

Apply Inversion Order Number Genetic Algorithm to the 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
$33 $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

3 Author(s)
Xiaomei Yang ; Complex Syst. & Comput. Intell. Lab., Taiyuan Univ. of Sci. & Technol., Taiyuan, China ; Jianchao Zeng ; Jiye Liang

Through analyzing the present genetic operators to solve the job shop scheduling problem, a inversion order number genetic algorithm is proposed. In view of the quality of the inversion order number, this algorithm measures the population diversity by the relative inversion order number. It uses the information provided by the inversion order number of the individual and the offspring is generated. This algorithm not only satisfies the characteristic of the job shop scheduling problem, but also develops the search capacity of genetic algorithm. The computation results validate the effectiveness of the proposed algorithm.

Published in:

Genetic and Evolutionary Computing, 2009. WGEC '09. 3rd International Conference on

Date of Conference:

14-17 Oct. 2009