By Topic

Constraint-Based Genetic Algorithms for Machine Requirement of Semiconductor Assembly Industry: A Proposed Framework

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)
Yusof, U.K. ; Sch. of Comput. Sci., Univ. Sains Malaysia, Penang ; Deris, S.

Having an accurate capacity planning is always an ultimate goal for semiconductor manufacturing. However, as capacity planning is highly affected by the demand forecast uncertainty, there is a necessity to make the gap closer to ensure profitability. The paper defines the problems faced by a semiconductor company in handling capacity planning and balancing the capital investment cost against the risk of losing revenue. Machine allocation in capacity planning is a process to determine mixture of a machine types that satisfy all precedence and resource constraints and minimize the total machines allocation. We adopt constraint-based genetic algorithm (GA) to solve this optimization problem with the focus on mapping the right chromosome representation to the domain problem. The method is chosen to allow the running of GA in original form as well as to ensure the computation is straight forward and simple.

Published in:

Modelling & Simulation, 2009. AMS '09. Third Asia International Conference on

Date of Conference:

25-29 May 2009