Advanced planning and scheduling for TFT-LCD color filter fab with multiple lines

2013 ◽  
Vol 67 (1-4) ◽  
pp. 101-110 ◽  
Author(s):  
James C. Chen ◽  
PoTsang B. Huang ◽  
Ji-Geng Wu ◽  
Ken Y. Lai ◽  
Chih-Cheng Chen ◽  
...  
2010 ◽  
Vol 450 ◽  
pp. 361-364 ◽  
Author(s):  
James C. Chen ◽  
Ling Huey Su ◽  
Gary C. Chao ◽  
Chih Cheng Chen ◽  
Tzu Wei Peng ◽  
...  

This research proposed Advanced Planning and Scheduling (APS) system to effectively and efficiently balance machine loading for color filter fabrication plants in Thin Film Transistor - Liquid Crystal Display industry. APS uses six modules to estimate future equipment loading and calculate order due dates according to capacity limits by taking into account the due date and size of orders, as well as the capacity, loading, and yield of fabrication plants. These six modules include: Order Priority Module, WIP-Pulling Module, Order Release Module, Material Management Module, Workload Accumulation Module, and Workload Balance Module. A lot’s start processing time at each production step is selected leading to the best workload balance. Simulation and experimental design are used to evaluate the performance of APS. Production manager can use APS to improve color filter fabrication plants’ productivity and competitiveness.


2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Yunfang Peng ◽  
Dandan Lu ◽  
Yarong Chen

This paper deals with the advanced planning and scheduling (APS) problem with multilevel structured products. A constraint programming model is constructed for the problem with the consideration of precedence constraints, capacity constraints, release time and due date. A new constraint programming (CP) method is proposed to minimize the total cost. This method is based on iterative solving via branch and bound. And, at each node, the constraint propagation technique is adapted for domain filtering and consistency check. Three branching strategies are compared to improve the search speed. The results of computational study show that the proposed CP method performs better than the traditional mixed integer programming (MIP) method. And the binary constraint heuristic branching strategy is more effective than the other two branching strategies.


Sign in / Sign up

Export Citation Format

Share Document