半導體製程隨著摩爾定律的演進，晶圓的複雜度也日益提高。在面臨全球化競爭與產品生命週期縮短的趨勢下，IC設計公司需提供更快速的開發速度來確保其服務品質與競爭力。其中IC設計工程師通常藉由電子設計自動化工具來輔助設計案或模組開發以增加專案開發效率，但是分析系統的效能往往受限於電腦資源的限制。隨著軟體資源與硬體價格日漸昂貴的趨勢，以往藉由直接購買硬體資源來解決系統效能不足的方式已不敷效益。因此透過適當的資源配置來提高系統的整體效能來增加公司的設計產出即為一重要的議題。在本研究所提出的考慮資源限制下之動態IC設計專案派工架構中，藉由定義多項指標將原本抽象的工作與資源概念加以量化，以協助決策者更清楚地了解複雜的系統實務狀況。本研究透過建立標準工時預測模型估計加工時間作為工作優先權的依據，並依損失函數比較多項可行的工作指派規則，針對工作排隊權重與機台使用順序進行相關的探討等步驟以提高系統分析效能，藉由模擬實驗的方式，取得不同情境下之最佳參數設定與派工策略，以提高系統的整體分析效能，進而減少工程師的等待時間同時贈加IC設計的產出，最後以新竹某IC設計服務公司為研究案例以驗證本研究之效度。

As the rapid development of technology of semiconductor manufacturing, the IC designs have become increasingly complicated so that IC design processes have relied on heavy computer analysis that requires capital investment for computing resources. However, the computer resource is expensive and limited, and therefore it became a critical problem to well allocate the computer resource. This study aimed to develop a dynamic policy to integrate and arrange the computer resources. Several indicators were defined to quantify the vague workload and service rate, and hence the user can get a good understanding on the situation of system and resource easily. The best one and its parameter setting would also derived from a series of simulation study. Furthermore, five potential assignment policies were compared to validate the proposed approach. The empirical study conducted in IC design service corporation has validated the developed solution.

目錄
目錄 i
表目錄 iii
圖目錄 iv
第一章 緒論 1
1.1 研究背景、動機與重要性 1
1.2 研究目的 2
1.3 論文結構 3
第二章 文獻回顧 4
2.1 IC設計相關產業背景 4
2.2 派工排程與應用 5
第三章 研究架構 7
3.1 瞭解問題 8
3.2 界定利基 9
3.3 架構影響關係 11
3.4 客觀敘述 13
3.5 綜合判斷與主觀衡量 13
3.6 權衡與決策 14
第四章 實證研究 16
4.1 瞭解問題 16
4.2 界定利基 17
4.3 架構影響關係 21
4.4 客觀敘述 24
4.5 綜合判斷與主觀衡量 26
4.6 權衡與決策 30
第五章 結論 32
參考文獻 33

