By Topic

Research on the Manufacturing System Production Scheduling Problem Based on the Genetic Algorithm

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

1 Author(s)
Ying Shi ; Sch. of Manage. Sci. & Eng., Zhengzhou Inst. of Aeronaut. Ind. Manage., Zhengzhou, China

Scheduling problem of material processing is one of the intellectual scheduling problems and its model is as general as any other practical problem. The current theoretical research result of scheduling problems is mainly about material processing which represents the scheduling problems based on minimum completing time. Genetic Algorithm is a kind of random searching method that imitates creatures' natural evolution and it has been applied to job shop scheduling in recent years. Taking a job-shop for example, Genetic Algorithm was used to solve the job-shop scheduling problems. The algorithm scheme was proposed, and the proposed genetic algorithm was run. A satisfactory solution could be quickly got.

Published in:

Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on  (Volume:2 )

Date of Conference:

23-24 Oct. 2010