| Summary: | 碩士 === 國立交通大學 === 管理學院碩士在職專班工業工程與管理組 === 93 === The manufacturing of TFT-LCD involves a cell process, one major operation of which is to mate a TFT plate with a CF (color filter) plate. A typical TFT/CF plate comprises 6-30 panels. Such a mated panel is defective in quality when any one of the two panels is defective. How to mate the TFT/LCD plates, also called the plate-mapping problem, is thus very important to achieve a high yield. The plate-mapping problem was modeled in literature as an integer program and solved by the Hungarian method. By simulation, we find that there exist a great multiple solutions in the integer problem. Each of these solutions, though with the same yield, requires different number of loading/unloading operations. This research proposes an more comprehensive integer program (CIP) in order to identify a solution with highest mapping yield as well as with fewest number of loading/unloading requirements. The computation time required to solve the CIP may be quite lengthy. A heuristic procedure, called Tune_Martix, is developed to enhance the CIP in order to quickly identify a satisfactory one from the multiple solutions.
|
|---|
