TWI230880B - Semiconductor dispatching integration system and method using the same to dispatch - Google Patents

Semiconductor dispatching integration system and method using the same to dispatch Download PDF

Info

Publication number
TWI230880B
TWI230880B TW91118775A TW91118775A TWI230880B TW I230880 B TWI230880 B TW I230880B TW 91118775 A TW91118775 A TW 91118775A TW 91118775 A TW91118775 A TW 91118775A TW I230880 B TWI230880 B TW I230880B
Authority
TW
Taiwan
Prior art keywords
batch
machine
dispatching
dispatch
semiconductor
Prior art date
Application number
TW91118775A
Other languages
Chinese (zh)
Inventor
Ming Wang
Jim Chue
Ray Shih
Eric Chang
Jason Liu
Original Assignee
Taiwan Semiconductor Mfg
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 Taiwan Semiconductor Mfg filed Critical Taiwan Semiconductor Mfg
Priority to TW91118775A priority Critical patent/TWI230880B/en
Application granted granted Critical
Publication of TWI230880B publication Critical patent/TWI230880B/en

Links

Abstract

A semiconductor dispatching integration system includes a manufacture scheduling system for generating manufacture schedule and related evaluation result; a dispatching system for generating dispatching schedule and related evaluation result; an automatic transporting system for estimating the transport cost of each transporting route; and a rule base decision engine for determining the dispatching sequence and the corresponding machines for each batch based on the manufacture schedule plan, the dispatching plan and the transport cost calculated by the transporting system, wherein the rule base decision engine changes the decision condition by directly inserting or deleting rules without rebooting the rule base decision engine.

Description

