頁籤選單縮合
題 名 | Decision Support for the Planning of Job-Shop Systems=訂單式製造系統之規劃 |
---|---|
作 者 | 姚高雄; | 書刊名 | 國立虎尾技術學院學報 |
卷 期 | 2 1999.03[民88.03] |
頁 次 | 頁191-204 |
分類號 | 448.945 |
關鍵詞 | 訂單式製造系統; Petri net; Job shop systems; |
語 文 | 英文(English) |
中文摘要 | 訂單式製造為製造系統之一。此系統包含一群加工機器及其加工工件。在規劃訂 單式製造系統時,通常以縮短產品之工廠流通時間且減少使用資源及在製品為目標。本文採 斐氏網以建構系統模組並加以模擬,之後並擷取模擬結果以建構知識庫以為規劃最佳或近最 佳系統之依據。本研究顯示以斐氏網建構之模型可模擬並獲得訂單式製造系統之產能資訊。 據此資訊建立之知識庫可引導規劃者規劃出一可運用最少資源而獲最大產能之訂單式製造系 統。 |
英文摘要 | A job-shop system is a specific type of manufacturing system composed of a certain set of machines and a variety of jobs which must be produced using the machines. The product of a job system is usually made by make-to-order. It is generally desired to minimize the shop floor flow time (SFFT) and to minimize the resources utilization. Formal discrete system models are useful to predict operational characteristics such as throughput and the utilization of resources. In this paper, the methodology of planning a make-to-order job shop system is presented. Peti nets are used for modeling and simulating the job-shop system. The knowledge for planning the system is acquired from the simulation results. Based on the knowledge base, the optimal or near optimal model of the system can be constructed. It is shown that the modeling allows for evaluating the steady-state SFFT of the system under a deterministic and cyclic production process. Furthermore, based on the implementation of the knowledge, the processing plan of the job shop system can be work out with minimal SFFT and minimal resources required. |
本系統中英文摘要資訊取自各篇刊載內容。