本研究以IC後段加工製程之半導體封裝廠為例，以限制資源為基礎進行滾動式生產計畫。主要架構包含投料計畫與現場管理，在已知訂單資訊下，考量到廠內生產特性-訂單加工之拆批行為及瓶頸站中機台型號之限制。此外，在瓶頸站加工時，因IC種類多且複雜，機台在轉換不同的產品進行加工時，須調整加工方式、程式設定等，會造成大量的設置時間(Setup Time)，導致單位時間的產出量下降，進而影響整體系統產出；另外，為了考量訂單在系統中的流程時間(Flow Time)，控制在製品水位亦為生產中不可忽視的議題。故本研究以最小化機台總設置時間及系統平均流程時間為績效目標，求得最佳派工、投料及緩衝控制之決策計畫。
本研究透過投料計畫與現場管理探討何種派工法則、投料法則及緩衝控制之組合，對於不同訂單與產能環境下，能有效地降低機台總設置時間及系統平均流程時間。半導體封裝廠為一混合流線型(HFS)生產系統，各站機台數量眾多，加上加工時間與瓶頸站設置時間具有隨機性及機台當機，需重複模擬以得績效評估值，因此本研究建構模擬模式評估並利用最佳模擬預算分配法(OCBA)有效分配有限模擬資源，同時節省模擬時間。
本研究經模擬分析結果得證，派工與投料法則會顯著影響系統績效，透過有效搭配可減少系統總設置時間及系統平均流程時間；總設置時間與系統平均流程時間有制衡關係，且不同績效權重會影響最佳方案之選擇；另外，因問題特性，確定性環境下所求之最佳方案與隨機性環境不同，但不影響派工與投料法則對於系統績效的影響程度。因此，派工與投料法則之選擇對於半導體封裝產業相當重要，最後本研究將系統流程架構及最佳方案之結果提供給半導體封裝業參考。

In this paper, a framework of rolling production plan based on bottlebeck resource is introduced. The framework consists of two parts- releasing plan and shop floor control. Semiconductor-packaging production system where a bottleneck workstation exists is used as the case study. In the bottleneck workstation, plenty of setup time is needed for changeover due to the complexity of products. Setup time in bottleneck workstation decreases the throughput per unit of time and thus has impact on the whole system. The methodologies to control the amount of work-in-process (WIP) are provided and mean flow time are used to measure their performance. To minimize total setup time and mean flow time, an adequate production plan must be adopted.
The proposed framework is to discuss the multiple decisions comprising dispatching rule, releasing rule and buffer contorl must be well made to decrease total setup time and mean flow time effectively under different scenarios. Due to stochastic processing time and setup time in the bottleneck workstation, replications of simulation have to be conducted to estimate the performance of each design. In this article, an evaluative model is constructed. Moreover, optimal computing budget allocation (OCBA) is applied to efficiently allocate limited simulation budget and reduce the total simulation time.
It is proved that dispatching and releasing rule have significantly impact on total setup time and mean flow time. Furthermore, the relationship of trade-off between total setup time and mean flow time are obvious and different weight will affect the choise of alternatives. Due to the characteristics of the problem, the consequence are different between the deterministic and stochastic environment, but the dispatching and releasing rules won’t make change the effect of the performance of system.

摘要 i
Abstract ii
誌謝 iii
圖目錄 vi
表目錄 ix
第一章 緒論 1
1.1研究背景與動機 1
1.2研究目的 3
1.3研究範圍 4
1.4研究步驟 5
第二章 文獻回顧 7
2.1派工法則 7
2.2系統在製品管理與投料控制 11
2.2.1推拉式管理 11
2.2.2投料法則 12
2.3限制理論 14
2.3.1限制驅導式排程法(DBR) 14
2.3.2限制驅導式排程法應用之相關文獻 17
2.3.3簡化型限制驅導式排程法(S-DBR) 18
2.4最佳資源分配法(Optimal Computing Budget Allocation) 19
第三章 封裝廠生產計畫與管制 25
3.1封裝廠生產系統 25
3.2滾動式投料計畫與生產管制之設計理念 30
3.2.1流程設計理念 30
3.2.2滾動式生產 31
3.3封裝廠系統之投料計畫與生產管制 34
3.3.1 封裝廠之投料計畫 34
3.3.1.1日投量規劃 34
3.3.1.2限制資源之派工排程 42
3.3.1.3決定投料時間及順序 58
3.3.2封裝廠之生產管制 60
3.3.2.1在製品管理 60
3.3.2.2緩衝控制 63
3.3.3派工、投料及緩衝之配合關係 65
第四章 個案公司案例介紹 66
4.1生產情境介紹 66
4.2投料計畫與生產管制流程 67
第五章 系統模擬實驗與結果分析 76
5.1問題定義 76
5.2模擬模式建構與驗證 82
5.2.1模擬模式建構 82
5.2.2模擬模式確認與驗證 85
5.3確定性生產系統之實驗設計與分析 86
5.4隨機性生產系統之實驗設計與分析 97
第六章 結論與建議 115
6.1結論 115
6.2建議 116
參考文獻 117
附錄 121

