Cart (Loading....) | Create Account
Close category search window

A scheduling method in semiconductor manufacturing lines based on genetic algorithm and simulated annealing 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
$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

4 Author(s)
Tang Chun-hui ; Sch. of Opt.-Electr. & Comput. Eng., Univ. of Shanghai for Sci. & Technol., Shanghai, China ; Qian Yu-Liang ; Zhu Jun ; Yan Shu-jia

Semiconductor manufacturing is one of the most complex manufacturing process. And job scheduling is a major problem in the semiconductor operation. A method of job scheduling in semiconductor manufacturing lines is proposed based on genetic algorithm and simulated annealing algorithm. Firstly each job is given a set of machine processing set* based on genetic algorithm, then the processing sequence of each machine can be arranged based on simulated annealing. This paper presents the reason and the solution in detail. The Minifab model is solved by the method and the result proves that this method is effective.

Published in:

Information Networking and Automation (ICINA), 2010 International Conference on  (Volume:1 )

Date of Conference:

18-19 Oct. 2010

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.