TW583560B - Modeling and scheduling of a semiconductor wafer fab - Google Patents

Modeling and scheduling of a semiconductor wafer fab Download PDF

Info

Publication number
TW583560B
TW583560B TW91103712A TW91103712A TW583560B TW 583560 B TW583560 B TW 583560B TW 91103712 A TW91103712 A TW 91103712A TW 91103712 A TW91103712 A TW 91103712A TW 583560 B TW583560 B TW 583560B
Authority
TW
Taiwan
Prior art keywords
simulation
batch
item
machine
model
Prior art date
Application number
TW91103712A
Other languages
Chinese (zh)
Inventor
Li-Chen Fu
Ming-Hung Lin
An-Chin Huang
Original Assignee
Li-Chen Fu
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Li-Chen Fu filed Critical Li-Chen Fu
Priority to TW91103712A priority Critical patent/TW583560B/en
Application granted granted Critical
Publication of TW583560B publication Critical patent/TW583560B/en

Links

Abstract

In this patent, we propose a simulation/scheduling system for semiconductor wafer fab. The underlying model is basically constructed with colored timed Petri-net. The resource contention subnet in this model is modified with the help of the queueing theory. We apply the queueing theory to simplify the simulation process and to reduce simulation time. Besides, an arrival-rate-updating module is designed to reflect the dynamic flows of lots in the fab. This module can be used to improve the accuracy of simulation. Furthermore, real system behaviors such as machine breakdown, machine maintenance and lot transportation are involved in our detailed model. Our simulator is built on this model. The genetic algorithm is adopted in our scheduler for its well-known efficient searching ability in a huge solution space. The evaluation process in the genetic algorithm is completed by our simulator. We also propose a gene encoding method which can provide versatile scheduling strategies and support traditional rules.

Description

