臺灣博碩士論文加值系統

TFT-LCD產業為政府「兩兆雙星」產業其中之一兆產業，TFT-LCD製造廠近年積極建廠擴產，國內TFT-LCD設備製造業因而發展迅速。因為組裝TFT-LCD設備所在的廠房建置成本高昂，使得場地空間為一項重要且受限制的資源。因此如何在場地限制下妥善安排訂單，在TFT-LCD製造廠中是一項重要的管理工作。
從文獻探討發現，過去這類研究相當稀少，因此本論文研究探討在場地限制下的訂單排程架構，並提出「西北角搜尋法」，能以電腦程式輔助，尋找工廠中適合訂單組裝的位置。排程相關文獻提到，排程法則為一項快速而有效的排程管理方法。因此本研究以不同排程法則作為安排訂單進入工廠的順序，配合西北角法則安排訂單在工廠的位置，探討排程法則的對於排程績效的影響。
本研究以常用的EDD, FCFS, SPT, LPT法則，加上本研究提出的SSR以及LSR共六項排程法則，應用隨機集區實驗（randomized block design）設計，以電腦程式進行重複實驗。實驗結果顯示，不同排程法則應用於場地空間排程，對於排程績效有顯著影響。
本研究起因於TFT-LCD設備製造業，探討訂單排程在場地限制下的問題，提出西北角搜尋法，配合排程法則來安排訂單，可以預先進行績效評估，做為決策者參考的依據。研究結果發現，本論文提出的方法亦可應用於有場地限制問題的設備組裝業。

In Taiwan, the government's Two Trillion, Twin Star industry plan has prompted the development of the large-sized TFT-LCD panel industry. The new equipment demand from TFT-LCD manufacturers drove local TFT-LCD equipment makers growing rapidly. TFT-LCD equipments have to be assembled in high-cost clean room. The factory space for assembly is one of critical resources for TFT-LCD equipment makers. In the past, many researches discussed job shop or single machine scheduling problems with time constraint. In machinery, factory space constrains scheduling. The most common way for scheduling jobs in machinery industry is to assign jobs based on experience. Therefore, the main purpose of this research is to derive a method to schedule jobs for machinery industry, develop new dispatching rules, and investigate effects of traditional and new dispatching rules under different performance measures. In this research, we develop an algorithm, Northwest corner searching algorithm to schedule jobs into the shop floor. In addition, two space dispatching rules, largest space requirement (LSR) and smallest space requirement (SSR), are also developed for sequencing jobs. We employ randomized block design to investigate how different dispatching rules perform under different measures. After the simulation experiments and analysis of results, the LSR rule performs well under two performance measures (makespan and mean space utilization) and EDD performs well under three performance measures (makespan, total tardiness and mean flow time). We find dispatching rules affect most of performance measures significantly (except number of tardy jobs). The idea of this study caused from TFT-LCD equipment industry, but the algorithm and scheduling program can applied to similar machinery industry. They can help production planers to analyze the performances of scheduling in advance.

摘要 I
ABSTRACT II
致謝 III
目錄 IV
圖目錄 VI
表目錄 VII
第一章 緒論 1
1.1 研究背景與動機 1
1.2研究問題描述 2
1.3研究目的 7
1.4研究問題定義與研究限制 7
1.5研究方法與步驟 7
1.6 論文架構 8
第二章 文獻探討 10
2.1 相關文獻回顧與探討 10
2.1.1 動態設施規劃相關文獻探討 10
2.1.2 家族式物件排程相關文獻 11
2.1.3 與本研究類似之文獻 12
2.2 場地空間安排法則、排程法則與績效指標相關文獻探討 12
2.2.1 空間規劃法則 12
2.2.2 排程（派工）法則 13
2.2.3 績效指標 17
2.2.4 實驗方法 20
第三章 場地限制下之訂單排程 21
3.1研究假設 21
3.2場地限制下之訂單排程步驟 21
3.3 排程法則 24
3.4 場地安排流程 24
3.4.1 訂單、組裝場地及接單描述 24
3.4.2 目視場地安排方法 26
3.4.3 目視場地安排法之缺點 27
3.5 西北角法則 28
3.5.1 場地、工作所需空間 28
3.5.2 不同空間搜尋法 29
3.5.3 西北角搜尋法 30
3.6 場地限制下的訂單排程軟體 32
3.6.1 軟體功能 32
3.6.2 軟體架構 32
第四章 實驗設計 34
4.1 訂單庫資料設計 34
4.1.1 訂單資料 34
4.1.2 訂單工作所需空間 35
4.1.3 訂單複雜度設計 35
4.2 實驗設計 36
4.2.1 排程法則 36
4.2.1 場地面形狀面積 36
4.3 假設檢定 37
4.4 實驗流程 37
4.5 實驗結果 40
第五章 結論與建議 43
5.1 研究結論 43
5.2 建議 43
參考文獻 45
附錄 西北角搜尋法圖解 49

