Constraint-Based Genetic Algorithms for Machine Requirement of Semiconductor Assembly Industry: A Proposed Framework
Asia International Conference on Modelling & Simulation (2009)
Bandung, Bali, Indonesia
May 25, 2009 to May 29, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AMS.2009.119
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.
Capacity Planning, Machine Allocation, Optimization Approach, Genetic Algorithm
Umi Kalsom Yusof, Safaai Deris, "Constraint-Based Genetic Algorithms for Machine Requirement of Semiconductor Assembly Industry: A Proposed Framework", Asia International Conference on Modelling & Simulation, vol. 00, no. , pp. 29-34, 2009, doi:10.1109/AMS.2009.119