ILTJ 孀裝--------訂---------線< (請先閱讀背面之注意事項再填寫本頁) 經濟部智慧財產局員工消費合作社印製 583560 A7 --—-----------B7_______ 五、發明說明(1 ) 發明背景 在核擬為的製作初期,一個良好的模型建構無疑是必要 的。遵循完整細密的模型可以保證模擬器的準確性。 斐氏網路 (Petri net)在學#已被公認為可對複雜離散事件系統作描述與分 析的-種权型工具。在斐氏網路上的分析通常結合了模擬,然 而模擬經常需要花費大量時間。另一方面,有些設計是使用分 析的技術為其基礎’不過在實際的使用上常顯得過於複雜。以 仔列(queue)組成的服務系統描繪出更多有趣的動態系統。仔列 系統常用為通訊系統之模型建構和效能分析的工具,主要是因 為它們通常比其他方法較有效率。 上述兩種系統皆有其個別的優點和限制。舉例而言,斐氏 T路雖不能輕易的反應侧系統情列的情形,但卻可輕易的 描述同步和/或分散和重組(工作)的行為,反觀純粹使用佇列系 統即很難描述這種狀況。 如果能結合斐氏網路對離散事件的描述能力以及排隊理論 對仵列系統的數學分析,即意謂著吾人可以建立—個模型,一 方面逼近真實系統,另一方面在模擬時又不因為精確度而犧牲 效率。本專利模擬器之設計便是以此為目標。 &在過去的研究和設計中,佇列系統通常假設其情況是在穩 態之下。而在實際製造廠中,批貨的流量可能是非穩態而變動 的。因此,上述的模擬器需要一個機制能夠反映批貨抵達機台 的速率,除了真貫表現製造i行為外,更能增進佇列系統槿 生產行為的準確度。 、 这傳基因演算法(genetic alg〇rithm)是一個常用於廣大解空 本紙張尺度_中國國家標準(CNSU4規格⑵Q χ挪公髮) 583560 經濟部智慧財產局員工消費合作社印製 A7 、發明說明(2) 間作最佳解搜尋的演算法。在製造魅產排程的研 運用。然而,遺傳基因演算法的運用,有兩項關: 艾為解評估動作,其二為基因編碼。此二者影響遺傳演二 求解的效率與品質。解評估的動作,一般皆依賴模擬來完成。 過去的模擬系統最大的缺點便是耗時,以致遺傳基因淹曾 無_有限時間内搜尋足夠的解。至於基因編碼的方式了以琴 擇優先權法則的作法較為常見。然而,在結合仔列系統的觀= 之後,我們需要一種能與佇列系統相容的編碼方式。 〜 發明概述 半導體製造是-個高風險的產業,t者為在激烈競爭下求 生存,除了需要隨時精確掌控製造廠内的狀況,也希望能評估 製造廠的效能或者對廠内的批貨進行交期預測,並藉此爭取客 戶。丁單,或者改變製造廠的設置。更有甚者,面對複雜冗長的 製程、製造廠内隨機出現的停工狀態、高價的設備以及產品的 多樣性,人為的生產排程已不敷需求。業者也期盼經由自動化 排程的方式,來增進製造廠的生產率以及產品的達交率。本專 利之系統便是因應如此的需求而開發的。 本發明之特徵有三,第一為緊密結合加色加時斐氏網路 (colored timed Petri-net)與排隊理論,有效降低模擬之時間複雜 度。第二為細緻之斐氏網路底層模型,其中模擬了晶圓製造廠 的大多數生產行為。第三為提出一用於遺傳基因演算法之基因 編碼方法,不僅可產生多樣化的排程策略,也同時支援既有慣 用於製造廠的排程法則。 本紙張尺度適用中國國家標準(CNS)A4規格(210 X 297公釐) J 裝--------訂---------線· (請先閱讀背面之注音?事項再填寫本頁) 583560 A7 B7 五、發明說明(3 ) 發明詳細說明 ♦底層模型 〜在開發彳議||之前,模型的建立是相當關鍵的。模型的好 心關係到;^擬的效率以及精確度。本專利之概器的底層模型 是由斐氏網路結合排隊理論所建立的。斐氏網路是一熟為人知 的圖形化建椒工具,而排隊理論則是分析仔列系統的一套數學 理响以下將描述本專利在模型巾包含哪缸廠的實際運作行 為,即模型精確度;以及如何以排隊理論簡化模型,以增賴 擬效率。 在此所提出的仔列式加色加時斐氏網路(QCPN)模型延伸 =的加色加時斐氏網路模型,在特定的place引入符歹_^ 才心。攻個部份將在排隊理論的小節將以闡述。 在匕所提出的j 丁列式力口色力口時斐氏網路(QCpN)模型 要模Ξ擬11的底層模型包含了製賴型與運輸系統模型兩個主 •製程模型 =程模型用以模擬4中與生產相關 祕由模型與機台基礎模型。 刀為衣 1·製程路由模型 衣造廢中的機台可能會有 以上,可爾 、守’必須先根據該製程步驟選定一製程能力機 本紙張尺錢it _家標^ 297公釐) (請先閱讀背面之注咅?事項再填寫本頁) --------t--------- 583560 五、發明說明(4 便是用來模擬此種行為 2·機台基礎模型 機台基礎模型包含_台模型 測模型以及機台檢_型 =$、批貨檢 ί!,台在運作過程中可能會發生當機等諸如此類的V:r 批貨檢測模型是表現在某些機台 上批貨經過處理後,還需要多 道檢测手續的實際|y芒麻广Α 〜王段’竭 排定舰,± 仃為。而機台檢_型則表 中排定維修的事件 •運輸系統模型 現了廠 衣造礙中的製程步驟數目相#龐大,之增多。批貨要在如此眾多的機台流動,—數目也隨 完成。在本專利的模型中,t然也考慮 套運輪系统來扮演的角色。此處所提出之運輪魏模型在製造礙所 _具服Ϊ行程、魅路由、載, 、吴尘。底下簡述每一子模型所模化的行為。一 >、私動 1·载具呼叫 當批貨需要從目前機台移動到遠方機 輸需求給運輸減,以要求-載具前往服^ 傳送〜 運 2. 載具選擇 本紙張尺度翻+關家標準(CNS)A4規格⑵〇 297公釐) 583560 A7 五、發明說明(5 ) S運輸系統接受一運輸需电士 定-載具前往服務。本專利之模^;根據載具選擇策略選 __法則,試圖平衡每-=!:;;=的是祕ad 3·載具服務行程 每一部載具可能同時需要服 行程模型用以模化服務各需^^铺而求載具服矛力 爾職細法^ 序。模擬⑼所採用的是 4·載具路由 載w往目的機台的路線可能路 sh—a制二Γ 有峨。觀器中使用 5·載具路線衝突 兮閒置’如果有—閒置載具佔有其路線,則 ;==:該路線。載具路線衝突模型-模化此可 6·載具移動 行為。 載具移動模絲現了魅在鶴過程中會有 加減速的 4非隊理論 ^張尺度刺τ關家標ijT(CNS)A4規格⑵〇 χ 297公釐) 583560 經濟部智慧財產局員工消費合作社印製 hiq)^ Η, A7 五、發明說明(6 ) 在生產過財,當勤處理完—崎時,如果機台作 有夕於-娜貨在等待,此時機台便 作。製造廠中-般會訂有-批貨得 &擇杜貝的動 ^ 貝優先權法則,以計算每個抵眢 的處理優先權,每次機台面對選摆 、 、擇盼,便可依此優先權選定下 一個處理的批貨。然而,由於新 0士 „料& Μ ㈣1貝的抵達以及批貨優先權的 日齋交動性,傳統模觀必須耗f大 優f序。排隊理論便是為了解決此目的而引人在本專;= ^中。在過去’批貨優先權會隨時間而改變的這類系統並 被深入的研究。 另 —在本專利之提出的模型中,針對批貨訂有數種縣_。 母一優先等級皆配有一對參數與c,。每一個屬於優先等級/ 的批貝,其在狩列中的優先權值是以 bi + Cjx waiting time 來計算的。其中的麵·伽g ίζ·騰指的是在仔列中等待的時間。這 種優,等_定義方式柿可以提供制者輸人摊化的優先 權計算法則,同時也相容許多既往的常用法則,如先進先出、 後進後出、最小剩餘製程優先、最短交期優先等等。以下列舉 先進先出法則為例。4(a)表示某一類批貨的優先等級,从為一 適當之大值,//為全部的優先等級個數,^是t〇ken的抵達時 Μ Μ hci =z,V/= 1,...,// 本紙張尺度適用中國國家標準(CNS)A4規格(210 χ 297公釐 J— ·---------------^---------^ (請先閱讀背面之注音?事項再填寫本頁)ILTJ Outfit -------- Order --------- Line < (Please read the precautions on the back before filling out this page) Printed by the Intellectual Property Bureau Employee Consumer Cooperative of the Ministry of Economic Affairs 583560 A7- -——--------- B7_______ V. Description of the invention (1) Background of the invention In the early stage of the proposed production, a good model construction is undoubtedly necessary. Following a complete and detailed model can guarantee the accuracy of the simulator. The Petri net in learning # has been recognized as a weight-based tool for describing and analyzing complex discrete event systems. Analysis on the Fischer network usually incorporates simulations, but simulations often take a significant amount of time. On the other hand, some designs are based on analytical techniques, but they are often too complicated for practical use. A service system composed of queues depicts more interesting dynamic systems. Tsai Lie systems are often used as tools for modelling and performance analysis of communication systems, mainly because they are usually more efficient than other methods. Both systems have their own advantages and limitations. For example, although the Fischer T-Road cannot easily reflect the situation of the side system, it can easily describe the behavior of synchronization and / or decentralization and reorganization (work). In contrast, it is difficult to describe this using pure queue system. Kind of situation. If we can combine the description of discrete events and the mathematical analysis of the queue system with the Fischer network, it means that we can build a model that approximates the real system on the one hand, and does not Precision at the expense of efficiency. This patent simulator is designed with this in mind. & In past research and design, enqueuing systems often assumed that their conditions were under steady state. In the actual manufacturing plant, the flow of the batch may be unstable and change. Therefore, the above-mentioned simulator needs a mechanism that can reflect the rate at which the batch of goods arrive at the machine. In addition to the true performance of the manufacturing i behavior, it can also improve the accuracy of the queue system production behavior. This genetic algorithm (genetic algorithm) is a paper scale commonly used to solve empty papers _China National Standard (CNSU4 Specification ⑵Q χ Norwegian public issued) 583560 Intellectual Property Bureau of the Ministry of Economic Affairs Employee Cooperative Cooperative printed A7, Invention Description (2) Algorithms for interim best solution search. Research and application of manufacturing charm production schedule. However, the application of genetic algorithms has two problems: Ai is the solution to evaluate actions, and the second is gene coding. Both of these affect the efficiency and quality of the genetic algorithm. The action of solution evaluation usually depends on simulation. The biggest disadvantage of past simulation systems is that it is time consuming, so that the genetic gene has not searched for sufficient solutions in a limited time. As for the way of gene coding, it is more common to use the rule of preference. However, after combining the concepts of the queue system, we need a coding method that is compatible with the queue system. ~ Summary of Invention Semiconductor manufacturing is a high-risk industry. In order to survive under fierce competition, in addition to the need to accurately control the status of the factory at any time, it is also hoped that it can evaluate the efficiency of the manufacturing factory or conduct batch shipments within the factory. Delivery forecast and use it to win customers. Ding Dan, or change the factory settings. What's more, in the face of complex and lengthy processes, random shutdowns in manufacturing plants, high-priced equipment and product diversity, artificial production schedules are no longer sufficient. The industry is also looking forward to increasing the productivity of the manufacturing plant and the delivery rate of the products through automated scheduling. The patent system was developed in response to such needs. The present invention has three features. The first is to closely combine the colored timed Petri-net and queuing theory, which effectively reduces the time complexity of the simulation. The second is a detailed underlying model of the Fibonacci network, which simulates most of the production behavior of the wafer fab. The third is to propose a gene coding method for genetic algorithms, which can not only generate a variety of scheduling strategies, but also support the existing scheduling rules commonly used in manufacturing plants. This paper size applies to China National Standard (CNS) A4 (210 X 297 mm) J Pack -------- Order --------- Line · (Please read the note on the back first? Matters Fill out this page again) 583560 A7 B7 V. Description of the invention (3) Detailed description of the invention ♦ The underlying model ~ Before the development of the proposal ||, the establishment of the model is quite critical. The good intentions of the model are related to the efficiency and accuracy of the simulation. The underlying model of the patented estimator is established by the Fischer network combined with queuing theory. The Fibonacci network is a well-known graphical tool for constructing peppers, and the queuing theory is a set of mathematical principles for analyzing the row system. The following will describe the actual operation behavior of the plant in which the patent includes the model towel, that is, the model Accuracy; and how to simplify the model with queuing theory to increase pseudo-efficiency. The QCPN model extension of the sequel-colored plus-time plus Fischer-Hertz network (QCPN) model proposed here introduces the symbol 歹 _ ^ in the specific place. This part will be explained in the section of queuing theory. In the j Dinglie-style force port and color force port, the Fischer-Hertz network (QCpN) model is to simulate the underlying model of 11. The bottom model contains two main types: the reliance type and the transportation system model. The process model = the process model. To simulate production-related secret models and machine basic models in Simulation 4. Knife for clothing 1 · Process routing model The machine in the process of scrapping may have the above. Keer and Shou 'must first select a process capability machine according to the process steps. This paper ruler _ 家 标 ^ 297 mm) ( Please read the note on the back? Matters before filling out this page) -------- t --------- 583560 5. Description of the invention (4 is used to simulate this behavior The basic model of the machine The basic model of the machine includes _machine model test model and machine inspection_type = $, batch inspection ί !, V: r batch inspection model, etc. may occur during the operation of the platform. In some machines, after the batch of goods is processed, multiple inspection procedures are needed. | Mang Ma Guang A ~ Wang Duan's exhaustion scheduler, ± 仃 is. And machine inspection _ type is listed in the table. Events of scheduled maintenance • The model of the transportation system now shows that the number of process steps in the manufacturing process is huge. The number of batches must flow on so many machines, and the number is also completed. In the model of this patent, R Ran also considers the role of the shipping wheel system. The Wei model of the shipping wheel proposed here is in the making of obstacles. Routing, loading, and Wu Chen. The following briefly describes the behaviors modeled by each sub-model. First, private movement 1. Vehicle calling When a batch of goods needs to be moved from the current machine to a remote machine, the transportation demand is reduced, Request-vehicle to the service ^ transfer ~ transport 2. carrier selection This paper size turning + family standard (CNS) A4 specifications ⑵2977 mm) 583560 A7 5. Invention description (5) S transport system accepts one transport Electricity required-vehicle to go to service. The model of this patent ^; chooses the __ rule according to the vehicle selection strategy, trying to balance every-=!: ;; == is the secret ad 3 · vehicle service itinerary Each vehicle may also need to serve a stroke model to model Each service requires ^^ shop and requires the service of the spear force ^ ^ order. The simulation ⑼ uses 4 · Vehicle routing. The route from w to the destination machine may be sh—a system. Viewer use 5. Vehicle route conflicts Idle ’If there is—an idle vehicle possesses its route,; ==: the route. Vehicle Route Conflict Model-Model this. 6. Vehicle movement behavior. The moving die of the vehicle shows the charm of the 4 non-team theory that there will be acceleration and deceleration in the crane process System hiq) ^ Η, A7 V. Description of the invention (6) After the production is over, when the work is completed-Qi, if the machine is waiting for you, then the machine will do it. In the manufacturing plant, there will usually be order-bought goods & select Dubbe ’s priority rule, in order to calculate the processing priority of each arrival, each time the machine faces the selection, The next batch to be processed can be selected according to this priority. However, due to the arrival of new materials and materials, and the Japanese-Japanese fast-moving nature of the priority of shipment, the traditional model must consume the order of f and f. The queuing theory is attractive for solving this purpose. This book; = ^. In the past, such systems where the priority of shipments will change over time have been studied in depth. In addition-in the model proposed by this patent, there are several counties for the shipments. A priority level is provided with a pair of parameters and c ,. For each batch that belongs to the priority level /, its priority value in the column is calculated by bi + Cjx waiting time. The face of which is · g ίζ · Teng refers to the waiting time in the Zipai line. This excellent, equal_definition method can provide the rule of priority calculation for the loser, and it is also compatible with many previous common rules, such as FIFO, Last-in, last-out, least remaining process priority, shortest delivery time priority, etc. The first-in-first-out rule is listed below as an example. 4 (a) indicates the priority level of a certain type of batch, from an appropriate large value, // for all Number of priority levels, ^ is Μ Μ hci = z upon arrival of t〇ken, V / = 1, ..., // This paper size is applicable to the Chinese National Standard (CNS) A4 specification (210 χ 297 mm J— · --------------- ^- ------- ^ (Please read the Zhuyin on the back? Matters before filling out this page)