參考文獻
簡禎富（2009），決策分析與管理，雙葉書廊，台北。
Armony, M. and Bambos, N., (2003), “Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems,” Queueing Systems, Vol. 44, pp. 209-252.
Baker, K. R. (1974), Introduction Sequencing and Scheduling, Wiley, New York.
Cai, X., Wu, X., and Zhou, X. (2009), “Stochastic scheduling on parallel machines to minimize discounted holding costs,” Journal of Scheduling, Vol. 12, No. 4, pp. 375-388.
Chen, H., Du, B. and Huang, G. Q. (2010), “Metaheuristics to minimise makespan on parallel batch processing machines with dynamic job arrivals,” International Journal of Computer Integrated Manufacturing, Vol. 23, No. 10, pp. 942-956.
Chou, M. C., Liu, H., Queyranne, M. and Simchi-Levi, D. (2006a), “On the Asymptotic Optimality of A Simple On-line Algorithm for the Stochastic Single-machine Weighted Completion Time Problem and Its Extensions,” Operations Research, Vol. 54, pp. 464-474.
Chou, M. C., Queyranne, M. and Simchi-Levi D. (2006b), “The Asymptotic Performance Ratio of An On-line Algorithm for Uniform Parallel Machine Scheduling with Release Dates,” Mathematical Programming, Vol. 106, No. 1, pp. 137-157.
Chiang, T. C. (2013), “Enhancing rule-based scheduling in wafer fabrication facilities by evolutionary algorithms: Review and opportunity,” Computers & Industrial Engineering, Vol. 64, No. 1, pp. 524-535.
Clarke, P. (2014), “EDA market blooms despite Japan's fall,” EETimes Europe, http://www.electronics-eetimes.com/en/eda-market-blooms-despite-japan-s-fall.html?cmp_id=7&news_id=222919661&vID=209.
Driessel, R. and Monch, L. (2012), “An integrated scheduling and material-handling approach for complex job shops: a computational study,” International Journal of Production Research, Vol. 50, No. 20, pp. 5966-5985.
Iravani, S. M. R. and Teo, C. P. (2005), “Asymptotically Optimal Schedules for Single-server Flowshop Problems with Setup Costs and Times,” Operations Research Letters, Vol. 33, pp. 421-430.
Kaminsky, P. and Simchi-Levi, D. (2001), “The Asymptotic Optimality of the Shortest Processing Time Rule for The Flow Shop Completion Time Problem,” Operations Research, Vol. 49, pp. 293-304.
Korytkowski, P., Wiśniewski, T., and Rymaszewski, S. (2013), “An evolutionary simulation-based optimization approach for dispatching scheduling,” Simulation Modelling Practice and Theory, Vol. 35, pp. 69-85.
Lei, D. (2009), “Multi-objective production scheduling: a survey,” The International Journal of Advanced Manufacturing Technology, Vol. 43, No. 9-10, pp. 926-938.
Lu, H. L., Huang, G. Q. and Yang, H. D. (2011), “Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach,” International Journal of Production Research, Vol. 49, No. 3, pp. 647-669.
Negahban, A. and Smith, J. S., (2014), “Simulation for manufacturing system design and operation: Literature review and analysis,” Journal of Manufacturing Systems, Vol. 33, No. 2, pp. 241-261.
Jayamohan, M. S., and Rajendran, C., (2004), “Development and analysis of cost-based dispatching rules for job shop scheduling,” European Journal of Operational Research, Vol. 157, No. 2, pp. 307-321.
Jia, W., Jiang, Z. and Li, Y. (2013), “Closed loop control-based real-time dispatching heuristic on parallel batch machines with incompatible job families and dynamic arrivals,” International Journal of Production Research, Vol. 51, No. 15, pp. 4570-4584.
Parthanadee, P. and Buddhakulsomsiri, J., (2010), “Simulation Modeling and Analysis for Production Scheduling Using Real-time Dispatching Rules: A Case Study in Canned Fruit Industry,” Computers and Electronics in Agriculture, Vol. 70, pp. 245-255.
Pickardt, C. W., Hildebrandt, T., Branke, J., Heger, J. and Scholz-Reiter, B. (2013), “Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems,” International Journal of Production Economics, Vol. 145, No. 1, pp. 67-77.
Qin, W., Zhang, J. and Sun, Y., (2013), “Multiple-objective scheduling for interbay AMHS by using genetic-programming-based composite dispatching rules generator,” Computers in Industry, Vol. 64, No. 6 , pp. 694-707.
Rajendran, C. and Holthaus, O. (1999), “A comparative study of dispatching rules in dynamic flowshops and jobshops,” European Journal of Operational Research, Vol.116, No. 1, pp. 156-170.
Sarin, S. C., Sherali, H. D., and Liao, L. (2014), “Minimizing conditional-value-at-risk for stochastic scheduling problems,” Journal of Scheduling, Vol. 17, No. 1, pp. 5-15.
Scheffer, L., Lavagno, L. and Martin, G. (2010), EDA for IC system design, verification, and testing, CRC Press.
Souier, M., Sari, Z. and Hassam, A. (2013), “Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility,” The International Journal of Advanced Manufacturing Technology, Vol. 64, No. 1-4, pp. 145-164.
Tang, L., Jiang, S. and Liu, J. (2009), “Rolling horizon approach for dynamic parallel machine scheduling problem with release times,” Industrial & Engineering Chemistry Research, Vol. 49, No. 1, pp. 381-389.
Vieira, G. E., Herrmann, J. W., nad Lin, E., (2003), “Rescheduling manufacturing systems: a framework of strategies, policies, and methods,” Journal of scheduling, Vol. 6, No. 1, pp. 39-62.
Vinod, V. and Sridharan, R., (2011), “Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system,” International Journal of Production Economics, Vol. 129, No. 1, pp. 127-146.
Wan, G. and Yen, B. P. C. (2009), “Single Machine Scheduling to Minimize Total Weighted Earliness Subject to Minimal Number of Tardy Jobs,” European Journal of Operational Research, Vol. 195, pp. 89-97.
Wang, H. M. and Chou, F. D. (2010), “Solving the parallel batch-processing machines with different release times, job sizes, and capacity limits by metaheuristics,” Expert Systems with Applications, Vol. 37, No. 2, pp.1510-1521.
Wu, L. H., Mok, P. Y. and Zhang, J. (2011), “An adaptive multi-parameter based dispatching strategy for single-loop interbay material handling systems,” Computers in Industry, Vol. 62, No. 2, pp. 175-186.
Yang, T., and Shen, Y. A. (2012), “Heuristic algorithms for a practical-size dynamic parallel-machine scheduling problem: integrated-circuit wire bonding,” Production Planning & Control, Vol. 23, No. 1, pp. 67-78.