1230880 五、發明說明(1) 發明領域 …本發明係有關於半導體生產製造管理,特別有關於— 種半導體生產之派工整合系統與藉其進行派工之方法。 發明背景 對於半導體生產而言,半導體晶圓代工由於其代工生 產種類與製程步驟多樣化,因而生產排程(Schedule)與派 工(dispatching)則成為生產管理的重要關鍵。 y般而言,製造廠的生產排程(ScheduHng SyStem) 主要疋考慮長期派工計畫,如每年、每半年或每季。 ίΪΪΪ策ί要為了幾個目的…提高製造廠的晶圓納 (、降Γ.製造廠中的每片晶圓的製造時間以降低: 率(H , rprocess,WIP)總量、或提高設備利用 革(tool utility),持續維持產能滿載等。 用 然而在生產排程擬定後,各妣呤普 廠内狀況進行短期内的批次派工非程實;投產0寺’則根據 及多步驟製造程序與多種類製造=,=半導㈣造涉 的考量除需考慮批次的優先順序外, ^,各批=派工 量與製造程序間的搭配情況,。到量可用機台數 P_到最大。因:二===不 一疋與生產排程政策完全相符。 、氏 對於半導體代工薇而言,常見的_ ^ 中同日车古斗方外金U 4么从吊見的情况是製造廠的管理 中冋時有生產计畫排程糸統與機台派 獨立產生生產排程計書與生產批呤.rr τ ?辰工糸統個: 座批-人派工計晝。然而這兩種 0503-7433TWF ; TSMC2001-1314 » peggy.ptd $ 5頁1230880 V. Description of the invention (1) Field of invention… The present invention relates to semiconductor manufacturing and manufacturing management, and in particular, to a semiconductor production integration system and a method for dispatching work through it. BACKGROUND OF THE INVENTION For semiconductor production, due to the variety of foundry production types and process steps, the production schedule and dispatching of semiconductor wafer foundry have become important keys for production management. Generally speaking, the production schedule of the manufacturing plant (ScheduHng SyStem) mainly considers long-term dispatch plans, such as annually, semi-annually or quarterly. ίΪΪΪ 策 ί For several purposes ... increase the wafer soak of the manufacturing plant (, reduce the manufacturing time of each wafer in the manufacturing plant to reduce: the total amount of rate (H, rprocess, WIP), or increase the use of equipment (Tool utility), continuous maintenance of full capacity, etc. However, after the production schedule is formulated, batch conditions in the short-term conditions of each purine plant are not dispatched in real time; the production of 0 temples is based on multi-step manufacturing Procedures and multiple types of manufacturing =, = considerations related to semi-conductor manufacturing, in addition to the priority order of the batch, ^, each batch = the allocation between the amount of labor and the manufacturing process, the number of available machines P_ To the maximum. Because: two === not one is in full compliance with the production scheduling policy. For semiconductor foundry Wei, common _ ^ Zhongtong Che Gudou Fangjin Jin U 4 Mody from the standpoint is manufacturing In the management of the factory, there are production schedules and machine dispatching systems that independently produce production schedules and production batches. 0503-7433TWF; TSMC2001-1314 »peggy.ptd $ 5 pages

1230880 五、發明說明(2) 所產生的派卫表會由於評估 對於製造廠“,生產排程系: ,往派工?議’會造成線上派工的困•。也因此 的派工#装上人員分別根據排程系統與派工系統所產生 f。基於個人經驗作實際派工分配。然而,這種線 ,二=派工係根據其自身的經驗與製造廠線上狀況決定 派工Is 主觀,製造廠也不易將線上人員的決定内化成 嗔序的因子,作為生產管理的依據。 再者,半導體製造廠的生產排程系統與派工統,常 ::根:製造廠中實際的狀況建立不同的判斷規則與限制 制式:?的生產排程系、统*派工系、统對"^刪除舊的 制或新新條件都涉及相當複雜的處理。一 =進,後,進行重新編譯 =統(reboot system),才能完成修改的動作, 龐大製造資料的製造廠而言相當不便且缺乏彈性。、4· ,曰以製造走向12叶晶圓,而隨著晶圓面積加大 曰曰囫重罝增加,以人工製造廠内的晶圓運送則必項 動化運輸系統取代。因此,隨著全自動化的12吋晶圓、1 展,線上人員對於派工的涉入程度必須降低。也=此β,必 須預先排定最適當的派工順序,降低生產排程與批次派: 間的衝突,以避免晶圓在自動運輸系統中的運送情、、兄 不確定的狀態,浪費製造廠資源。 月’生 發明簡述 為了解決上述問題,本發明的一個目的在於提供一種1230880 V. Description of the invention (2) The sent watch produced by the manufacturer will be evaluated to the manufacturing factory ", the production schedule is:, sent to work? Negotiation 'will cause difficulties in sending workers online. The superiors are based on the f generated by the scheduling system and the dispatching system. The actual dispatching is based on personal experience. However, this line, two = dispatching department decides dispatching Is subjective based on its own experience and the status of the manufacturing line. It is also difficult for manufacturing plants to internalize the decisions of online personnel into sequential factors as the basis for production management. Furthermore, the production scheduling system and dispatch system of semiconductor manufacturing plants, often :: root: the actual situation in the manufacturing plant Establishing different judgment rules and restrictive systems:? Production scheduling system, unified system, unified system " ^ Deleting the old system or new and new conditions all involve quite complicated processing. One = enter, and then re-run Compilation = system (reboot system) can complete the modification action. The manufacturer with huge manufacturing data is quite inconvenient and inflexible. 4. The process of manufacturing will move towards 12-leaf wafers, and as the area of wafers increases, Yue Zhong Increased, the wafer transport in the manual manufacturing plant must be replaced by an automated transportation system. Therefore, with the fully automated 12-inch wafer, 1 exhibition, the involvement of online personnel in dispatching must be reduced. Also = this β It is necessary to schedule the most appropriate dispatching order in advance to reduce the conflict between production schedule and batch dispatching, in order to avoid the condition of wafers in the automatic transportation system, the uncertain state of the brothers, and wasting manufacturing resources. Brief Description of the Invention of the Invention In order to solve the above problems, an object of the present invention is to provide a

0503-7433TW ; TSMC2001-1314 ; peggy.ptd 第6頁0503-7433TW; TSMC2001-1314; peggy.ptd page 6

五、發明說明(3) ^合一般半導體生產排程系統與派工系統的派工整合系統 :、派工:法’纟同時評估長期生產排程與短期機台派工原 則下’得到一最佳的派工建議。 而為了提高機台利用效能,纟發明的再—個目的在於 =-種半導體派工整合系統與派工方法,係藉由評估自 動搬運成本與重置成本以逹成機台派工的最佳化。 、V 本#發/月的另一個目的在於提供一種規則庫(rule base =的半導體,整合系統與派工方法,係採用規則庫 規貝:料即時運作更新後的系統,而無須重;;Γ (reboot)整個系統,以增加系統管理的效率與彈性。 根據本發明之-種半導體派卫整合系統,係包含:一 生產排程系統,用以產生味吝 、 工系統,用以產生派工排評估結果;-派 運系統,用以估計各搬運路徑之果;-自動化搬 庫決請,用以根據該生=㈡本該=口: 搬運系統計算之搬運成本争定夂^ ^ Θ派工汁旦與该 ,其*,該規則庫決策引擎: = ; =順序與對應機台 擎。 …頁重新啟動(reboot)該規則庫決策引 在較佳情況中,上述系 工系統與自動化搬運系統均可^ ^產排程系統、派 庫決策引擎則以下式決定夂 、般商用系統,而規則 本最小之批次優先派^ : 人之派工成本,並以派工成 1230880V. Description of the invention (3) ^ The dispatching integration system that integrates the general semiconductor production scheduling system and dispatching system :, dispatching: method '纟 Simultaneously evaluate the long-term production scheduling and short-term machine dispatching principle' to get the most Best dispatch suggestions. In order to improve the utilization efficiency of the machine, the second purpose of the invention is to =-a semiconductor dispatching integration system and dispatching method, which evaluates the automatic handling cost and replacement cost to achieve the best machine dispatching. Into. The other purpose of V and V # is to provide a rule base (semiconductor base, integrated system and dispatch method), which uses a rule base to regulate the system: it operates immediately after the update, and does not need to be heavy; Γ (reboot) the entire system to increase the efficiency and flexibility of system management. According to the present invention, a semiconductor sentry integrated system includes: a production scheduling system for generating miso, and an industrial system for generating dispatch Results of the work queue assessment;-the delivery system to estimate the results of each transportation path;-automatic warehouse relocation request, used to determine the transportation cost based on the calculation of the transportation system 该 ^ ^ Θ Dispatch work, and its *, the rule base decision engine: =; = sequence and corresponding machine engine.… Page restart (rule) the rule base decision is in a better case, the above system and automation Both the handling system and the production scheduling system, and the dispatching decision engine determine the general commercial system with the following formula, and the batch with the smallest rule is given priority: The cost of dispatching labor is 1230880.

五、發明說明(4) F =crs + c2*D + c3*T + c4*C + c5 其中,8為生產排程、D為派工排程、τ為搬運系 :之搬運成本、C為搬運系統估計之重置成本、cJ5:: 而為了即時反應自動化搬運系統的 數C3可根據自動化搬運系統之搬運記二,T或常 變數D更可以下式決定各批次^評1^果:而派工排程 D:kl*P + k2*Q + k3*M + k4*R + k5*0 其中,P為該批次之優先順序、q為該批次之 、Μ為若該機台需一組處理量,該批次 、時間 理詈、I?盔, 疋哲匕滿足该組處 理篁R為該機台之相關條件是否滿足處 規則、kl-5為常數。 八他特疋限制 在上述系統中,規則庫決策引擎更 進-步設定條件式限制規則,如: 骤機口條件, (a).當機台品f低於—既定要求時,則先 (monitor wafer); 二片 sm’置超過一既定時間’則先進行熱機片. (C)· S所鴻光罩在機台上時,該批次才可進行·, (d)&滿足一組處理量時,才可進行;等等步驟: # ί統,本發明所提供的一種半導體派工方法 係包括下列步驟:首先,定期產生一生產排法 產批次的優先順序與製程要求。#著,接收_機台要Κ 貨指,。根據機台之跑貨要求,才妾著產生一派工:程’。2 次,評估派工排程中各批次之所需搬運成本。最後,根&V. Description of the invention (4) F = crs + c2 * D + c3 * T + c4 * C + c5 Among them, 8 is the production schedule, D is the dispatching schedule, and τ is the transportation system: the transportation cost, C is Estimated replacement cost of the handling system, cJ5 :: For immediate response, the number C3 of the automated handling system can be based on the handling record of the automated handling system. T or the constant variable D can determine each batch as follows: And the dispatch schedule D: kl * P + k2 * Q + k3 * M + k4 * R + k5 * 0, where P is the priority of the batch, q is the batch, and M is if the machine A set of processing capacity is required. The batch, time management, I? Helmet, and 疋 匕 meet the processing requirements of the group. R is the relevant condition of the machine, and kl-5 is a constant. Octa is limited in the above system, and the rule base decision engine further sets conditional restriction rules, such as: sudden machine conditions, (a). When the machine product f is lower than the established requirements, first ( monitor wafer); The two sm's are placed for more than a predetermined time, then the thermal machine is performed first. (C) · The batch can be carried out only when the photomask of S is on the machine. (d) & It can only be performed when the group processing capacity is set; etc. Steps: # ί Standard, a semiconductor dispatching method provided by the present invention includes the following steps: First, a priority order and a process requirement for a production batch are regularly generated. # 着 , RECEPTION_ The machine wants KK cargo finger. According to the running requirements of the machine, only one group of workers was created: Cheng '. Twice, evaluate the required handling costs for each batch in the dispatch schedule. Finally, root &

12308801230880

泫生產排程、該派工排程與各批 之最佳跑貨批次。 搬運成本決定該機台 藉由上述整合生產排程、 條件’可以避免生產排程與派 並進一步考量在自動化製造廠 的派工批次。 實施例 ^ =排程與搬運成本之各項 ^程產生不—致的結果, 的搬運成本,以產生最佳 根據第1圖,以半導體製造廠 之一實施例中的一種半導體派工 j砰細說明本發明 中,包含生產排程系統110、 在第1圖 統130。生產排程系統"〇乃根據製造動化搬運系 種生產順序與要求,以評估產生;c於批次的各 (一 le)e生產順序或要求產排程 (priority)、批次之製造要求、人之出廠優先順序 -般商用派工系統12。乃評估V造種廠類 2況,以產生實際機台之派工二“:派各^ 短期間内的製造效能與目前機台狀況等資 枓以评估多個批次間派工的先後順序。 、 白私:ί自動化半導體製造廠中,自動化搬運系統1 3〇 (如 物料搬運系統(Automated Material Handling /AMHS)),則在派工流程中用以估計最佳搬運路徑 與各搬運路徑之搬運成本等。自動化搬運系統130可包含 自動化搬運伺服器134與搬運資料庫132。自動化搬運伺服 器1 3 4主要根據各批次目前所在位置與預計到達的位置,泫 The production schedule, the dispatch schedule and the best running batch of each batch. The handling cost determines the machine. By integrating the production schedule and conditions above, the production schedule and dispatch can be avoided and the dispatch batches in the automated manufacturing plant can be further considered. Embodiment ^ = The various processes of scheduling and handling cost produce inconsistent results, and the handling cost is the best to produce a semiconductor dispatcher according to an embodiment of a semiconductor manufacturing plant according to FIG. 1 A detailed description of the present invention includes a production scheduling system 110 and a first system 130. The production scheduling system " 〇 is produced according to the production sequence and requirements of the manufacturing automation handling system to evaluate the production; c (le) e in the batch production sequence or required production schedule (priority), batch manufacturing Requirement, human priority order-general commercial dispatch system12. It is to evaluate the second situation of the V seeding plant to generate the actual dispatching machine 2 ": dispatching each ^ the manufacturing efficiency within a short period of time and the current machine condition, etc. to evaluate the order of dispatching between multiple batches Bai Bai: In an automated semiconductor manufacturing plant, the automated handling system 130 (such as the Material Handling System (Automated Material Handling / AMHS)) is used in the dispatching process to estimate the optimal handling path and each of the handling paths. Transportation cost, etc. The automated handling system 130 may include an automated handling server 134 and a handling database 132. The automated handling server 1 3 4 is mainly based on the current location and expected location of each batch,

1230880 五、發明說明(6) -- 定%產生一運輸表。運輸表中則顯示並記錄各批次的運輸 丨貝序、路徑與運輸時間。而各項有關於自動化搬運之紀錄 則儲存於搬運資料庫1 3 2中。 在上述系統中,生產排程系統110、派工系統120與自 動化搬運系統130均可採用商用產品或各製造廠自行開發 之系統,本發明並非以此為限。 §裝造區1 4 0之機台1 4 4完成一批次之處理,則其機台 控制器142傳送一機台可用訊息至規則庫決策引擎丨5〇,通 知機台1 44可繼續進行下一批次之處理,而規則庫決策引 擎1 5 0則用以決定派工給機台丨4 4之批次。 為了整合上述生產排程系統丨丨〇、派工系統丨2 〇與自動 化搬運系統1 30所產生的資料,根據本發确之半導體派工 整合系統’藉由一規則庫決策引擎丨5〇以統合上述三個系 統之派工相關資料,以做出最佳之派工建議。而規則庫決 策引擎1 5 0之特點在於採用規則庫(r u 1 e b a s e )之架構,可 根據製造廠實際狀況’彈性化的新增與刪除各種派工規 則,而無須重新啟動整個系統。 參見第2圖’進一步詳細說明規則庫決策引擎丨5 〇之架 構。如第2圖所示’規則庫決策引擎丨5 〇可接受各區機台之 訊息’如擴散機台2 1 〇、蝕刻機台2 1 2、微影機台2 1 4等機 台之目前機台狀況。而規則庫決策引擎丨5 〇係整合生產排 程系統11 0、派工系統1 2 〇與自動化搬運系統丨3 〇之資訊。 而除了系統間的資訊整合判斷外,規則庫決策引擎丨5 〇中 更加入各種限制性或條件性規則2 4 〇的彈性化新增、修改1230880 V. Description of the invention (6)-A certain percentage generates a shipping list. The transportation table displays and records the transportation of each batch 丨 shell order, route and transportation time. The records related to the automated handling are stored in the handling database 1 2 3. In the above system, the production scheduling system 110, the dispatching system 120, and the automated handling system 130 can all adopt commercial products or systems developed by various manufacturers, and the present invention is not limited thereto. § Machine 1 14 in the manufacturing area 1 40 completes a batch of processing, then its machine controller 142 sends a machine available message to the rule base decision engine 50, and notifies machine 1 44 to continue The next batch is processed, and the rule base decision engine 150 is used to decide the batch to be dispatched to the machine 44. In order to integrate the data generated by the above-mentioned production scheduling system 丨 丨 〇, dispatching system 丨 20, and the automated handling system 130, the semiconductor dispatching integration system according to the present invention is verified by a rule base decision engine. Integrate the relevant data of the above three systems to make the best suggestions for dispatching. The rule base decision engine 150 is characterized by the use of a rule base (ru 1 e b a s e) architecture, which can flexibly add and delete various dispatch rules according to the actual conditions of the manufacturing plant, without having to restart the entire system. See Figure 2 'for a more detailed description of the architecture of the rule base decision engine. As shown in Fig. 2, the "rule base decision engine 丨 5 〇 can accept the information of the machine in each area" such as the diffusion machine 2 1 〇, etching machine 2 1 2, lithography machine 2 1 4 and other machines Machine condition. The rule base decision engine 丨 50 integrates the information of the production scheduling system 1100, the dispatch system 1200 and the automated handling system 丨 30. In addition to the information integration judgment between the systems, the rule base decision engine 丨 50 also adds a variety of restrictive or conditional rules to the flexibility of new additions and modifications.

0503-7433TWF ; TSMC2001-1314 ; peggy.ptd ^ 1Λ _ 弟1U貝 12308800503-7433TWF; TSMC2001-1314; peggy.ptd ^ 1Λ _ brother 1U bay 1230880

五、發明說明(7) 與刪除功能。藉由規則庫(rule base)式的架構,半導體 製造廠中的各種生產條件與限制可以藉由彈性的加入或佟 改刪除規則而達成,而不需要重新編譯(compiler)後再啟 動(reboot)整個決策引擎,造成製造廠的停擺。也因此, 規則庫式的決策引擎架構對於製造廠的派工決策提供更佳 的彈性與便利性,並維持系統的穩定性。 在一較佳實施例中’規則庫決策引擎丨5〇係根據下式 整合上述三個系統間的製造資訊,以評估各預定進行理 之批次的派工成本(F ): F =cl*S + c2*D + c3*T + c4*C + c5 /其中,S為生產排程、D為派工排程、τ為自動化搬運 系統130估計之搬運成本、c為自動化搬運系13〇統估計之 重置成本、cl-5為常數。所得之派工成本(F)越小時, 表示該批次的派工耗用製造廠的生產成本越小,因此其派 工優先順序越南,則優先派工。 在一般的製造廠中,搬運成本很少列入派工考量 然而,根據本發明之系鲚,蔞人白私儿乂 批吹運B太“ 化搬運系統"Ο對各 =二=輸二本(transp〇rt c〇st)與重置成本COM) 的估异’可以精確的掌握最佳的派工狀況。 係 在一自動化搬運系統30 0中 機 =3圖’進一步說明搬運成本與派工決策間的關 -W Λ, . , 一 I、I I 與 I II 依序處 mmVaf送路徑上。其中,由機台1 (31 ◦)至機 輸時間為1分鐘,機台KWG)至機台ΙΙΙ(33〇)之V. Description of the invention (7) and delete function. With a rule base-style architecture, various production conditions and restrictions in a semiconductor manufacturing plant can be achieved by flexibly adding or modifying delete rules, without the need to recompile (reboot) and restart (reboot) The entire decision engine caused a shutdown of the manufacturing plant. Therefore, the rule base-style decision engine architecture provides better flexibility and convenience for the dispatch decision of the manufacturing plant, and maintains the stability of the system. In a preferred embodiment, the 'rule base decision engine 50' integrates the manufacturing information between the three systems according to the following formula to evaluate the dispatch cost (F) of each scheduled batch: F = cl * S + c2 * D + c3 * T + c4 * C + c5 / Among them, S is the production schedule, D is the dispatching schedule, τ is the estimated transportation cost of the automated handling system 130, and c is the automated handling system. Estimated replacement cost, cl-5 is constant. The smaller the obtained dispatching cost (F) is, the smaller the production cost of the batch of dispatching production plants is. Therefore, the dispatching priority of Vietnam is the priority. In a general manufacturing plant, the handling cost is rarely included in the dispatching consideration. However, according to the system of the present invention, the transportation of B is too small. This (transport and replacement cost COM) estimates 'can accurately grasp the best dispatching situation. It is tied to an automated handling system 300 in the machine = 3 maps' to further explain the handling costs and dispatch -W Λ,., I, II, and I II on the mmVaf delivery path in order. Among them, the time from machine 1 (31 ◦) to machine transmission is 1 minute, machine KWG) to machine Taiwan ΙΙΙ (33〇)

1230880 五、發明說明(8) 運輸時間為1 0分鐘。當機台丨J丨(3 3 〇 )送出一可繼續處理下 一批次之訊息時,則機台I ( 3 1 0 )之一批次342與機台 1 1 ( 320 )之一批次344均等待送至機台HK330 )進行下_階 段之處理’而根據生產排程與派工排程的評估結果,若^ 次342之優先順序優於批次344,在一般的情況中,則應 先運輸批次342至機台111(33〇)進行處理。然而,機台〜μ I I I ( 3 3 0 )的處理時間為5分鐘,而運輸批次3 4 2至機台 1 1 1 ( 33 0 )搬運時間為10分鐘。而雖然批次344之優先順 較低,但是,若先運送批次344至機台丨丨1(33〇)並完 理,則僅需花費搬運時間丨分鐘與處理時間5分鐘,共6八 鐘的時間。因此,顯然批次344之搬運成本遠低於批次刀 342,因此,規則庫決策引擎15〇會根據整合搬運成本的 訊,先進行批次344到機台In的運輸與處理,並同時開始 運輸批次342,以在批次344完成機台! ° 可繼續進行批次342之處理。 ’们爽理後, 而重置成本(reset cost)則是考量自 U0中的搬運狀態。以第3圖為例,當自 始進行搬運批次344至其他機台時,搬運』、、先已2 ϊί344將目運前送保Λ在機台1 1 ( 320)時’則…^ LI:的本運7本V而重新給… 4., t 5^150 ,, , „ ^ 量,以更精確的掌握派工成本 為 置成本列入考 運系統130的現況,來數τ或常數即時反應自動化搬 m书數C3可根據自動化搬運系統 0503-7433TWF : TSMC200M314 ; peggy.ptd 第12頁 12308801230880 V. Description of the invention (8) The transportation time is 10 minutes. When machine 丨 J 丨 (3 3 〇) sends a message that can continue to process the next batch, one batch 342 of machine I (3 1 0) and one batch of machine 1 1 (320) 344 are waiting to be sent to the machine HK330) for the next _stage processing 'and according to the evaluation results of the production schedule and dispatch schedule, if the priority of ^ times 342 is better than batch 344, in general, then Batch 342 should be transported to machine 111 (33 °) for processing. However, the processing time from the machine to μ I I I (3 3 0) is 5 minutes, and the transportation time from the transport batch 3 4 2 to the machine 1 1 1 (33 0) is 10 minutes. Although the priority of batch 344 is lower, if the batch 344 is transported to the machine 丨 丨 1 (33〇) and finished, it will only take hauling time 丨 minutes and processing time 5 minutes, a total of 68 Clock time. Therefore, it is clear that the handling cost of batch 344 is much lower than that of batch knife 342. Therefore, the rule base decision engine 15 will first carry out the transportation and processing of batch 344 to machine In according to the information of the integrated transportation cost, and start at the same time. Transport lot 342 to complete the machine in lot 344! ° Processing of batch 342 can continue. After we sorted it out, the reset cost is considered from the transport state in U0. Take the third picture as an example, when the batch 344 is moved to other machines from the beginning, it will be transported "," Xiang 344 "will be delivered to the security center Λ at the machine 1 1 (320), then ... ^ LI : 7 for this V and give it again ... 4., t 5 ^ 150 ,,, „^ Quantities, with a more accurate grasp of the dispatch cost as the installation cost, is included in the current status of the test system 130, to count τ or a constant Instant response automated moving book number C3 can be based on automated handling system 0503-7433TWF: TSMC200M314; peggy.ptd Page 12 1230880

