EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1293. An Efficient O(n^2) Algorithm for Solving the Dynamic Matching Problem in TFT-LCD Cell Assembly Process
Invited abstract in session WC-29: Optimization issues on graphs I (Contributed), stream Combinatorial Optimization.
Wednesday, 12:30-14:00Room: 157 (building: 208)
Authors (first author is the speaker)
| 1. | Shine-Der Lee
|
| Industrial & Information Management, National Cheng Kung University | |
| 2. | Peggy LEE
|
| Graduate school of Industrial Management, National Cheng Kung University |
Abstract
A polynomial time O(n^2) algorithm for finding the optimum matching of panels to assemble TFT-LCD (Thin Film Transistor-Liquid Crystal Display) is presented in this talk. In the TFT-LCD cell assembly process, both TFT array and color filter (CF) substrate panels are pre-cut into several equal sized sub-panels. After the precut, two sub-panels are matched to produce the final product, i.e., the LCD. We explore the special structure of a novel linear programming formulation, where the sub-panels are sorted by the number of good displays via lexico-graphic order, based on the location of good/bad displays on each sub-panel. Enhanced by these new properties, efficient solution procedures to find the optimum matching are developed for real time operation and sequencing in the assembly process. Computational experiments with several common pre-cut types and different batch sizes of panels have indicated that the solution procedures are efficient and effective.
Keywords
- Production and Inventory Systems
- Optimization Modeling
- Algorithms
Status: accepted
Back to the list of papers