Application Genetic Algorithm for the production scheduling research: A Case Study of SMT Process

• Main Authors: Nien-Chung Chng, 鄭念中
• Other Authors: 邱昭彰
• Format: Others
• Language: zh-TW
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/79218423395183233737

碩士 === 元智大學 === 資訊管理學系 === 100 === Scheduling problem contains many different types of performance criteria. In real environment, almost are the parallel-machine, such as the unrelated parallel machines problems are combinatorial optimization problem. A few exceptions, such as problems are NP-Hard. The research is using Genetic Algorithm construction a scheduling model to solve the production scheduling, a case SMT of electronics manufacturing. The performance criteria，first consider single performance measure of sales order fill rate, then consider multi-objective performance , combine the Makespan and Machines idle time as the scheduling performance indicators . By setting the Genetic Algorithms system parameters and multi-objective combination of different weights , improve the quality of solving model. The experimental results show that maximizing a single performance indicators, compared with multi-objective performance indicators set by different weights, multi-objective can effectively improve the schedule for solving capabilities.