五、發明說明(9) 130之搬運資料庫132之搬運記錄表更新,例如根據每前一 的搬運記錄更新,以即時掌握自動搬運系統150的 現%搬運狀況,以避免特定搬運路線出現問題 η主f處士人w .丨·…—· t ’無法即 在一較佳實施例中,規則庫決策引擎丨5 〇評估、 工系統1 20中的派工排程變數])資料,如下式, 夕派 次之短期派工評估結果: /、定各批 D = kl*P + k2*Q + k3*M + k4*R + k5*0 其中,P為該批次之優先順序、Q為該批次 、Μ為若該機台需一組處理量(Batch),該批次 ,時間 滿足該組處理量之要求、R為該機台之相關條件曰董是否已 、〇為其他特定限制規則、k丨-5為常數。 疋否滿足 藉由上式考慮派工變數D中的各種可能狀, 步以演算式加權評估其中各項變數的影響程度,’並進一 反映出各批次的派工排程狀況,供作規則庫決ϋ =有效 整合評估派工順序。 、弓丨擎1 5 〇 然而在上述系統中,規則庫決策引擎更可 件,進一步設定條件式限制規則以決定派工批:機台條 不同的機台特十生可設定不㈤的對應規貝q,=而根據 本發明並非以此為限·· Γ巧規則,但 (a)·當機台品質低於一既定要求時,則先 (Amonitor wafer)測試。在機台發生品質不穩定時控片 口不能接著進行下一批貨之處理,而必須 、’則機 後,確定品質在要求範圍内,才能繼續進行正則試 吊批次的處V. Description of the invention (9) The handling record table of the handling database 132 of 130 is updated, for example, according to each previous handling record update, in order to grasp the current handling status of the automatic handling system 150 in real time to avoid problems with specific handling routes. The master f clerk w. 丨 ·… — · t 'cannot be a preferred embodiment, the rule base decision engine 丨 5 evaluation, dispatching variables in the system 1 20]) data, as follows, The evaluation result of the short-term dispatch of the second batch: /. Set each batch D = kl * P + k2 * Q + k3 * M + k4 * R + k5 * 0, where P is the priority of the batch and Q is the Batch and M are if the machine needs a batch of processing capacity (Batch), the batch, the time meets the requirements of the group of processing capacity, R is the relevant conditions of the machine, whether the manager has been, 0 is other specific restrictions , K 丨 -5 are constants.疋 Whether it meets the various possibilities in the dispatching variable D by considering the above formula, and then evaluates the influence of each of the variables with a weighted algorithm, and then reflects the dispatching status of each batch for rules. Library decision ϋ = Effective integration assessment dispatch order. However, in the above-mentioned system, the rule base decision engine is more available, and conditional restriction rules are further set to determine the dispatch batch: different machines with different machine bars can set the corresponding rules. Beq, = and according to the present invention is not limited to this Γ clever rule, but (a) when the quality of the machine is lower than a predetermined requirement, the first (Amonitor wafer) test. When the quality of the machine is unstable, the control panel cannot continue to process the next batch of goods. After the machine is confirmed, the quality must be within the required range before the regular test batch can be continued.