w P V:P,W,w P V: P, W,

b — -么,=丨A -—--- r _ 1-' ί V CP ~~ Ci Γκ~ - Σ 二 A c ~~c Ί ~^L L bt =/) + 1 1 經濟部智慧財產局員工消費合作社印製b —-Mody, = 丨 A -—--- r _ 1- 'ί V CP ~~ Ci Γκ ~-Σ Two A c ~~ c Ί ~ ^ LL bt = /) + 1 1 Bureau of Intellectual Property, Ministry of Economic Affairs Printed by Employee Consumer Cooperative

台剩餘處理時間,為優先等級,的批貨的平 计式,對於母一個在佇列中的批貨,我們 «統的效能。2^^===_度,增進模 修改為據此理論峨物==有的:_爭子網路 在制等斜_計算式巾,批t的抵魏率是— 數(與A成正比),為了即時反應廠内變化 二 精確度,本專利設計了-個批·達速率yf4待時間的 作用在於累計批貨的抵達數,定期更新批貨抵::率:組的 ♦模擬器 本紙張尺度適用中關家標準(CNS)A4規石⑽x 297公爱'The remaining processing time of the platform is a priority formula for the batch. For the batch of the parent in the queue, we «system efficiency. 2 ^^ === _ degree, the modification module is modified to the theory according to this article == Yes: _ contending network is making iso-sloping _ calculation formula, the rejection rate of batch t is — number (consistent with A Proportional), in order to reflect the second precision within the plant immediately, this patent has designed a batch · reach rate yf4. The effect of waiting time is to accumulate the number of arrivals of the batch, and regularly update the batch arrival :: rate: group simulator This paper size is applicable to Zhongguanjia Standard (CNS) A4 Rule Shijie x 297 Public Love '