中文部分：
1.王聖元(2002)，以時程為基礎之動態設施配置，國立成功大學土木工程研究所碩士論文。
2.林季蓉(2005)，以資源基礎理論探討台灣TFT-LCD廠商合併競爭優勢之研究，立德管理學院工業管理研究所碩士論文。
3.林義堅(2004)，派工法則對加班模式影響之分析，臺灣大學資訊管理研究所碩士論文。
4.泰菱系統工程股份有限公司網站 http://www.top-line.com.tw/ (2006)。
5.張方(2004)，光電與半導體設備技術專輯，機械工業雜誌，258： 102-265。
6.陳泳州(2005)，流通業POS 系統再造之設計與實作-以百貨公司為例，靜宜大學資訊管理研究所碩士論文。
7.陳傑富(2005)，使用黏性阻尼器於晶圓廠之耐震補強設計，台灣科技大學營建工程研究所碩士論文。
8.陳建良(1995)，排程概述，機械工業雜誌，122-137。
9.湯璟聖(2003)，動態彈性平行機群排程的探討，中原大學工業工程研究所。
10.經濟部技術處產業技術知識服務計畫（ITIS）產業資訊服務網. http://www.itis.org.tw/ (2006)。
英文部分
11.Al-Turki, U., Andijani, A., & Arifulsalam, S. (2004), A new dispatching rule for the stochastic single-machine scheduling problem. Simulation, 80(3), 166-170.
12.Baker, K.R. (1974), Introduction to Sequencing and Scheduling, Wiley, New York
13.Baker, K. R. (1984), Sequencing Rules and Due-Date Assignments in a Job Shop. Management Science, 30(9), 1093.
14.Baker, K. R. (1992), Elements of Sequencing and Scheduling: John Wiley & Sons, New York.
15.Balakrishnan, J., Cheng, C. H., & Lau, C. M. (2003), A hybrid genetic algorithm for the dynamic plant layout problem. International Journal of Production Economics, 86(2), 107-120.
16.Barrett, R. T., & Kadipasaoglu, S. N. (1990), Dispatching rules for a dynamics flow shop. Production and Inventory Management Journal, 31(1), 54-58.
17.Belov, G., & Scheithauer, G. (2002), A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. European Journal of Operational Research, 141(2), 274-294.
18.Brusco, M. J. (2004), Optimal solution methods for the minimum-backtracking row layout problem. IIE Transactions, 36(2), 181-189.
19.Chen, S.-J., & Lin, L. (1999), Reducing total tardiness cost in manufacturing cell scheduling by a multi-factor priority rule. International Journal of Production Research, 37(13), 2939-2956.
20.Chern, C. C. (2003), Family-based scheduling rules of a sequence-dependent wafer fabrication system. IEEE Transactions on Semiconductor Manufacturing, 16(1), 15-24.
21.Dunker, T., Radons, G., & Westkamper, E. (2005), Combining evolutionary computation and dynamic programming for solving a dynamic facility layout problem. European Journal of Operational Research, 165(1), 55-69.
22.Erel, E., Ghosh, J. B., & Simon, J. T. (2003), New heuristic for the dynamic layout problem. Journal of the Operational Research Society, 54(12), 1275-1282.
23.Hegazy, T., & Elbeltagi, E. (1999), EVOSIT: Evolution-Based Model for Site Layout Plaaning. J. Comp. in Civ. Engrg., ASCE, 13(3), 198-206.
24.Hicks, C., & Pongcharoen, P. (2006), Dispatching rules for production scheduling in the capital goods industry. International Journal of Production Economics, 104 (1), 154-163.
25.Ho, Z.-P., & Perng, C. (2006), Application of scheduling technique on dynamic layout problem of a factory. Paper presented at the INFORMS, Hong Kong, China.
26.Holthaus, O. (1997), Design of efficient job shop scheduling rules. Computers & Industrial Engineering, 33(1-2), 249-252.
27.Holthaus, O., & Rajendran, C. (1997), Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics, 48(1), 87-105.
28.Jayamohan, M. S., & Rajendran, C. (2004). Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research, 157(2), 307-321.
29.Jensen, J.B., Malhotra, M.K.& Philipoom, P.R.(1998), Family-based scheduling of shops with functional layouts. International Journal of Production Research, 36(10), 2687-2700
30.Kim, Y.-D. (1990), Comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings. International Journal of Production Research, 28(5), 953-962.
31.Lacksonen, T. A., & Enscore, E. E., Jr. (1993), Quadratic assignment algorithms for the dynamic layout problems. International Journal of Production Research, 31(3), 503-517.
32.Lambert, S., Cyr, B., AbdulNour, G., & Drolet, J. (1997), Comparison study of scheduling rules and set-up policies for a SMT production line. Computers & Industrial Engineering, 33(1-2), 369-372.
33.Liu, K.-C. (1998), Dispatching rules for stochastic finite capacity scheduling. Computers & Industrial Engineering, 35(1-2), 113-116.
34.Mckendall, A. R., & Shang, J. (2006), Hybrid ant systems for the dynamic facility layout problem. Computers and Operations Research, 33(3), 790-803.
35.Mckendall, A. R., Shang, J., & Kuppusamy, S. (2006), Simulated annealing heuristics for the dynamic facility layout problem. Computers and Operations Research, 33(8), 2431-2444.
36.Meng, G., Heragu, S. S., & Zijm, H. (2004), Reconfigurable layout problem. International Journal of Production Research, 44(22), 4709-4729.
37.Mohanasundaram, K. M., Natarajan, K., Viswanathkumar, G., Radhakrishnan, P., & Rajendran, C. (2003), Scheduling rules for dynamic shops that manufacture multi-level jobs. Computers and Industrial Engineering, 44 (1), 119-131
38.Montgomery, D. C. (1991), Design and Analysis of Experiments, New York, John Wiley & Sons.
39.Nelson, R. T. (1986), Scheduling with Multiple Performance Measures: The One-Machine Case. Management Science, 32(4), 464.
40.Panwalker, S. S., & Iskander, W. (1977), A Servey of Scheduling Rules. Operation Research, 25(1), 45-61.
41.Rajendran, C., & Jayamohan, M. S. (2000), New dispatching rules for shop scheduling: A step forward. International Journal of Production Research, 38(3), 563-586.
42.Reeja, M. K., & Rajendran, C. (2000), Dispatching rules for scheduling in assembly jobshops - Part 1. International Journal of Production Research, 38(9), 2051-2066.
43.Reeja, M. K., & Rajendran, C. (2000), Dispatching rules for scheduling in assembly jobshops - Part 2. International Journal of Production Research, 38(10), 2349-2360.
44.Scheithauer, G., Terno, J., Muller, A., & Belov, G. (2001), Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. Journal of the Operational Research Society, 52(12), 1390-1401.
45.Sha, D. Y., Hsu, S. Y., Che, Z. H., & Chen, C. H. (2006). A dispatching rule for photolithography scheduling with an on-line rework strategy. Computers & Industrial Engineering, 50 (3), 233-247.
46.Soric, K. (2000), Cutting plane algorithm for a single machine scheduling problem. European Journal of Operational Research, 127(2), 383-393.
47.Subramaniam, V., Ramesh, T., Lee, G. K., Wong, Y. S., & Hong, G. S. (2000), Job shop scheduling with dynamic fuzzy selection of dispatching rules. International Journal of Advanced Manufacturing Technology, 16(10), 759-764.
48.Sule, D. R. (1997), Industrial Scheduling. Boston: PWS Publishing Company