1230880 - mmw 五、發明說明(10) 理。 (b)·當機台閒置超過一既定時間 (seaS〇n - f er) 〇 f ^ ^ ^ ^ ; 而為了保持機台的製c間 二::先進行熱機片進行熱機二 台閒 影製程中,若無光罩 法 1 一人才可進行。在微 以裝載所需之光罩時,方^派工進“理因此,當機台上 必須-次進行一定3:: m可進行。某些機台的處理 考里,因此,此類機台必須考量欲一二疋/ ::::處理*,若無’則需等待或調次= 製造廠實際運作狀況產生的派工冲旦、派工系統120根據 統130的搬運成本評估, 辨私,以及自動化搬運系 資料細中。而規則庫可儲存㈣ 152中累積的所有資料以邏輯' ^ ^擎MO則將決策資料庫 定最佳的派工批次。 、鼻與規則限制等方式,決 接著參見第4圖,詳細說明 ,根據上述半導體整合派工系據本發明之一實施例中 流程。首先進行步驟S4〇 2 ··,定里進仃半導體派工之方法 投產批次的優先順序與製程要^期產生一生產排程以排定 、 衣。一般而言,生產排程系 0503-7433TW ; TSMC2001 -1314 ; peggy.ptd 第14 五、發明說明(11) 統110接會定Λ1生長期的生產排程計書。 接者步驟S4 04 ·技必一 w 一 丨44處理完前一批次後,則/出台一要求跑貨指,。當機台 決策引擎1 5 0。 、 要求靶貨指令給規則庫 接著進行步驟S406 ··根據機台之跑 工排程。t收到該跑貨要求後,則派 產生-派 製造j内的實際狀況,列出一生產排程:序·根據目前 其次進行步驟S4G8 :評估派王排程中 運成本。在派工系統120產生派工排各ϋ所需搬 統则根據排程中所有等待派工的批次位二= ^次運輸至機台!44進行處理之預估搬運成本與重置成本 最後進行步驟S4 10 ··根據生產排程、派工排程盥 ΐιΐο搬可運Λ本广定該機台之最佳跑貨批次。規則庫二策引 擎150可根據“成本(F,如下式)的估算,得到對於機台 1 4 4之最佳派工批次。 、 F =cl*S + c2*D + c3*T + c4*C + c5 派工成本(F)考慮到s(生產排程)、d(派工排程)、 T(自動化搬運系統丨30估計之搬運成本)、c(自動化搬運系 130統估計之重置成本)等變數,並利用調整cl — 5等常數進 行各項變數的加權設定。而各項變數更可進一步以邏輯演 算式或規則限制的方式作為派工決策的依據。如··派工排 程變數D可藉由如下列邏輯演算式,進一步以決定各批次 之短期派工評估結果:1230880-mmw 5. Description of the Invention (10). (b) · When the machine has been idle for more than a predetermined time (seaS〇n-fer) 〇f ^ ^ ^ ^; In order to maintain the machine room c: 2: first perform hot machine film and perform two hot machine idle process In the case of no mask method, one person can carry out. When loading the required reticle, Fang ^ sent the workers to "therefore, when the machine must be carried out a certain 3 :: m can be carried out. Some of the machine processing test, so this type of machine You must consider whether you want one or two / :::: treatment *, if not, you need to wait or adjust = the dispatching system generated by the actual operating conditions of the manufacturing plant, the dispatching system 120 is based on the transportation cost assessment of the system 130, , As well as the details of the automated handling system. The rule base can store all the data accumulated in ㈣ 152. Logically, ^ ^ Engine MO will determine the decision database to determine the best dispatch batch. Nose and rule restrictions, etc. Next, referring to FIG. 4, a detailed description is given. According to the process of the above-mentioned semiconductor integrated dispatching system according to an embodiment of the present invention, step S402 is first performed. Sequence and manufacturing process should produce a production schedule in order to schedule and make clothes. Generally speaking, the production schedule is 0503-7433TW; TSMC2001 -1314; peggy.ptd Production schedule for Λ1 growth period. Step S4 04 · After the previous batch has been processed, it will be issued / required to run the goods. When the machine decision engine 1 50 0. Requires the target cargo instruction to the rule base and then proceed to step S406. After the delivery request is received, the dispatcher will send out the actual conditions in the dispatcher j, and list a production schedule: sequence · According to the current step S4G8: Evaluate the dispatcher's schedule to transport costs. In the dispatching system 120, the dispatching system needs to be moved according to all the batches waiting for dispatching in the schedule. Two = ^ times to the machine! 44 Estimated handling costs and replacement costs for processing. Finally Proceed to step S4 10 ·· According to the production schedule and dispatching schedule, move and transport Λ Ben Guangding to determine the best running batch of the machine. The rule base two policy engine 150 can be based on "cost (F, as follows ) Estimates to get the best dispatch batch for machine 1 4 4. F = cl * S + c2 * D + c3 * T + c4 * C + c5 The dispatching cost (F) takes into account s (production schedule), d (dispatch schedule), T (automated handling system) 丨 30 Estimated handling costs), c (replacement costs estimated by the 130th automated handling system) and other variables, and use constants such as cl-5 to adjust the weighting of each variable. And each variable can be further based on logic calculations or rules as the basis for dispatch decisions. For example, the dispatching schedule variable D can further determine the short-term dispatching evaluation result of each batch by using the following logical calculation formula:

