臺灣博碩士論文加值系統

隨著時代的變遷，以因應變遷快速的環境，系統模擬在全球競爭策略下，成為不可或缺的管理工具。製造業最常面臨的問題是生產活動進行時經常受限於系統本身可以使用的有限資源。在不增加資源條件下，最常使用系統模擬去規劃出一套生產排程模式，以改善整體流程缺失，解決製造業所面臨的困難。
雖然過去十年來在流程型工廠派工法則問題的研究上，已有許多傑出的成果。但探討的工廠排程問題多半以假設性資料模擬公司生產流程作業，並未採用實際資料進行模擬。當套用在實際公司生產流程時，所得模擬結果有待驗証，降低系統模擬的可行性。
本研究藉由Arena軟體去發展一套生產派工法則模式，並且加強整體生產流程相關因素考量，例如備料時間、機器調整時間及拆單生產
等，以便更能符合實際生產狀況，同時將模式運用至實務性生產工廠。其結論如下：
1. 本研究藉由文獻探討，彙整出所需派工法則與績效評估準則，並考量減少機台(資源)配置以提升資源使用效率情形。將個案公司生產資料利用Arena軟體建構出生產作業流程模擬模式。模擬結果顯示，減少機台數雖會提昇資源使用效率，但相對的也會增加延遲交貨之風險。提昇資源使用效率所節省之成本是否大於延遲交貨所增加之成本，則會影響機台最適配置數之考量。
2. 在績效評估結果中，建議個案公司改善現行派工方式，採用最短處理時間法則(SPT)取代現行之先到先出法則(FIFO)成為該公司生產模式，以達整體生產最佳化。
3. 藉由檢查系統模式是否錯誤時，我們發現Arena模擬軟體的Seize模組在本模式中出現黑箱的情況，因此在模組使用上會產生看不見的隱形錯誤。本研究特別指出此一情形並加以說明。

With the changes of time and the strategy of global competitiveness, system simulation becomes an indispensable management tool for tackling the fast-changing environment. The most frequent problem which the manufacturing industry is faced with is its limited resources in the producing process. In the condition of no increase in resources, system simulation is often used to plan a set of production scheduling model to improve any flaws in the process and to solve the difficulties the manufacturing industry is faced with.
In the past ten years, there have been outstanding accomplishments in the research of the dispatching rules in flow shops, but the exploration of shop scheduling problems mostly focused on the hypothetical simulation data of the producing operation process in companies, not real simulation data. Thus, when hypothetical data applied to the producing process in real companies, the simulation results needed to be inspected and verified. This would greatly decrease the feasibility of system simulation.
This study uses the Arena software to develop a model of production dispatching rule and strengths related factors in the producing process such as time for preparing materials, time for adjusting machines and the shredding production to fit the real producing situations and to apply the model to the real producing shop. The conclusions are summarized as follows:
1. This study collects and arranges all the necessary dispatching rules and performance evaluation rules by literature review and considers the decrease in machine (resource) allocations to elevate the efficiency of resource usages. This study also uses the produced data from the case company to construct the simulation model of producing operation process by the Arena software. The simulation result shows that the decrease in the amounts of machines would certainly elevate the efficiency of resource usages; however, it also increases the risk of tardy delivery. Whether the increased cost caused by elevating the efficiency of resource usages is higher than that caused by tardy delivery would influence the consideration of the most appropriate amounts of machine allocations.
2. In the result of performance evaluations, it is suggested that the case company changed their current dispatching methods. It means to replace the current rule of First In First Out (FIFO) with the rule of Shortest Processing Time (SPT) to optimize the production.
3. By checking the accuracy of the system model, we find that the Seize module in the Arena simulation software appears a “black box” in this model. Thus, there are hidden mistakes when using this model. This situation would be particularly addressed and explained in this study.

誌 謝I
摘 要II
目 錄IV
圖目錄VI
表目錄VII
第一章 緒論 1
1.1 研究背景 1
1.2 研究動機 2
1.3 研究目的 2
1.4 研究範圍與限制 3
1.5 研究方法與架構 3
第二章 文獻探討 5
2.1 排程 5
2.2 流程型工廠排程問題 7
2.2.1流程型排程問題的特性 7
2.2.2流程型問題的相關排程技術 8
2.3 排程績效衡量準則9
2.4 派工法則12
2.5 模擬15
第三章 個案模式建構17
3.1 個案問題描述17
3.2 系統模式建構19
3.2.1模擬模式架構 19
3.2.2 Arena 模擬模式 21
3.3 模擬模式之實驗設計31
第四章 模擬模式之實驗結果34
4.1 解開Arena模擬軟體之黑箱34
4.2 不同機台配置模擬結果35
4.3 不同的派工法則模擬結果36
第五章 實驗結果討論45
第六章 結論與建議48
6.1 結論48
6.2 後續研究建議 49
參考文獻50

