Optimal Scheduling in Color Filter Manufacturing

彩色濾光片產業製程之最佳化

10.29977/JCIIE.200507.0004

陳世輝(Shyh-Huei Chen)；張智凱(Chih-Kai Chang)；郭哲良(Che-Liang Kuo)

彩色濾光片 ； 流程式排程問題 ； 整備時間 ； 蟻群演算法 ； 延遲和提早懲罰 ； ant colony optimization ； color filter process ； earliness/tardiness penalties ； flow shop scheduling ； setup times

工業工程學刊

22卷4期（2005 / 07 / 01）

301 - 308

英文

TFT-LCD是台灣於本世紀中新興的一項產業。在這複雜的產業中結合了半導體產業、化學材料產業及光電產業，彷彿一個小型的供應鏈體系。其中，光電產業中之彩色濾光片(Color Filter)，除了在材料成本中佔有比例最高之外，也是目前液晶顯示器彩色化之主要工具。目前，彩色濾光片產業的主要問題在於每次更改製品別所需的整備時間(Setup Time)極長，由於機台昂貴而使折舊成本相對提高。為了能夠降低這方面的成本，減少「換線」次數便成了彩色濾光片產業重要的課題。本研究將針對考量整備時間和工作次序相依的流程式工廠排程問題，從蟻群演算法(Ant Colony Optimization)中找到合適之排程模式，併入訂單機制求得最小延遲和提早懲罰值(Earliness/Tardiness Penalties)，以回應實際產業與顧客訂單交期。演算法的設計是強調如何處理此排程問題的一些實際情況與要求。

A scheduling problem of the color filter manufacturing in TFT LCD industry is considered in this paper. The problem under consideration is a flow shop scheduling problem with sequence-dependent setup times. The objective is to schedule the order completion times as close to the due dates as possible to minimize the earliness/tardiness penalties, subject to the production capacity constraints and fulfillment of production demands. A modified ant colony optimization (ACO) approach is proposed to find the optimal schedule for this problem. The proposed approach was designed to focus on the practical requirements in the color filter process.

1. Allahverdi, A.,J. Gupta,T. Aldowaisan(1999).A review of scheduling research involving setup considerations.OMEGA the International Journal of Management Science,27,219-239.
2. Bullnheimer, B.,R. Hartl,C. Strauss(1999).An improved ant system algorithm for the vehicle routing problem.Annals of Operations Research,89,319-334.
3. Dorigo, M.(1992).Optimization, learning and natural algorithm.Italy:Dipartimento di Elettronica, Politecnico di Milano.
4. Dorigo, M.,L. Gambardella(1997).Ant colonies for the traveling salesman problem.BioSystems,43,73-81.
5. Dorigo, M.,V. Maniezzo(1996).The ant system: optimization by a colony of cooperating agents.IEEE Transactions on Systems, Man and Cybernetics B,26(1),29-41.
6. Gen, M.,R. Cheng(1997).Genetic Algorithms and Engineering Design.New York:John Wiley & Sons.
7. Glover, F.,M. Laguna.(1999).Tahu Search, Kluwer Academic Publishers..Boston:
8. Jeong, B.,S. Kim,Y. Lee(2001).An assembly scheduler for TFT-LCD manufacturing.Computers & Industrial Engineering,41,37-58.
9. Jeong, B.,S. Sim,H. Jeong,S.W. Kim(2002).An available-to-promise system for TFT-LCD manufacturing in supply chain.Computers & Industrial Engineering,43,191-212.
10. Merkle, D.,M. Middendorf(2000).An ant algorithm with a new pheromone evaluation rule for total tardiness problems.Lecture Notes in Computer Science,1803,287-296.
11. Pinedo, M.(2002).Scheduling-Theory, Algorithm and Systems.New Jersey:Prentice Hall.
12. Potts, C.,M. Kovalyov(2000).Scheduling with batching: a review.European Journal of Operational Research,120,228-249.
13. Rajendran C.,H, Ziegler(2004).An-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs.European Journal of Operational Research,155,426-438.
14. Shin, H.,V. Leon(2004).Scheduling with product family set-up times: an application in TFT LCD manufacturing.International Journal of Production Research,42,4235-4248.
15. Stützle, T.,H. Hoos.(2000).The MAX-MIN Ant System.Future Generation Computer Systems,16,889-914.
16. Stützle. T.(1998).An ant approach for the flow shop problem.Proceedings of the 6th European Congress on Intelligent Techniques and Soft Computing,3,1560-1564.
17. Sule, R.(1997).Industrial Scheduling.Boston:PWS publishing company.
18. T`kindt. V.,N. Monmarché,F. Tercinet,D. Laügt(2002).An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem.European Journal of Operational Research,142,250-257.

1. Ali Allahverdi(2008).THREE-MACHINE FLOWSHOP SCHEDULING PROBLEM TO MINIMIZE MAKESPAN WITH BOUNDED SETUP AND PROCESSING TIMES.工業工程學刊,25(1),52-61.
2. (2008)。TFT-LCD生產之多廠區訂單配置與排程最適化研究。德明學報，31，1-16。