0503-7433TWF , TSMC2001-1314 ; peggy.ptd 第15頁 1230880 五、發明說明(12) D = krp + k2*Q + k3*M + k4*R + k5*0 為若為批/之優先順4 1為批次之等候時間、Μ 需一組處理量(Batch),抵次數量是否已滿足該 、、且處理置之要求、R為機台之相關條 特定限制規則,而U-5為常數。 疋否滿《〇為其他 因此,藉由上述本發明之丰邕麯击女人 推钭V 知Λ I千导體整合派工系統與藉其 於::ΠΓ\其特點在於可以有效整合半導體廠内關 糸統的相關因子’以決定最佳的派工批次。避 順序ii:i:與一般短期派工系統間可能產生的派工 ^^ ^避免過於倚賴線上人員的個人經驗與決策, 提供自動化半導體製造廢中良好的派n㉟與以’ :者,本發明之派工系統與方法的另一特點在於 2則庫(rule base)的架構,對於整體系統的修改與 >則的调整,提供高度彈性與便利性,同時對於管理者 。,同時兼具易於維護之特性。 -太Ϊ Ξ本發明以較佳實施例揭露如丨,然其並非用以限 ;!=,;何熟悉此項技藝者,在不脫離本發明之精神 園^§可做些許更動與潤飾,因此本發明之保護範 田視後附之申請專利範圍所界定者為準。0503-7433TWF, TSMC2001-1314; peggy.ptd Page 15 1230880 V. Description of the invention (12) D = krp + k2 * Q + k3 * M + k4 * R + k5 * 0 is the priority for the batch / priority 4 1 is the waiting time of the batch, M needs a batch of processing capacity (Batch), whether the number of offsets has met the requirements, and the processing requirements, R is the specific restriction rules of the machine, and U-5 is a constant .疋 No Man's Thing is 0. Therefore, by the above-mentioned Feng Ququn woman's push of the present invention, I know Λ I thousand conductors integrated dispatching system and borrowed from: ΠΓ \ Its characteristics are that it can effectively integrate the semiconductor factory The relevant factors of the system are determined to determine the best dispatch batch. Avoid order ii: i: Dispatch that may occur with general short-term dispatch system ^^ ^ Avoid relying too much on the personal experience and decision of online personnel, and provide good dispatch in automated semiconductor manufacturing waste. Another feature of the dispatching system and method is the structure of two rule bases, which provides a high degree of flexibility and convenience for the modification of the overall system and the adjustment of the rules, and also for managers. At the same time, it also has the characteristics of easy maintenance. -Too Ϊ The present invention is disclosed in a preferred embodiment, but it is not intended to be limited;! = ,; Anyone familiar with this art can make some changes and retouch without departing from the spirit garden of the present invention. Therefore, Fantian of the present invention shall be subject to the definition in the appended patent application scope.