I. _裝 訂---------線j (請先閱讀背面之注意事項再填寫本頁) 583560 A7 五、發明說明(8 ) 在建立起底層模型之後,吾人需要一套工具來整合模型以 及其中机動的資汛,而這正是模擬引擎的工作。模擬引擎中的 貝料主要分為兩大類,一類是物品的物理屬性,例如機台位置、 機台製程能力、機台製程時間等等,另一類則是控制法則,例 如機台選擇法則、優先等級參數、載具相關法則。這些資訊可 峨製造執行I财取得,或者由製造廠管理者來設定。值得 一提的是,由於底層模型的彈性與模組化,對於不同的製造廠 配置^莫擬引擎本身並不需要修改,製造廠的實際情況可簡單 透過^料流的部份來反應,這使得本專利之模擬器的適用範圍 大為提升。底層模型的細緻度以及排隊理論的整合,也使得模 擬器的精準度以及效能切合業者的需求,得以在很短的時間内 ^應整廠的生產狀況,並提者作為各鄕略的依據。除了 扣準度之外,模型的細緻度還帶來另一項特點。業者可針對任 :模擬時_取廠_—批貨或者任—機台離態,深入了解 中母-個細節。模擬器的另一項重要功能是可以預測批 貝的=期。本專利之模㈣接受制者輸人—種批貨進廢的策 =,若以此魏策略以及目前廠崎況為基礎進行模擬,則相 二於對未來的-段時間進行預測。批貨的交期酬對於製造業 非系重要’ k不僅是對製造i產能的—種評估,更是用以爭 取訂單的重要依據。 ♦排程器 在製造廠中,最重要的幾個指標有批貨總生產時間、製造 能以及批貨達交率。除了購買更多樣化、更高效能的設備 X 297公釐) 請 先 t 間 1 丨讀 背 1 面 I 之 | 注 I 意 匿 I 事 1 | 頊 扉 存 Φ 填 寫 裝 本 • 頁 1 | 1 1 1 1 1 訂 本紙張尺度_ 家鮮(cns)A4^^ 583560I. _Binding --------- Line j (Please read the notes on the back before filling this page) 583560 A7 V. Invention Description (8) After establishing the underlying model, I need a set of tools to Integrate the model and the manoeuvres in it, and this is exactly what the simulation engine does. The shell materials in the simulation engine are mainly divided into two categories, one is the physical attributes of the item, such as machine position, machine process capability, machine process time, etc., and the other is control rules, such as machine selection rule, priority Level parameters, vehicle related laws. This information can be obtained by E-manufacturing executives, or set by the factory manager. It is worth mentioning that due to the flexibility and modularity of the underlying model, it is not necessary to modify the engine configuration for different manufacturers. The actual situation of the manufacturer can be simply reflected by the part of the material stream. The application scope of the simulator of this patent is greatly improved. The meticulousness of the underlying model and the integration of the queuing theory also make the accuracy and efficiency of the simulator meet the needs of the industry, which can respond to the production status of the entire plant in a short period of time, and provide the basis for each strategy. In addition to the degree of deduction, the model's meticulousness brings another characteristic. Operators can understand the details of Zhongmu in detail: for __simulation_take_factory__approval or __machine-off-state. Another important feature of the simulator is that it can predict the batch period. The model of this patent accepts the input of the manufacturer—a policy for the receipt and rejection of a batch of goods. If the simulation is based on Wei ’s strategy and the current plant and slate conditions, it is more important to predict the future period of time. The payment of the delivery of batches is not important to the manufacturing industry. K is not only an assessment of the manufacturing capacity, but also an important basis for contending for orders. ♦ Scheduler In a manufacturing plant, the most important indicators are the total production time of batches, manufacturing capacity, and the delivery rate of batches. In addition to purchasing more diversified and more efficient equipment X 297 mm) Please read t 1 1 丨 read the back 1 of the | I note I do not know the matter 1 | 顼 扉 save Φ Fill out the book • Page 1 | 1 1 1 1 1 Book size _ 家 鲜 (cns) A4 ^^ 583560

經濟部智慧財產局員工消費合作社印製Printed by the Consumer Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs

㈣土簡柱热疑是最關鍵的因素。一般來說,批貨生 產排程包括有批貨進絲略、機台選擇策略 則。在本糊之_便設計—排嫌 _= 策略與批貨優先權法則的組合,進而滿足管理者理想的ir值 排程的搜尋與排程的評估,本專利的排程器 ^用逍傳基□料法為達成此二目標的手段。遺傳基因渾算法 疋-知名的隨機搜尋演算法,_於在龐大的解尋 佳解。遺傳基_算法之基本步驟,是從—群個财,評估 1 個個體的適合度,並以此適合度作為個體間交配、突變等演化 ’每經過—代的演化,意謂著新的子代可能會崎 二用遺傳基因演算法的一個關鍵點在於能否找到:r方法。所謂的基因編碼,指的是就是如何 將問射的—轉(在半導體晶®顧排關射即為一套排 峨,㈣—侧㈣糊的排程器 二擇朿略疋以-個批貨為單位’每個批貨如果有所個 =程=,則勤選擇策略的基因^個整數,每— 表一種機台選擇策略。而批貨優先權的編碼是以—個機= ,,假設全廠有”個批貨,雜貨優先獅基^數 =整數麵-個優絲級。—個完整的基因= 機台選擇策略基因與所有機台的批貨優先權基因串接=成貝的 ,程的評估是經由本專利之模擬器來完成。由於模擬哭罝 備快輪難力,目此排雜能夠在⑽竭時間求得。^ _台選擇策略與批貨優域法則的組合。此外,本專利^子 的編碼方式相容於傳統的人卫排程策略,因此對於尚未全出The most critical factor is the suspicion of the simple soil column. Generally speaking, the batch production schedule includes a batch purchase strategy and machine selection strategy. In this _convenience design—scheduled _ = combination of strategy and approval priority rule, and then satisfy the manager ’s ideal ir value schedule search and schedule evaluation, the scheduler of this patent ^ uses Xiao Chuan The basic materials method is a means to achieve these two goals. Genetic algorithm 疋-well-known random search algorithm, _ Yu in the huge solution to find a good solution. The basic step of the genetic algorithm is to evaluate the fitness of an individual from a group of wealth, and use this fitness as the evolution of mating and mutation between individuals. The evolution of each generation means a new child. One of the key points that generations might use the genetic algorithm is whether they can find the: r method. The so-called gene coding refers to how to turn the shots into turns (in the semiconductor crystal ® Gu Pai off shot is a set of rowing, and the scheduler of the side-side paste the second choice is slightly different-a batch If the shipment is a unit, if there is one for each batch of goods, the number of genes for the selection strategy is ^ integers, and each — indicates a machine selection strategy. The code for the priority of the shipment is — one machine = ,, Assume that there are “batch shipments” in the whole factory, and the number of general merchandise priority is equal to the number of integers and the number of excellent silks. — A complete gene = The machine selection strategy gene is concatenated with the gene of shipment preference for all machines = Cheng Bei The evaluation of Cheng is completed by the simulator of this patent. Due to the difficulty of simulating the preparation of fast wheels, it can be found in the exhaustion time. ^ _ Combination of Taiwan's selection strategy and the principle of the best area of approval In addition, the encoding method of this patent is compatible with the traditional health scheduling strategy, so

本紙張尺度適用中國國家標準(CNS)Α4規格(210 X 297^17This paper size applies to China National Standard (CNS) A4 (210 X 297 ^ 17

丨ί · _裝--------訂---------線· (請先閱讀背面之注咅?事項再填寫本頁) 經濟部智慧財產局員工消費合作社印製 583560 五、發明說明(10 ) 動化的製造廠,本排程器仍然可以提供排程方面的協助。 圖示說明 圖一.系統整體結構圖 、此圖標示系統中主要分為模擬器與排程器兩部份。模擬器 列式斐氏網路建構底層模型,模型之上是製造廄中主要的 圖二·系統底層模型結構圖 *此圖標示系統中主要的三大模型,以及各模型所包含的子 模型。 圖三·傳統資源競爭子網路 ,每一個批貨都要等待上一個批貨使用完機台,釋放機台之 後,才能進入機台處理。傳統資源競爭子網路在面對多於一個 等待的批貨時,必須經常計算批貨的優先權,以選出下一個應 党處理的批貨。 〜 圖四·新式資源佇列子網路 >每個批^在進入機台的佇列時,便可以立即計算該批貨 的等待時間,等待時間—過,批貨自然就會進人機台進行處理。 在新式貧源仔列子網路中,子網路不需要耗費多餘時間在計算 ί貨優先權與選擇批貨。另外,資源㈣子網路中内含-娜 貝抵達率更新权組,藉由定時更新抵達率的動作反映出批貨在 薇中流動的情況,同時也增進等待時間公式值的精準度。 本紙張尺度翻丁關家鮮(CNS)A4雜(21G χ -JIU1I.-------·裝--------訂---------線· (請先閱讀背面之注咅?事項再填寫本頁) 583560 A7 B7 五、發明說明(11 ) 圖五·批貨的優先權值對時間的變化示意圖 假設批貨在時間點Γ進入機台佇列,批貨所屬優先等級為 尸,其對應優先權參數為〜與^,則該批貨的優先權值隨時間 的變化如此圖所示。 圖六·批貨工作流程圖 此圖以批貨為觀點來檢視廠内的生產流程。當批貨準備進 入下一製程時,首先必須進行選擇機台的程序,以便在具有適 當製程能力機台群組中選擇一部機台,並進入該機台佇列等 待。如果該機台離目前機台太遠,則需要藉助搬運系統。當機 台選擇處理該批貨時,首先審視是否需要重新前置作業,二外 在處理批貨過程中,也可能發生機台停工的狀況。此時機台進 打維修,而正在處理的批貨則重新進行機台選擇程序 外的適當機台。 ★另 圖七.批貨選擇流程圖 此圖為機台選擇符列上等候的批貨的示意圖。傳統 系統便是遷照此流程動作。然而,在本專利所提出之系统中, 這些計算優先權與選擇批貨的動作,已 所計算出來的仵列等待時間之中。 剛_里卿 經濟部智慧財產局員工消費合作社印製 圖八·遺傳基因演算法的基因編石馬示意圖 排程器中的基因主要分成兩部份, 為優先權等級。在機台選_方,— 批貨在某一個製程的機台選擇法則,如最短仔職度優先法^ 583560 A7 _B7_ 五、發明說明(12) 等等。在優先權等級方面,每一個基因代表某一個批貨在某一 個機台的優先權等級。 圖九.遺傳基因演算法流程圖 此圖用以解說遺傳基因演算法的運作流程。 圖式簡單說明 圖一.系統整體結構圖 圖二.系統底層模型結構圖 圖三·傳統資源競爭子網路 圖四.新式資源仔列子網路 圖五.批貨的優先權值對時間的變化示意圖 圖六.批貨工作流程圖 圖七.批貨選擇流程圖 圖八.遺傳基因演算法的基因編碼示意圖 圖九.遺傳基因演算法流程圖 .丨ί :-------•裝--------訂---------線#· (請先閱讀背面之注意事項再填寫本頁) 經濟部智慧財產局員工消費合作社印製 本紙張尺度適用中國國家標準(CNS)A4規格(210 X 297公釐)丨 ί · _ installed -------- order --------- line · (Please read the note on the back? Matters before filling out this page) Printed by the Consumer Cooperative of the Intellectual Property Bureau of the Ministry of Economic Affairs 583560 5. Description of the invention (10) This scheduler can still provide assistance in scheduling. Illustrated diagram Figure 1. Overall structure of the system This icon shows that the system is mainly divided into two parts, the simulator and the scheduler. Simulator The underlying model of the columnar Fischer network is built on top of the model. Figure 2 · The structure of the system's bottom model * This icon shows the three major models in the system and the sub-models included in each model. Figure 3. Traditional resource competition sub-network. Each batch must wait for the last batch to use the machine. After releasing the machine, it can enter the machine for processing. When traditional resource competition subnets face more than one waiting batch, they must often calculate the priority of the batch to select the next batch to be processed by the party. ~ Figure 4 · New-style resource queue subnet > When each batch ^ enters the queue of the machine, the waiting time for the batch of goods can be calculated immediately. After the waiting time passes, the batch of goods will naturally enter the machine. For processing. In the new poorly-sourced sub-network, the sub-network does not need to spend extra time in calculating the priority of goods and choosing the goods to be approved. In addition, the resource sub-network contains the -Nabe arrival rate update right group. The action of regularly updating the arrival rate reflects the flow of shipments in Wei, and also improves the accuracy of the waiting time formula value. The size of this paper is Ding Guanjiaxian (CNS) A4 (21G χ -JIU1I .------- · installation -------- order --------- line · (please First read the note on the back? Matters and then fill out this page) 583560 A7 B7 V. Description of the invention (11) Figure V. Schematic diagram of the change in the priority value of a batch of goods over time Assuming that the batch of goods enters the machine queue at time Γ, The priority level of the batch is corpse, and its corresponding priority parameter is ~ and ^, then the change of the priority value of the batch with time is shown in this figure. Figure 6. Flow chart of the batch work This figure is from the perspective of the batch Let's review the production process in the factory. When the batch is ready to enter the next process, the machine selection process must be performed first in order to select a machine in the machine group with the appropriate process capability and enter the machine. Waiting. If the machine is too far away from the current machine, you need to use the handling system. When the machine chooses to process the batch of goods, first check whether the pre-operation needs to be re-started. Second, in the process of processing the batch, it may also A machine stoppage occurred. At this time, the machine was repaired, and the batch of goods being processed was restarted. Select the appropriate machine outside the program. ★ Another figure VII. Batch selection flowchart This figure is a schematic diagram of the batch waiting on the machine selection list. The traditional system is to follow this process. However, in this patent office In the proposed system, these actions of calculating priority and selecting batches of goods have been calculated in the waiting time of the queue. Gang_Liqing Printed by the Intellectual Property Bureau of the Ministry of Economic Affairs Employee Consumption Cooperative Figure VIII. Genetic algorithm Genes in the generographer's schematic diagram scheduler are mainly divided into two parts, which are priority levels. In the machine selection method, — the machine selection rules for batch shipments in a certain process, such as the shortest job priority method ^ 583560 A7 _B7_ V. Description of the invention (12), etc. In terms of priority level, each gene represents the priority level of a certain batch of goods on a certain machine. Figure IX. Flow chart of genetic algorithm This figure is used for Explain the operation flow of the genetic algorithm. The diagram is a simple illustration. The overall structure of the system is shown in Figure 2. The structure of the underlying model of the system is shown in Figure 3. The traditional sub-network of competitive resources is shown in Figure 4. Network diagram V. Schematic diagram of the change of priority value of batches over time. Figure 6. Flow chart of batch work. Figure 7. Flow chart of batch selection. Figure 8. Schematic diagram of genetic coding for genetic algorithm. Figure 9. Genetic algorithm Flow chart. 丨 ί: ------- • Installation -------- Order --------- Line # · (Please read the precautions on the back before filling this page) Economy Printed by the Ministry of Intellectual Property Bureau's Consumer Cooperatives, this paper is sized to the Chinese National Standard (CNS) A4 (210 X 297 mm)

Claims (1)

583560 六、申請專利範圍 :?叫'丨 1· 一種應用於半導體晶圓生產之模擬/排程系統,該系統包括: 一工廠模型,該模型乃以斐氏網路建構而成,用以描述工廠 内批貨、機台與載具在生產過程中之狀態變化; 結合斐氏網路與排隊理論,建構新式資源競爭子網路與抵達 率更新子模組,促成一高速之模擬系統; 具備一計算公式,可直接計算工廠内各優先等級之批貨的等 待時間; ' 具備一軟體系統,在輸入製造執行所需的相關資料後,可輸 出指定的模擬時間區段中,批貨與機台的各項數據如生產週 期、機台使用率與生產流程記錄等等; 具備一以遺傳基因演算法為解搜尋法的優化手段,在指定的 排程效能評估函式之下,可產生經優化過之批貨所屬優先等級 與機台選取方式。 2. ^申請專纖圍第丨項所述之模擬/排程祕,該系統之工廉 模型中包含了機台工作模型以及批貨搬運模型。 3·如申請專利範圍第2項所述之模擬/排程系統,其機台工作模 型之特徵是包含了機台檢測、批貨檢測以及機台停工的狀況。 4·如申睛專利範圍第2項所述之模擬/排程系統,其批貨搬運模 型之特徵是模化了載具呼叫、載具選擇、載具運輸規畫、載 具路由、載具路線衝突、載具移動等動作。 5.如申睛專利範圍第i項所述之模擬/排程系統,該系統之軟體 系統提供有工廠運作模擬、工單交期預測以及晶圓生產製造 排程之功能。 583560583560 6. Scope of patent application: 叫 called '丨 1 · A simulation / scheduling system applied to semiconductor wafer production. The system includes: A factory model, which is constructed using a Fischer network to describe Changes in the status of the batch of goods, machines and vehicles in the factory during the production process; Combined with Fischer's network and queuing theory, constructs a new resource competition subnet and arrival rate update submodule, and promotes a high-speed simulation system; A calculation formula that can directly calculate the waiting time for batches of each priority level in the factory; '' Equipped with a software system, after entering the relevant data required for manufacturing execution, it can output the batches and machines in the designated simulation time zone Various data of the station, such as production cycle, machine utilization and production process records, etc .; It has an optimization method that uses genetic algorithms as the solution search method. Under the specified schedule performance evaluation function, it can generate economic data. Optimize the priority level and machine selection method of the batch. 2. ^ Apply for the simulation / scheduling secret described in Item 丨 of the special fiber loop. The system's cheap model includes the machine working model and the batch handling model. 3. The simulation / scheduling system described in item 2 of the scope of patent application, the machine working model is characterized by including machine inspection, batch inspection and machine shutdown status. 4. The simulation / scheduling system as described in item 2 of Shenjing's patent scope, the characteristics of its batch handling model is to model the vehicle call, vehicle selection, vehicle transportation planning, vehicle routing, vehicle Route conflicts, vehicle movements, and more. 5. The simulation / scheduling system described in item i of Shenyan's patent scope. The system's software system provides functions such as factory operation simulation, work order delivery prediction, and wafer production manufacturing scheduling. 583560 9· 專利範圍第5項所述之模擬/排程系統,其中機台仔列 λ! 的批貝其接叉處理的優先次序係由該批貨所屬的優先 寺級與具在佇列的等待時間決定。 Ήw月寸^现圍弟9項所述之模擬/排程系、統,其中所說的 母-個優先等級,·皆有—對參數&與~,每—個㈣中的批 貨,其優先權的計算方式是漏㈣―。9 · The simulation / scheduling system described in item 5 of the patent scope, in which the priority order of the batch processing of the batch λ! Of the machine is determined by the priority level of the batch and the waiting queue. Time is up. Ήw Inch ^ The simulation / scheduling system and system described in the 9th item of the sibling, where the parent-priority levels are mentioned, all have-for the parameters & and ~, each batch of shipments, Its priority is calculated by omission. ^明寸利施圍昂ι〇項所述之模擬/排程系統,其中具備有 Η Λ,可根據批貨優先等級之參數與廠内狀態計算批 貨之等待時間。 12·μ> 1、、明今利乾圍第10項所述之模擬/排程系統,其優先權計 算方式之特徵為除了可自訂優先權計算方式外,尚可以表達^ The simulation / scheduling system described in Mingshi Lishiweiang Item 0, which has Η Λ, which can calculate the waiting time for the shipment according to the parameters of the shipment priority level and the factory status. 12 · μ > 1. The simulation / scheduling system described in item 10 of Mingjin Liganwei, its priority calculation method is characterized by its ability to express in addition to the customizable priority calculation method. 六、申請專利範圍 丨 I__________________— —-.....~~ 數種既有的知名優先權規則如先進先出、後進後出、最小剩 餘製程優先、最短交期優先等。 13. 如申請專利範圍第10項所述之模擬/排程系統,其中所述之 參數匕與c,之設定值可用以反映生產管理者的排程策略。 14. 如申請專利範圍第1項所述之模擬/排程系統,其中排隊理 論用以改良原始的資源競爭子網路,對每一個機台佇列中的 批貨,可根據其優先等級以及批貨在工廠的抵達速度直接計 算該批貨在佇列中的等待時間,其特徵為大幅降低模擬系統 運作的時間複雜度。 15. 如申請專利範圍第13項所述之模擬/排程系統,其中工廠模 型包含有一抵達率更新子模組,該模組會統計歷史資料,並 定期更新批貨抵達率,以增進計算批貨等待時間的精準度。 16. 如申請專利範圍第5項所述之模擬/排程系統,其工單交期 預測功能可以目前廠内狀況為起始,預測一個新進工單的出 廠時間。 17. 如申請專利範圍第5項所述之模擬/排程系統,其晶圓生產 製造排程功能是以一特有基因編碼方法,配合遺傳基因演算 法,以及系統自身的快速模擬功能達成。 18. 如申請專利範圍第16項所述之模擬/排程系統,其基因編碼 方法是由資源基因與工作路由基因組成。 19. 如申請專利範圍第17項所述之資源基因,其表示某一個批 貨在某一部機台上的優先等級。 20. 如申請專利範圍第17項所述之工作路由基因,其表示某一 583560 六、申請專利範圍Sixth, the scope of patent application 丨 I__________________ — ---..... ~~ Several existing well-known priority rules, such as first-in, first-out, last-in, last-out, minimum remaining process priority, shortest delivery period priority, etc. 13. The simulation / scheduling system described in item 10 of the scope of patent application, wherein the set values of the parameters k and c can be used to reflect the scheduling strategy of the production manager. 14. The simulation / scheduling system described in item 1 of the scope of the patent application, in which the queuing theory is used to improve the original resource competition subnet. The batch of goods listed on each machine can be based on its priority level and The arrival speed of the batch of goods in the factory directly calculates the waiting time of the batch of goods in the queue, which is characterized by greatly reducing the time complexity of the simulation system operation. 15. The simulation / scheduling system described in item 13 of the scope of the patent application, where the plant model includes an arrival rate update sub-module, which will collect historical data and periodically update the arrival rate of shipments to improve the calculation of batches. Accuracy of cargo waiting time. 16. According to the simulation / scheduling system described in item 5 of the scope of patent application, the work order delivery time prediction function can start with the current in-plant status and predict the time when a new work order will be released. 17. The simulation / scheduling system described in item 5 of the scope of patent application, the wafer production and manufacturing scheduling function is achieved by a unique gene coding method, combined with genetic algorithm, and the system's own rapid simulation function. 18. The simulation / scheduling system described in item 16 of the scope of patent application, the gene coding method is composed of a resource gene and a work routing gene. 19. The resource gene described in item 17 of the scope of patent application, which indicates the priority level of a certain shipment on a certain machine. 20. The work routing gene described in item 17 of the scope of patent application, which represents a certain 583560 個批貨在選擇某一個製程步驟時對機台的選擇方式。 21.如申請專利範圍第16項所述之模擬/排程系統,其中遺傳基 因演算法的評估函式考慮了批貨的總製造時間、工廠的產率 以及工單的達交率。How to select the machine for each batch when selecting a certain process step. 21. The simulation / scheduling system described in item 16 of the scope of patent application, wherein the evaluation function of the genetic algorithm takes into account the total manufacturing time of the batch, the factory's productivity, and the delivery rate of the work order. 583560 審查意見:圖示第6圖之線條不清晰,請修正。583560 Review opinion: The line in Figure 6 is not clear. Please correct it. 圖六.批貨工作流程圖Figure 6. Work flow chart for batch delivery
TW91103712A 2002-03-01 2002-03-01 Modeling and scheduling of a semiconductor wafer fab TW583560B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW91103712A TW583560B (en) 2002-03-01 2002-03-01 Modeling and scheduling of a semiconductor wafer fab

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW91103712A TW583560B (en) 2002-03-01 2002-03-01 Modeling and scheduling of a semiconductor wafer fab

Publications (1)

Publication Number Publication Date
TW583560B true TW583560B (en) 2004-04-11

Family

ID=34057669

Family Applications (1)

Application Number Title Priority Date Filing Date
TW91103712A TW583560B (en) 2002-03-01 2002-03-01 Modeling and scheduling of a semiconductor wafer fab

Country Status (1)

Country Link
TW (1) TW583560B (en)

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7221994B2 (en) 2004-06-09 2007-05-22 Powerchip Semiconductor Corp. Operational model for simulating manufacture flow and simulating method thereof
TWI391839B (en) * 2009-01-17 2013-04-01 Univ Nat Taiwan Science Tech System and method for assigning resources of semiconductor industry
CN104244605A (en) * 2014-09-03 2014-12-24 东莞市诸葛流智能系统有限公司 Method for improving SMT production efficiency and SMT device utilization rate
CN110675005A (en) * 2019-10-15 2020-01-10 深圳埃克斯工业自动化有限公司 Intelligent decision-making method based on artificial intelligence technology and ROPN technology
CN111507641A (en) * 2020-04-27 2020-08-07 上海华力集成电路制造有限公司 Batch processing equipment scheduling method and device
TWI802064B (en) * 2021-10-28 2023-05-11 財團法人工業技術研究院 Electronic device and method of filtering dispatching rules for workstation

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7221994B2 (en) 2004-06-09 2007-05-22 Powerchip Semiconductor Corp. Operational model for simulating manufacture flow and simulating method thereof
TWI391839B (en) * 2009-01-17 2013-04-01 Univ Nat Taiwan Science Tech System and method for assigning resources of semiconductor industry
CN104244605A (en) * 2014-09-03 2014-12-24 东莞市诸葛流智能系统有限公司 Method for improving SMT production efficiency and SMT device utilization rate
CN104244605B (en) * 2014-09-03 2017-03-22 东莞市诸葛流智能系统有限公司 Method for improving SMT production efficiency and SMT device utilization rate
CN110675005A (en) * 2019-10-15 2020-01-10 深圳埃克斯工业自动化有限公司 Intelligent decision-making method based on artificial intelligence technology and ROPN technology
CN110675005B (en) * 2019-10-15 2021-12-07 埃克斯工业(广东)有限公司 Intelligent decision-making method based on artificial intelligence technology and ROPN technology
CN111507641A (en) * 2020-04-27 2020-08-07 上海华力集成电路制造有限公司 Batch processing equipment scheduling method and device
TWI802064B (en) * 2021-10-28 2023-05-11 財團法人工業技術研究院 Electronic device and method of filtering dispatching rules for workstation

Similar Documents

Publication Publication Date Title
Wang et al. An improved particle swarm optimization algorithm for dynamic job shop scheduling problems with random job arrivals
Schönemann et al. Simulation of matrix-structured manufacturing systems
Jiang et al. Distributed dynamic scheduling for cyber-physical production systems based on a multi-agent system
Gomes et al. Reactive scheduling in a make-to-order flexible job shop with re-entrant process and assembly: a mathematical programming approach
Irani et al. Value stream mapping of a complete product
Zhang et al. Multi-level inventory matching and order planning under the hybrid Make-To-Order/Make-To-Stock production environment for steel plants via Particle Swarm Optimization
CN105974891B (en) A kind of mold production process self-adaptation control method based on dynamic billboard
JP2012194712A (en) Production plan creation method
Bang et al. Scheduling algorithms for a semiconductor probing facility
Lim et al. Fast scheduling of semiconductor manufacturing facilities using case-based reasoning
Shahvari et al. A bi-objective batch processing problem with dual-resources on unrelated-parallel machines
JP2016151940A (en) Operation plan creation assistance system for car sharing system
Lin et al. A case study of batch scheduling for an assembly shop
TW583560B (en) Modeling and scheduling of a semiconductor wafer fab
Biele et al. Decomposition methods for cost and tardiness reduction in aircraft manufacturing flow lines
Fu et al. Batch production scheduling for semiconductor back-end operations
Wang et al. Independent double DQN-based multi-agent reinforcement learning approach for online two-stage hybrid flow shop scheduling with batch machines
Shafaei et al. Efficient meta heuristic algorithms to minimize mean flow time in no-wait two stage flow shops with parallel and identical machines
Kamali et al. An immune-based multi-agent system for flexible job shop scheduling problem in dynamic and multi-objective environments
Weng et al. Control methods for dynamic time-based manufacturing under customized product lead times
Ferreira et al. Performance comparison of the virtual cell layout with cellular and job shop configurations using simulation and design of experiments
Esmailnezhad et al. A two-stage stochastic supply chain scheduling problem with production in cellular manufacturing environment: A case study
Zuo et al. Cigarette production scheduling by combining workflow model and immune algorithm
Chang et al. Applied variable neighborhood search-based approach to solve two-stage supply chain scheduling problems
Chen et al. Multiobjective order assignment optimization in a global multiple-factory environment

Legal Events

Date Code Title Description
MK4A Expiration of patent term of an invention patent