簡易檢索 / 詳目顯示

回結果列表
研究生： 賴義敦
YI-DUN LAI
論文名稱： 應用禁忌搜尋演算法於TFT-LCD彩色濾光片廠先進規劃排程系統之研究
Application of Tabu-Search Algorithm in Advanced Planning and Scheduling System for TFT-LCD Color Filter Fabs
指導教授： 郭伯勳
Po-Hsun Kuo
陳建良
James C. Chen
口試委員: 陳子立
Tzu-Li Chen
學位類別： 碩士
Master
系所名稱： 管理學院 - 工業管理系
Department of Industrial Management
論文出版年： 2013
畢業學年度： 101
語文別： 英文
論文頁數： 42
中文關鍵詞： 彩色濾光片 、先進規劃排程 、產能規劃 、禁忌搜尋法
外文關鍵詞： Color Filter, Advanced Planning and Scheduling (APS), Capacity Planning, Tabu-Search
相關次數： 點閱：429  下載：0 
分享至:
查詢本校圖書館目錄 查詢臺灣博碩士論文知識加值系統 勘誤回報

    • 薄膜電晶體液晶顯示器(TFT – LCD)製造廠藉由許多方式來提高其生產力與產業競爭力，如縮短週期時間、改善製程、供應鏈整合與設施規劃等。本研究的個案廠建構一先進規劃排程(Advanced Planning and Scheduling, APS)系統，能同時考量訂單之間差異，進行每日有限產能規劃外，也導入啟發式演算法(Heuristic algorithm)中多運用於解決排程問題的禁忌搜尋法(Tabu-Search algorithm, TS)來作為系統優化方案。
    本系統以Microsoft Visual Basic for Application建置而成，不僅能將訂單依據製程特性自動分配到各生產線上，也能對產線進行產能平衡與訂單排序優化，現已部分上線實測於彩色濾光片(Color Filter, CF)製造廠。根據系統導入成果顯示，除可有效地協助4.5代CF廠以自動化方式產生排程結果，節省約83%的作業時間外，相較於原始排單方式，優化方案更能減少百分之六十以上之換線產能浪費，其改善程度相當顯著。

    Thin-Film Transistor Liquid Crystal Display (TFT-LCD) manufacturers improve their productivity and competitiveness by shortening the cycle time, increasing equipment utilization, integrating supply chain and planning facilities setups. This study is to develop an Advanced Planning and Scheduling (APS) system, which considers the difference between orders and limited capacity. Furthermore, Tabu-Search algorithm (TS) is used to solve scheduling problem.
    This APS system is built with Microsoft Visual Basic for Application. Not only does this system allow orders to be assigned automatically basing on the characteristics of the process, but it also optimizes the arrangement of orders. Presently, it is partially applied to a 4.5th generation Color Filter (CF) fab for a case study. Current results show that APS system can effectively assist in solving scheduling problem. With automated order sorting, it saves approximately 83% of working time in scheduling. In addition, compared to the results of original method, it reduces more than 60% of line-changing time. The degree of improvement is remarkable.

    摘要 I ABSTRACT II ACKNOWLEDGMENTS III CONTENTS IV LIST OF FIGURES VI LIST OF TABLES VII Chapter 1 INTRODUCTION 1 1.1 Background and motivation 1 1.2 Research objectives 4 Chapter 2 LITERATURE REVIEW 5 Chapter 3 Methodology 11 3.1 Caculation of daily loading 11 3.1.1 Order pre-treatment module (OPM) 12 3.1.2 System setting module (SSM) 13 3.1.3 Unalterable fortifications module (UFM) 14 3.1.4 Loading stacking module (LSM) 14 3.2 Balance of finite capacity 15 3.2.1 Line-changing waste module (LWM) 15 3.2.2 Forward scheduling module (FSM) 17 3.2.3 Backward scheduling module (BWM) 18 3.3 Optimization of scheduling results 21 3.3.1 Tabu-search (TS) 22 3.3.2 Parameter of TS 23 Chapter 4 Experiments and Results 27 4.1 Development of APS system 27 4.2 Influence of capacity balance and scheduling time 29 4.3 Influence of TS on scheduling results 31 Chapter 5 Conclusions and Future Research 36 REFERENCES 38

    1. Armentano, V.A. and Scrich, C.R., 2000. Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics, 63, 131-140.
    2. Arostegui, M.A., Kadipasaoglu, S.N. and Khumawala, B.M., 2006. An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems. International Journal of Production Economics, 103, 742–754.
    3. Bozejko, W., Pempera, J., and Smutnicki, C, 2013. Parallel tabu search algorithm for the hybrid flow shop problem. Computers and Industrial Engineering, 65, 466–474.
    4. Cao, D. and Chen, M., 2003. Parallel flow shop scheduling using tabu search. International Journal of Production Research, 41 (13), 3059-3073.
    5. Chan, T.S., Prakash, A., Ma, H.L. and Wong, C.S., 2013. A hybrid tabu sample-sort simulated annealing approach for solving distributed scheduling problem. International Journal of Production Research, 51 (9), 2602-2619.
    6. Chang, Y.J. and Yao, M.J., 2009. A genetic algorithm for solving the economic lot scheduling problem with reworks. Journal of the Chinese Institute of Industrial Engineers, 26 (5), 411-425.
    7. Chen, J.C., Chao, G.C., Sun, C.J., Chao, K.J., Chien, J.W., Chen, C.C., Mo, C.N., Peng, T.W., Wei, Y.Y., Feng, C.H., Liu, Y.C. and Chiang, M.T., 2009. Effective order assignment for color filter fabs. SID Symposium Digest of Technical Papers, 69, 1309-1312.
    8. Chen, S.H., Chang, C.K. and Kuo, C.L., 2005. Optimal scheduling in color filter manufacturing. Journal of the Chinese Institute of Industrial Engineers, 22 (4), 301-308.
    9. Chen, W.L., Huang, C.Y. and Lai, Y.C., 2009. Multi-tier and multi-site collaborative production: Illustrated by a case example of TFT-LCD manufacturing. Computers and Industrial Engineering, 57 (1), 61-72.
    10. Condotta, A., Knust, S., Meier, D. and Shakhlevich, N.V., 2013. Tabu search and lower bounds for a combined production–transportation problem. Computers and Operations Research, 40, 886–900.
    11. Glover, F., 1995. Genetic algorithm and tabu search method hybrids for optimization. Computers and Operations Research, 22 (1), 111–134.
    12. Kacem, I., Hammadi, S. and Borne, P., 2002. Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems. IEEE Transactions on Systems, Man and Cybernetics, Part C, 32 (1), 408–419.
    13. Lamghari, A. and Dimitrakopoulos, R., 2012. A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty. European Journal of Operational Research, 222, 642–652.
    14. Li, J.Q., Pan, Q.K. and Liang, Y.C., 2010. An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering, 59, 647–662.
    15. Li, W.D. and McMahon, C.A., 2007. A simulated annealing-based optimization approach for integrated process planning and scheduling. International Journal of Computer Integrated Manufacturing, 20 (1), 80-95.
    16. Li, X.Y., Baki, F., Tian, P. and Chaouch, B.A., 2014. A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing. Omega, 42, 75–87.
    17. Lin, J.T., Chen, T.L. and Lin, Y.T., 2009. Critical material planning for TFT-LCD production industry. International Journal of Production Economics, 122 (2), 639-655.
    18. Lin, J.T., Wang, F.K. and Peng, C.C., 2008. Lot release times and dispatching rule for a TFT-LCD cell process. Robotics and Computer-integrated Manufacturing, 24 (2), 228-238.
    19. Lin, Y.K., Yeh, C.T. and Huang, P.S., 2013. A hybrid ant-tabu algorithm for solving a multistate flow network reliability maximization problem. Applied Soft Computing, 13, 3529–3543.
    20. Pa, P.S., 2013. High-performance micro-electrochemical machining via an optoelectronic irradiation and a graded modular tool. International Journal of Advanced Manufacturing Technology, 64, 179-186.
    21. Paquette, J., Cordeau, J.F., Laporte, G. and Pascoal, M.B., 2013. Combining multicriteria analysis and tabu search for dial-a-ride problems. Transportation Research Part B, 52, 1–16.
    22. Pitts, R.A. and Ventura, J.A., 2009. Scheduling flexible manufacturing cells using tabu search. International Journal of Production Research, 47 (24), 6907-6928.
    23. Ponsich, A. and Coello, C.A., 2013. A hybrid differential evolution—tabu search algorithm for the solution of job-shop scheduling problems. Applied Soft Computing, 13, 462–474.
    24. Rajkumar, R. and Shahabudeen, P., 2009. An improved genetic algorithm for the flow shop scheduling problem. International Journal of Production Research, 47 (1), 233-249.
    25. Safaei, N., Banjevic, D. and Jardine, K.S., 2012. Multi-threaded simulated annealing for a bi-objective maintenance scheduling problem. International Journal of Production Research, 50 (1), 63-80.
    26. Solimanpur, M. and Elmi, A., 2011. A tabu search approach for group scheduling in bufferconstrained flow shop cells. International Journal of Computer Integrated Manufacturing, 24 (3), 257-268.
    27. Sterzik, S. and Kopfer, H., 2013. A tabu search heuristic for the inland container transportation problem. Computers and Operations Research, 40, 953–962.
    28. Sureshkumar, M.R. and Madhusudanan, P.V., 2012. An efficient method to reduce relative capacity shortage using annualised hours planning. International Journal of Advanced Manufacturing Technology.
    29. Tsai, K.M. and Wang, S.C., 2009. Multi-site available-to-promise modeling for assemble-to-order manufacturing: An illustration on TFT-LCD manufacturing. International Journal of Production Economics, 117 (1), 174-184.
    30. Tseng, C.T. and Liao, C.J., 2008. A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks. International Journal of Production Research, 46 (17), 4655-4670.
    31. Wang, F.K., Du, T. and Wen, F.C., 2007. Product mix in the TFT-LCD industry. Production Planning & Control, 18 (7), 584-591.
    32. Wong, T.N., Zhang, S., Wang, G. and Zhang, L., 2012. Integrated process planning and scheduling – multi-agent system with two-stage ant colony optimization algorithm. International Journal of Production Research, 50 (21), 6188-6201.
    33. Wu, W.H., Xu, J.Y., Wu, W.H., Yin, Y.Q., Cheng, I.F. and Wu, C.C., 2013. A tabu method for a two-agent single-machine scheduling with deterioration jobs. Computers and Operations Research, 40, 2116–2127.
    34. Xia, W. J. and Wu, Z. M., 2005. An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems. Computers and Industrial Engineering, 48 (2), 409–425.
    35. Xing, L. N., Chen, Y. W. and Yang, K. W., 2009. Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling. Applied Soft Computing, 9, 362–376.
    36. Zhang, G. H., Shao, X. Y., Li, P. G. and Gao, L., 2009. An effective hybrid particle swarm optimization algorithm for multi-objective flexible job-shop scheduling problem. Computers and Industrial Engineering, 56 (4), 1309–1318.
    37. 王立志, 2003. 供應鏈實戰手冊：應用APS跨越MRP鴻溝, 鼎誠資訊.

    無法下載圖示 全文公開日期 2018/07/25 (校內網路)
    全文公開日期 本全文未授權公開 (校外網路)
    全文公開日期 本全文未授權公開 (國家圖書館：臺灣博碩士論文系統)
    QR CODE