1230880 圖式簡單說明 為了讓本發明之上述目的、特徵、及優點能更明顯易 懂,以下配合所附圖式,作詳細說明如下: 第1圖所示為根據本發明之一實施例中,一種半導體 派工整合系統架構示意圖。 第2圖所示為第1圖之規則庫決策引擎1 5 0之架構示意 圖。 第3圖所示為根據本發明之一實施例中,一種自動化 搬運系統之搬運評估示意圖。 第4圖所示為根據本發明之一實施例中,一種半導體 派工之方法流程。 符號說明 11 0〜生產排程系統; 1 2 0〜派工系統; 1 3 0〜自動化搬運系統; 1 3 2〜搬運資料庫; 1 3 4〜自動化搬運伺服器; 140〜製造區域; 1 4 2〜機台控制器; 144〜機台; 15 0〜規則庫決策引擎; 15 2〜決策資料庫; 2 1 0〜擴散機台; 2 1 2〜蝕刻機台; 2 1 4〜微影機台;1230880 Brief description of the drawings In order to make the foregoing objects, features, and advantages of the present invention more comprehensible, the following detailed description is given in conjunction with the accompanying drawings: FIG. 1 shows an embodiment according to the present invention. A schematic diagram of a semiconductor dispatch integration system architecture. Figure 2 shows the schematic diagram of the rule base decision engine 150 of Figure 1. FIG. 3 is a schematic diagram illustrating the handling evaluation of an automated handling system according to an embodiment of the present invention. FIG. 4 shows a method flow of a semiconductor dispatching method according to an embodiment of the present invention. DESCRIPTION OF SYMBOLS 11 0 ~ Production scheduling system; 1 2 0 ~ Dispatch system; 1 3 0 ~ Automated handling system; 1 3 2 ~ Handling database; 1 3 4 ~ Automated handling server; 140 ~ Manufacturing area; 1 4 2 ~ machine controller; 144 ~ machine; 15 0 ~ rule base decision engine; 15 2 ~ decision database; 2 1 0 ~ diffuse machine; 2 1 2 ~ etching machine; 2 1 4 ~ lithography machine station;

0503-7433TWF ; TSMC200M314 ; peggy.ptd 第17頁 1230880 圖式簡單說明 24 0〜規則I - I I I ; 3 1 0〜機台I ; 32 0〜機台I I ; 3 3 0〜機台I I I ; 34 2-344〜批次; S4 02-S410〜方法流程。 ΙΙΙ·· 0503-7433TWF ; TSMC2001 -1314 ; peggy.ptd 第 18 頁0503-7433TWF; TSMC200M314; peggy.ptd page 17 1230880 Schematic description 24 0 ~ rule I-III; 3 1 0 ~ machine I; 32 0 ~ machine II; 3 3 0 ~ machine III; 34 2 -344 ~ batch; S4 02-S410 ~ method flow. ΙΙΙ ·· 0503-7433TWF; TSMC2001-1314; peggy.ptd page 18

Claims (1)

