Minimize Makespan of LED Sorting Process with Identical Parallel Machine

• Main Authors: Chen, Yi-Hao, 陳奕豪
• Other Authors: Chen, Sheng-I
• Format: Others
• Language: en_US
• Published: 2017
• Online Access: http://ndltd.ncl.edu.tw/handle/k3d7mx

碩士 === 國立交通大學 === 工業工程與管理系所 === 105 === The Light Emitting Diode (LED) sorting is the final operation in overall manufacturing process. An order is placed by the upper stream manufacturer, and the objective is to transfer dies from wafers to blue tapes in different grades. The processing time of sorter is affected by the die distributions of wafers. Decision makers aim to assign wafers to sorters that minimizes the completion time of an order. We formulate the decision as a mixed integer programming. We show that this problem is an extension of identical parallel machine scheduling problem with a symmetric issue causing poor performance for the branch-and-bound algorithms. Solution approaches integrated symmetry breaking constraints with binary search and Benders’ decomposition are proposed. Computational results show that our approaches enhance both runtime and solution quality for solving real-world problems.