[1] 陳建良(1995)，排程概述，機械工業雜誌，第12月號，頁122-137
[2] 鍾淑馨，謝志銘(1996)，限制資源有限前推排程法之設計，工業工程學刊，第十三卷，第一期，頁23-33
[3] 吳鴻輝，林則孟，吳凱文(1999)，限制驅導式管理系统於半導體封装廠之應用，工業工程學刊，第十六卷，第一期，頁13-37
[4] 林則孟(2001)，系統模擬-理論與應用，滄海書局
[5] 吳鴻輝(2001)，限制驅導式現場排程與管理技術，全華
[6] 朱仲威(2007)，以反應曲面法及模擬模式求解多目標推拉界限決策-以 TFT-LCD 後段製程為例，成功大學製造工程研究所學位論文，頁1-98
[7] 林育成(2009)，以在製品統計製程管制法改善晶圓代工廠生產週期之研究，兩岸機電暨產學合作學術研討會論文集
[8] 鍾雅琳(2014)，考量派工法則與批量流於半導體封裝廠之生產排程問題，國立清華大學工業工程與工程管理學系碩士論文
[9] Blackstone, J. H., Phillips, D. T., & Hogg, G. L. (1982). A state-of-the-art survey of dispatching rules for manufacturing job shop operations. The International Journal of Production Research, 20(1), 27-45.
[10] Browne, J., Dubois, D., Rathmill, K., Sethi, S. P., & Stecke, K. E. (1984). Classification of flexible manufacturing systems. The FMS magazine, 2(2), 114-117.
[11] Cachon, G. P., & Lariviere, M. A. (1999). An equilibrium analysis of linear, proportional and uniform allocation of scarce capacity. Iie Transactions, 31(9), 835-849.
[12] Chen, C.-H., Lin, J., Yücesan, E., & Chick, S. E. (2000). Simulation budget allocation for further enhancing the efficiency of ordinal optimization. Discrete Event Dynamic Systems, 10(3), 251-270.
[13] Crittenden, V. L. (1992). Close the marketing/manufacturing gap. Sloan Management Review, 33(3), 41.
[14] Dudewicz, E. J., & Dalal, S. R. (1975). Allocation of observations in ranking and selection with unequal variances. Sankhyā: The Indian Journal of Statistics, Series B, 28-78.
[15] Glassey, C. R., & Resende, M. G., (1988). Closed-loop job release control for VLSI circuit manufacturing. IEEE Transactions on Semiconductor manufacturing, 1(1), 36-46.
[16] Glassey, C. R., & Resende, M. G., (1988). A scheduling rule for job release in semiconductor fabrication. Operations Research Letters, 7(5), 213-217.
[17] Goldratt, Eliyahu M. (1990). What is this thing called theory of constraints and how should it be implemented?. North river press.
[18] Haupt R. (1989). A Survey of Priority Rule-Based Scheduling, OR Spektrum 11:3--16.
[19] Henderson, S. G., & Nelson, B. L. (2006). Handbooks in Operations Research and Management Science: Simulation: Simulation , vol.13, Elsevier.
[20] Hunsucker J.L. and Shah, J.R. (1994). Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment, European Journal of Operational Research ,vol.72, 102-114.
[21] Kim, K. H., & Egbelu, P. J. (1999). Scheduling in a production environment with multiple process plans per job. International Journal of Production Research, 37(12), 2725-2753.
[22] Matejcik, F. J., & Nelson, B. L. (1993). Simultaneous ranking, selection and multiple comparisons for simulation. Paper presented at the Proceedings of the 25th conference on Winter simulation.
[23] Olhager, J., & Östlund, B. (1990). An integrated push-pull manufacturing strategy. European Journal of Operational Research, 45(2-3), 135-142.
[24] Rinott, Y. (1978). On two-stage selection procedures and related probability-inequalities. Communications in Statistics-Theory and methods, 7(8), 799-811.
[25] Russell, G. R., & Fry, T. D. (1997). Order review/release and lot splitting in drum-buffer-rope. International journal of production research, 35(3), 827-845.
[26] Sarper, H. and Henry, MC. (1996). Combinatorial dispatching rules in a two-machine flow evaluation of six dynamic shop, Omega, Vol. 24, No. 1, 73-81.
[27] Schragenheim, E., Weisenstern, A., & Schragenheim, A. (2006). What’s really new in Simplified DBR. In TOC ICO Conference.
[28] Schragenheim, E., & Dettmer, H. W. (2000). Simplified drum-buffer-rope a whole system approach to high velocity manufacturing. Goal Systems International.
[29] Spearman, M. L., Woodruff, D. L., & Hopp, W. J. (1990). CONWIP: a pull alternative to kanban. The International Journal of Production Research, 28(5), 879-894.
[30] Spearman, M. L., & Zazanis, M. A. (1992). Push and pull production systems: issues and comparisons. Operations research, 40(3), 521-532.
[31] Taylor III, L. J. (1999). A simulation study of WIP inventory drive systems and their effect on financial measurements. Integrated Manufacturing Systems, 10(5), 306-315.
[32] Tsubone, H., & Horikawa, M. (1999). A comparison between machine flexibility and routing flexibility. International Journal of Flexible Manufacturing Systems, 11(1), 83-101.
[33] Wang, I. L., Yang, T., & Chang, Y. B. (2012). Scheduling two-stage hybrid flow shops with parallel batch, release time, and machine eligibility constraints. Journal of Intelligent Manufacturing, 1-10.
[34] Wein, L. M. (1988). Scheduling semiconductor wafer fabrication. IEEE Transactions on semiconductor manufacturing, 1(3), 115-130.
[35] Xiong, G., & Nyberg, T. R. (2000). Push/pull production plan and schedule used in modern refinery CIMS. Robotics and Computer-integrated manufacturing, 16(6), 397-410.
[36] Yang, T., Kuo, Y., & Cho, C. (2007). A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem. European Journal of Operational Research, 176(3), 1859-1873.