1230880 修 —案號 91118775 六、申請專利範圍 1 · 一種半導體派工整合系統,係包含: 生產排程系統’用以根據一製造廠對於批次的各種 生產順序與要求,以定期評估產生該製造廠長期之〆生產 排程; 一派工系統,用以根據該製造廠短期間内的製造效能 與每一機台之狀況產生一派工排程; —自動化搬運系統,用以在該等機台間進行運輸,並 计母一批次與每一機台間各搬運路徑之搬運成本;以及 :規則庫決策引擎,整合該生產排程系統、派工系統 把;匕搬運系、统,在收到其中—機台之跑貨請求後, = 程、該派工排程與該自動化搬運系統估計之 跑貨批A:重二一跑貨批次,i致使該自動化搬運系統將該 j批次運輸至傳送該跑貨要求之該機台,以進行處理, 八中,該規則庫決策引擎係以直接新增 改變決策條件。 ㈢及刪除規則之方式 1中V】據ί請專利範圍第1項之半導體派工整合系統, 決策引擎係以下式決定各批次之派工成本, 並以派工成本最小之批次優先派工: F =cl*S + c2*D + c3*T + c4*C + c5 ,其中, S為該生產排程; D為該派工排程; T為該搬運系統估計之搬運成本; C為該搬運系統估計之重置成本; cl -5為常數。1230880 Rev.—Case No. 91118775 6. Scope of Patent Application1. A semiconductor dispatching integration system includes: Production Scheduling System 'is used to periodically evaluate the production of the manufacturing according to the various production orders and requirements of a batch for a manufacturing plant. Long-term production schedule of the factory; A dispatch system to generate a dispatch schedule according to the manufacturing efficiency of the manufacturing plant within a short period of time and the condition of each machine;-an automated handling system to move between these machines Carry out transportation, and calculate the transportation cost between the mother batch and each transportation path between each machine; and: the rule base decision engine, integrate the production scheduling system and dispatch system; Among them-after the machine's request for shipment, = process, the dispatch of the dispatcher and the estimated batch of the automated handling system A: the batch of 21 shipments, i caused the automated handling system to transport the j batch To the machine that transmitted the running cargo request for processing. In the eighth, the rule base decision engine was directly added to change the decision conditions. Method 1 of the method for deleting and deleting rules] According to the semiconductor dispatching integration system in item 1 of the patent scope, the decision engine determines the dispatching cost of each batch according to the following formula, and the batch with the smallest dispatching cost is given priority. Work: F = cl * S + c2 * D + c3 * T + c4 * C + c5, where S is the production schedule; D is the dispatch schedule; T is the estimated handling cost of the handling system; C Estimated replacement cost for the handling system; cl -5 is constant. 0503-7433TWF2(N).ptc 第19頁 1230880 曰 修正 案號 91118775 六、申請專利範圍 3.根據申請專利範圍第2 其中常數c3根據該自動化播、之丰導體派工整合系統, ,、中根據該自動化搬運系統之搬運記錄更新。、、 5.根據申請專利範圍第2項之半導體派工整合 其中])係以下式決定各批次之派工評估結果: /、、 D二kl*P + k2*Q + k3*M + k4*R + k5*〇,其中, P為該批次之優先順序; Q為該批次之等候時間; 處理Μ量為若該機台需一組處理量,該批次是否已滿足該組 R為該機台之相關條件是否滿足; 〇為其他特定限制規則; kl-5為常數。 直Λ=Γ! ί利範圍第1項之半導體派工整合系統, 其中該規則庫決策引擎中更包含根據機 少一條件式限制規則。 係件所》又疋之至 7.根據申請專利範圍第6項之半導體派工 其中該條件式限制規則為下列至少之一: 登口糸、,充, (a) .當機台品質低於一既定要求日夺,則先進 (monitor wafer) ; % 迟仃控片 (b) .當機台閒置超過一既定時間, 光畢在e台上時,該批機-(d )·滿足一組處理量時,才可進行。 敗防丨 第20頁 0503-7433TWF2(N).ptc0503-7433TWF2 (N) .ptc Page 19, 1230880, Amendment No. 91118775 VI. Patent Application Scope 3. According to Patent Application Scope No. 2 where the constant c3 is based on the automatic broadcasting, Zhifeng conductor dispatching integration system, The handling records of the automated handling system are updated. 、, 5. According to the integration of semiconductor dispatching according to item 2 of the scope of patent application]), the evaluation results of dispatching for each batch are determined by the following formula: / ,, D two kl * P + k2 * Q + k3 * M + k4 * R + k5 * 〇, where P is the priority of the batch; Q is the waiting time of the batch; the amount of processing M is whether the batch has met the group R if the machine needs a set of processing capacity Whether the relevant conditions of the machine are met; 〇 is other specific restrictions; kl-5 is a constant. Straight Λ = Γ! The semiconductor dispatching integration system in the first item of the benefit range, wherein the rule base decision engine further includes a conditional restriction rule based on the machine. The “Research Institute” and “7.” According to the semiconductor patent application No. 6 of the scope of the patent application, the conditional restriction rule is at least one of the following: registration, charging, (a). When the quality of the machine is lower than As soon as a predetermined requirement is obtained, the monitor wafer is advanced;% 仃 仃 控 片 (b). When the machine is idle for more than a predetermined time and the light is completely on the e-machine, the machine- (d) · meets a group It can only be carried out when the amount is processed. Defend 丨 page 20 0503-7433TWF2 (N) .ptc 1230880 ^ --案號9111啦__ 年月日 啟X_____ # '申請專概I! ~" " 8 · —種半導體派工方法,係包括下列步驟·· 根據一製造廠對於批次的各種生產順序與要求,以定 期評估產生該製造廄長期之一生產排程; 接收一機台要求之跑貨指令; 根據該製造廠短期間内的製造效能與每一機台之狀況 產生一派工排程; 相應該跑貨指令評估該派工排程中每一批次與每一機 台間之搬運成本; 根據該生產排程、該派工排程與各批次之搬運成本決 定一跑貨批次;以及 透過一自動化搬運系統將該跑貨批次運輸至傳送該跑 貨指令之該機台,以進行處理。 9 ·根據申請專利範圍第8項所述之半導體派工方法, 其令’該根據該生產排程、該派工排程與各批次之搬運成 本決定該跑貨批次之步驟,係以下式決定各批次之派工成 本,並以派工成本最小之批次優先派工: F =cl*S + c2*D + c3*T + c4*C + c5 ,其中, S為該生產排程; D為該派工排程; 丁為該搬運成本; C為搬運之一重置成本; c 1 - 5為常數。 1 0 ·根據申請專利範圍第8項所述之半導體派工方法, 其中常數c3根據一自動化搬運系統之搬運記錄更新。1230880 ^-case number 9111 __ year month day start X_____ # 'application profile I! ~ &Quot; " 8 ·-a method of semiconductor dispatching, including the following steps ·· According to a manufacturer's batch of Various production sequences and requirements to periodically produce a long-term production schedule for the manufacturing; receive a running order required by a machine; produce a dispatch based on the manufacturing efficiency of the manufacturing plant within a short period of time and the status of each machine Scheduling; Evaluate the handling cost of each batch and each machine in the dispatching schedule according to the running order; determine a run based on the production schedule, the dispatching schedule, and the handling costs of each batch The batch of goods; and transporting the batch of goods to the machine that transmits the order of the goods for processing by an automated handling system. 9 · According to the semiconductor dispatch method described in item 8 of the scope of the patent application, the order of 'the step of determining the running batch based on the production schedule, the dispatch schedule, and the handling cost of each batch is as follows: The formula determines the dispatch cost of each batch, and gives priority to the batch with the lowest dispatch cost: F = cl * S + c2 * D + c3 * T + c4 * C + c5, where S is the production schedule D is the dispatching schedule; D is the moving cost; C is the replacement cost of one of the moving; c 1-5 is a constant. 10 · The semiconductor dispatch method according to item 8 of the scope of the patent application, wherein the constant c3 is updated based on a handling record of an automated handling system. 0503-7433TWF2(N).ptc 第21頁 1230880 --- 案號 91118775 六、申請專利範圍 jl·根據申請專利範圍第8項所述之半導體派工方法, 其中T根據一自動化搬運系統之搬運記錄更新。 甘士 η 2 ·根據申明專利範圍第8項所述之半導體派工方法, 中D係以下式決定各批次之派工排程順序: D = kl*P + k2*Q + k3*M + k4*R + k5*〇,其中, P為該批次之優先順序; Q為該批次之等候時間; Μ為右4機台需一組處理量,該批次是否已足該組 處理I ; R為該機台之相關條件是否滿足; 0為其他特定限制規則; kl-5為常數。 =根據申請專利範圍第8項所述之半導體派工方法, 該生產排程、該派工排择與各抵:欠之搬運成本 批次之步驟,更可包括1驟:根據機台條件 又 至夕一條件式限制規則以決疋該跑貨批次。 直中兮條根Λ申請專利範圍第8項所述之半導體派工方法, 八中以條件式限制規則為下列至少之一: 2)·當機台品質低於一既定要求時,則先進行 (monitor wafer) ; ^ ^ ^ j ·田機台閒置超過一既定時間,則先進 (C).當所需光罩在機台上時,該批次才可二钱片; (d )·滿足一組處理量時,才町進行。 仃,0503-7433TWF2 (N) .ptc Page 21 1230880 --- Case No. 91118775 VI. Patent application scope jl. According to the semiconductor dispatch method described in item 8 of the patent application scope, where T is based on the handling record of an automated handling system Update. Gan Shi η 2 · According to the semiconductor dispatch method described in Item 8 of the declared patent scope, D in the series determines the dispatch order of each batch as follows: D = kl * P + k2 * Q + k3 * M + k4 * R + k5 * 〇, where P is the priority of the batch; Q is the waiting time of the batch; M is the right 4 machines need a set of processing capacity, whether the batch has enough processing of the group I R is whether the relevant conditions of the machine are met; 0 is other specific restrictions; kl-5 is a constant. = According to the semiconductor dispatch method described in item 8 of the scope of the patent application, the production schedule, the dispatch selection and each offset: the step of the unpaid handling cost batch can further include 1 step: according to the machine conditions A conditional restriction rule to determine the running lot. The method of semiconductor dispatching described in No. 8 of the scope of patent application by Zhizhong Xigen, VIII. The conditional restriction rule of the Eighth Middle School is at least one of the following: 2) · When the quality of the machine is lower than a predetermined requirement, it is performed first. (monitor wafer); ^ ^ ^ j · If the machine is left idle for more than a predetermined period of time, it will be advanced (C). When the required photomask is on the machine, the lot can only be used for two dollars; (d) · Meet A set of processing capacity is performed by Tachimachi. Alas, 0503-7433TWF2(N).ptc 第22頁0503-7433TWF2 (N) .ptc Page 22
TW91118775A 2002-08-20 2002-08-20 Semiconductor dispatching integration system and method using the same to dispatch TWI230880B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW91118775A TWI230880B (en) 2002-08-20 2002-08-20 Semiconductor dispatching integration system and method using the same to dispatch

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW91118775A TWI230880B (en) 2002-08-20 2002-08-20 Semiconductor dispatching integration system and method using the same to dispatch