【1】 王治平，「實際零工式生產排程問題的派工法則」，國立政治大學資訊管理研究所碩士論文，2003。
【2】 周書賢，「開放型工廠派工法則之模擬研究」，朝陽科技大學工業工程與管理系碩士論文，2001。
【3】 施大維，「開放工廠總加權完工時間最小化問題之研究」，朝陽科技大學工業工程與管理研究所碩士論文，1999。
【4】 張慶彬，「利用等候時間預測的半導體派工法則之模擬研究」，國立清華大學工業工程研究所碩士論文，1997。
【5】 陳英仁，「以模擬為基礎的晶圓製造廠派工法則」，國立清華大學工業工程研究所碩士論文，1996。
【6】 陳建良，「排程概述」，機械工業雜誌第12月號，pp.122-137，1995。
【7】 Allahverdi, A. and Tatari, M. F., Simulation of different rules in stochastic flowshops. Computers and Industrial Engineering, Vol. 31(1/2),pp. 209-212. ,1996。
【8】 Blackstone, J. H. , Phillips , D. T. , Hogg and G.l., “A state-of-the-art survey of dispatching rules for manufacturing job shop operation.” International Journal of Production Research,Vol.20(1) , pp.27-45. , 1982。
【9】 Barrett R. and Kadipasaoglu, S. N., “Evaluation of Dispatching
Rules in a Dynamic Flow Shop”, Production and Inventory Management Journal, Vol.31, pp.54-58., 1999。
【10】 C. L. Yang and W. Wen , ”A dynamic and automatic traffic light control system for solving the road congestion problem.”, WIT Transactions on The Built Environment, Vol.89 , 2006。
【11】 Chan, T. S., “Evaluation of scheduling rules in flexible manufacturing systems via simulation.”, International Journal of Materials and Product Technology, Vol.11 , pp.133-144. , 1996。
【12】 Cheng, T.C.E., and Jiang, J.,“Job shop scheduling for missed due-date performance, ＂Computers and perations-57-Research, Vol.34, pp.297-307. ,1998。
【13】 Haupt, R., “A survey of priority rule-based scheduling.” ,OR
Spektrum,Vol.11, pp.3-16. ,1989。
【14】 Holthaus and Rajendran , “Efficient dispatching rules for scheduling in a job shop.” International Journal of Production Economics, Vol.48(1) , pp.87-105. , 1997。
【15】 Holthaus , “Design of efficient job shop scheduling rules. ” ,
Computers and Industrial Engineering, Vol.33(1/2) ,pp.249-252. , 1997。
【16】 Hunsucker, J. L. and Shah, J. R., “Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment.” , European Journal of Operational Research, Vol.72 , pp.102-114. , 1994。
【17】 Kimt, Yeong-Dae,“ A backward approach in list scheduling algorithms for multi-machine tardiness problems,＂Computers and Operations Research, Vol.22, pp.307-319. ,1995。
【18】 Narasimhan, S. L., Mangiameli, P. M., “A comparison of sequencing rules for a two-stage hybrid flow shop.” Decision Sciences, Vol.18, pp.250-265. ,1987。
【19】 Rajendran and Holthaus , “A comparative study of dispatching rules in dynamic flow shops and job shops.” , European Journal of Operational Research, Vol.116 , pp.156-170. , 1999。
【20】 Ramasesh, R., “Dynamic job shop scheduling: a survey of simulation Research.” , Omega, 18(1), pp.43-57. , 1990。
【21】 Parunak, H. V. D., “Characterizing the Manufacturing Scheduling Problem.”, Journal of Manufacturing Systems, Vol.10 , pp.241-259. , 1991。
【22】 Sabuncuoglu, I., “A study of scheduling rules of flexible manufacturing systems: a simulation approach. “International Journal of Production Research, Vol.36(2), pp.527-546. , 1998。
【23】 Sarper, H. and Henry, M., “Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop.”, Omega, Vol.24(1), pp.73-81. , 1996。
【24】 Shinichi, Tagawa,“ A new concept of job shop scheduling system - hierarchical decision model. ＂ ,International Journal of Production Economics, Vol.44, pp.17-26. , 1996。
【25】 Prakash, A. and Chen, M., “A simulation study of flexible manufacturing systems.”, Computers and Industrial Engineering, Vol.28(1), pp.191-199. , 1995。
【26】 Pinedo, M., Scheduling Theory, Algorithms, and Systems, Prentice Hall,New Jersey. 1995。
【27】 Lozinski, C. and Glassey, C.R., “Bottleneck Starvation for Shop Floor Control,”Transactions on Semiconductor Manufacturing, Vol. 1, No. 4, pp.147-153, 1988。