Publications (1)

Publication Number Publication Date
TWI230880B true TWI230880B (en) 2005-04-11

Family

ID=36086295

Family Applications (1)

Application Number Title Priority Date Filing Date
TW91118775A TWI230880B (en) 2002-08-20 2002-08-20 Semiconductor dispatching integration system and method using the same to dispatch

Country Status (1)

Country Link
TW (1) TWI230880B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10642257B2 (en) 2017-11-16 2020-05-05 Industrial Technology Research Institute Tree search-based scheduling method and electronic apparatus using the same
CN112666898A (en) * 2019-10-15 2021-04-16 纮织国际有限公司 System combining dynamic production and factory material conveying management

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10642257B2 (en) 2017-11-16 2020-05-05 Industrial Technology Research Institute Tree search-based scheduling method and electronic apparatus using the same
CN112666898A (en) * 2019-10-15 2021-04-16 纮织国际有限公司 System combining dynamic production and factory material conveying management

Similar Documents

Publication Publication Date Title
US6434440B1 (en) Production estimate management system
Sarin et al. A survey of dispatching rules for operational control in wafer fabrication
Johri Practical issues in scheduling and dispatching in semiconductor wafer fabrication
US5818716A (en) Dynamic lot dispatching required turn rate factory control system and method of operation thereof
Liao et al. Daily scheduling for R&D semiconductor fabrication
US7668614B2 (en) Optimization-based process scheduling method and system
US6725122B2 (en) Device and method of selecting photomask manufacturer based on received data
Fowler et al. DISCRETE-EVENT SIMULATION FOR SEMICONDUCTOR WAFER FABRICATION FACILITIES: A TUTORIAL.
US6564113B1 (en) Lot start agent that calculates virtual WIP time in a multi-product and multi-bottleneck manufacturing environment
TWI361790B (en) Scheduling amhs pickup and delivery ahead of schedule
Kim et al. Synchronized production planning and scheduling in semiconductor fabrication
KR20160063289A (en) Method and priority system for inventory management in semiconductor manufacturing
CN105652812A (en) System for pre-scheduling special-batch cargos, and method
Pfund et al. Semiconductor manufacturing scheduling and dispatching: state of the art and survey of needs
Chern et al. Family-based scheduling rules of a sequence-dependent wafer fabrication system
US6711450B1 (en) Integration of business rule parameters in priority setting of wafer processing
US7072731B1 (en) Starvation avoidance lot start agent (SALSA)
US7580766B1 (en) Manufacturing resource planning by entity
JPH06203042A (en) Production line plan generating method
TWI230880B (en) Semiconductor dispatching integration system and method using the same to dispatch
TW200521791A (en) System and method for pull-in order planning and control
US11372396B2 (en) Control product flow of semiconductor manufacture process under time constraints
Lee et al. Production planning in semiconductor wafer fab considering variable cycle times
US20050203655A1 (en) Scheduling system and method for avoiding low equipment utilization
Álvarez et al. A web-based approach for exceptions management in the supply chain

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees