TW200847042A - System and method for planning outputs of stations - Google Patents

System and method for planning outputs of stations Download PDF

Info

Publication number
TW200847042A
TW200847042A TW96118714A TW96118714A TW200847042A TW 200847042 A TW200847042 A TW 200847042A TW 96118714 A TW96118714 A TW 96118714A TW 96118714 A TW96118714 A TW 96118714A TW 200847042 A TW200847042 A TW 200847042A
Authority
TW
Taiwan
Prior art keywords
station
capacity
goods
machine
order
Prior art date
Application number
TW96118714A
Other languages
Chinese (zh)
Inventor
Pu-Yang Yeh
zhi-rong Liang
zhen-bo Wang
bi-juan Wang
Original Assignee
Hon Hai Prec Ind Co Ltd
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 Hon Hai Prec Ind Co Ltd filed Critical Hon Hai Prec Ind Co Ltd
Priority to TW96118714A priority Critical patent/TW200847042A/en
Publication of TW200847042A publication Critical patent/TW200847042A/en

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • General Factory Administration (AREA)

Abstract

The present invention provides a system for planning outputs of stations. The system includes a computer and a database, the database stores orders data and outputs of each station, the computer includes: a data obtaining module for obtaining the order data, the outputs of each station from the database, and obtaining goods quantity for machining of each machine on the station; a station assigning module for assigning machining task of the order to different stations, and a output planning module for searching the machine which has redundant production capacity on the station, and assigning the goods quantity of each station to the machine which has redundant production capacity. A method for planning outputs of stations is also provided. The invention can assign an order to different machines of stations automatically.

Description

200847042 九、發明說明: 【發明所屬之技術領域】 本發明涉及一種工站産能規劃系統及方法。 【先前技術】 工站産能規劃是指將一批貨物訂單分配到不同的工 站及其機台中進行加工,一般而言,一批貨物的加工需要 經過某些具體的工站,在對該貨物進行正式加工前,需要 _ 確定每個工站的産能是否滿足所述貨物訂單的需求。現在 加工部門的作業方式爲人工排配,即所有的貨物訂單都由 各工站有經驗的人員排配。由於每天工作量大,加之排配 人員不能掌控全部工站的工作狀況,所以各工站和工站之 間工作不能協調。各工站銜接不上,工站産能規劃不合理, 經常會出現各工站的機台產能過剩等嚴重浪費大量機台加 工時間的現象。 用這種人工方式來進行工站産能規劃,容易産生各工 _ 站産能排配不合理的現象,使前面的工站閒置沒有貨物加 工,而後面的工站則出現加工貨物過多造成貨物堆積的現 象。 用電腦系統自動對工站産能進行規劃,可以提高工站 産能規劃的效率和準確性,減少人工作業的繁瑣步驟和出 錯率。 【發明内容】 鑒於以上内容,有必要提供一種工站産能規劃系統及 方法,其可自動將貨物訂單分配到不同的工站及其機台中。 200847042200847042 IX. Description of the Invention: [Technical Field of the Invention] The present invention relates to a station capacity planning system and method. [Prior Art] Capacity planning of a station means that a batch of goods orders are distributed to different stations and their machines for processing. Generally speaking, the processing of a batch of goods needs to go through certain concrete stations in the goods. Before formal processing, it is necessary to determine whether the capacity of each station meets the demand for the goods order. The processing department now operates manually, ie all orders for goods are ordered by experienced personnel at each station. Due to the large amount of work per day and the fact that the staff can not control the working conditions of all stations, the work between the stations and the stations cannot be coordinated. The stations cannot be connected, and the capacity planning of the stations is unreasonable. There are often cases where the overcapacity of the machines at each station is seriously wasted and a large amount of machine processing time is wasted. Using this manual method to carry out the capacity planning of the station, it is easy to produce the unreasonable capacity allocation of each station, so that the former station is idle and there is no cargo processing, while the latter station has the excessive accumulation of goods causing the accumulation of goods. phenomenon. Automatic planning of the station's production capacity with a computer system can improve the efficiency and accuracy of the station's capacity planning, and reduce the cumbersome steps and error rates of manual operations. SUMMARY OF THE INVENTION In view of the above, it is necessary to provide a station capacity planning system and method that can automatically assign goods orders to different stations and their machines. 200847042

種工站産能規劃系統,包括主機及資料庫,所述資 料庫中存儲有貨物訂單資料及工站的產能資料,所述訂單 資料包括訂單加工的工站、每個工站如工的貨物數量及所 述工站的加工順序,所述工站的產能資料包括工站包含的 機台數量及每個機台的固定産能,所述主機包括:資料獲 取模組,用於訪問所述資料庫,獲取所述資料庫中的貨物 。丁單資料及所述工站的產能資料,同時獲取所述工站正在 加工的貨物數量;工站分配模組,用於根據所述貨物訂單 需要加工的工站及工站的加工順序將所述貨物訂單分配到 不同工站;產能規劃模組,用於根據所述資料獲取模組獲 取的貨物訂單資料及工站的産能資料在每個工站中尋找^ 剩餘產能的機台,並將所述貨物訂單在每個工站加工的貨 物數量分配給該工站有剩餘産能的機台。 -種工站産能規劃方法’包括如下步驟:獲取資料庫 中的貨物訂單資料及工站的產能資料,同時獲取所述工站 :在加工的貨物數量;根據所述貨物訂單需要加工的工站 工站的加OL順序將所述貨物訂單分配到 所述貨物訂單資料及卫站的産能資料在該」P找= :産能的機台,並將所述貨物訂單在所述工站加:的貨物 數量分配給該4有懈 、站加工的貝物 訂單到-個工站及分配^^機°;重復㈣分配貨物 台,直到所述貨物訂單中的每個工站分配4餘h的機 其可所述的工站産能規劃系統及方法, 中号找有剩餘産能的機台,並將貨物 8 200847042 訂單在每個工站加工的貨物數量分配給該工站中有剩餘産 能的機台,避免了人工進行工站産能排配的繁瑣步驟,提 高了工站産能規劃的效率和準確性。 【實施方式】 參閱圖1所示,係本發明工站産能規劃系統較佳實施 例的系統架構圖。該系統主要包括顯示器1、主機2、鍵盤 3及滑鼠4,所述主機2連接有資料庫5,所述資料庫5存 儲有貨物訂單及工站的産能資料,所述貨物訂單資料包 鲁 括:訂單加工的工站、每個工站加工的貨物數量、加工時 間及順序等。所述工站的産能資料包括:工站的平均産能、 工站的最大産能、工站包含的機台數量、每個機台的固定 產能及機台的工作時間等。所述工站的産能資料可以由用 戶自己設置,例如用戶可以設定每個機台一周的工作時間 及每天的工作時間等。 所述主機2用於根據所述資料庫5中工站的産能資料 φ 對所述貨物訂單進行産能規劃,即將所述貨物訂單分配到 不同的工站及其機台中,並生成一個工站機台作業分配 表。所述工站機台作業分配表中包含有所述貨物訂單分配 的工站及機台。一般而言,——批貨物的加工需要經過某些 具體的工站,在對該貨物進行正式加工前,需要確定所述 工站的産能是否滿足所述貨物訂單的需求。所述主機2連 接有顯示器1、鍵盤3及滑鼠4,用作工站産能規劃時的輸 入、輸出設備。 參閱圖2所示,係圖1所示主機2的功能模組圖。所 9 200847042 述主機2包括資料獲取模經, 規劃模組212、異常資訊輸出模級=配触如,產能 214。本發明所稱的模組是完—并—及E表生成模組 比程式更適合於描錄體在㈣巾H彳===式段, 發明以下對軟體描述中都以模組描述。 壬因此在本 其中,資料獲取模組210用::問所述資 取所述資料庫5中的貨物訂單及所述工站的産能資料’,, 時獲取所述工站正在加工的貨物數量。 同 工站分配模組211用於根據所述貨物訂單需要加 工站及工站的加工順序將所述貨物訂單分配到不同工站的 一個貨物訂單需要加工的工站及每個工站加工的先後順序 是固定的,工站分配模組211依次將所述貨物訂單分配給 每個工站。 産能規劃模組212用於根據資料獲取模挺21〇獲取的 如、物玎單資料及工站的產能資料在每個工站中尋找有剩餘 • 産能的機台,並將所述貨物訂單在每個工站加工的貨物數 量分配給該工站有剩餘産能的機台。具體而言,產能規劃 模組212根據所述工站的産能資料得到所述機台産能的計 算公式,計算出所述工站中每個機台的固定產能。然後, 產能規劃模組212根據所述貨物訂單在該工站需要加工的 貨物數量及該機台正在加工的貨物數量計算出每個機台的 剩餘產能。所述剩餘産能是指機台的固定産能減去所述貨 物訂單在該工站需要加工的貨物數量及該機台正在加工的 貨物數量。如果所述機台的固定產能減去所述貨物訂單在 10 200847042 該工站需要加工的貨物數量及該機台正在加工的貨物數量 大於或等於零,則産能規劃模組212判斷所述機台還有剩 餘産能,並將所述貨物訂單在該工站加工的貨物數量分配 給該機台。例如,某貨物訂單002需要加工的工站爲工站 A、工站B及工站C,加工的順序爲工站A—工站工 站C,工站A中某機台A1的固定産能爲a,所述貨物訂單 002需要在工站A加工的貨物數量爲al。另外,所述機台 A1正在加工貨物訂單001,加工所述貨物訂單001的貨物 ® 數量爲a2。假設將所述貨物訂單002在工站A加工的貨物 數量分配給工站A中的一個機台加工,如果a - ( al+a2) >= 〇,則産能規劃模組212判斷所述機台A1還有剩餘産能。 然後,産能規劃模組212根據同樣的方法在所述工站B和 工站C中尋找有剩餘産能機台,並將所述貨物訂單在工站 B和工站C加工的貨物數量分配給工站B和工站C中有剩 餘産能的機台。 φ 用戶也可以設置將所述貨物訂單在一個工站加工的 貨物數量分配給該工站的多個機台加工,如果所述貨物訂 單在該工站加工的貨物數量分配給該工站的多個機台加 工,則産能規劃模組212根據所述多個機台的固定産能之 和是否大於或等於所述貨物訂單在該工站需要加工的貨物 數量與所述多個機台正在加工的貨物數量之和,判斷該工 站中是否存在剩餘産能的機台。如果所述多個機台的固定 産能之和減去所述貨物訂單在該工站需要加工的貨物數量 與所述多個機台正在加工的貨物數量大於或等於零,則産 11 200847042 •能規劃模組212判斷該工站中存在剩餘産能的機台,並將 述貨物訂單在該工站加工的貨物數量分配給所述多個機 異常資訊輸出模組213用於當所述産能規劃模組 =有在所述工站中尋找到有剩餘産能的機台時,輪出異也 貝讯亚將該異常貢訊以電子郵件的形式發送給相關部門 主管。所述異常資訊包括有所述貨物訂單的資料及所述棬 • 台所缺産能的數量等。 ^ ' 報表生成模組214用於當所述産能規劃模組212將所 述貨物訂單在每個工站加工的貨物數量分配給該工址 %有剩 餘産能的機台後,生成一個工站機台作業分配表。所逃工 站機台作業分配表中包含有所述貨物訂單分配的工站及 i气 台。 如下所述,是透過前述工站產能規劃系統,實施工站 産能規劃的步驟。首先,用戶將需要加工的貨物訂單〇〇2 ⑩的資料導入所述資料庠5中,並在所述資料庫5中設置工 站的産能資料。假設所述貨物訂單002需要加工的工站爲 工站A、工站B及工站^,加工的順序爲工站A〜工站B 〜工站C。啓動所述工站産能規劃系統後,資料獲取模紐 210訪問所述資料庫5,從所达貝料庫5中獲取所述貨物訂 單002的資料及所述工站A、工站B及工站C的産能資料, 同時獲取所述工站A、少站B及工站c正在加工的貨物數 量。工站分配模組211根據所述貨物訂單0〇2需要加工的 工站及工站的加工順序先分配所述貨物訂單〇〇2到工站a 12 200847042 • 進行加工。然後’産能規劃模組212根據所述工站的産能 •貧料得到所述機台産能的計算公式,計算出所述工站中每 個機台的固定産能。假設工站A包括機台A1和機台A2, 其中機台A1的固定產能爲a,機台A2的固定産能爲b, 所述貨物訂單002需要在工站A加工的貨物數量爲al。另 外,所述機台A1正在加工貨物訂單〇〇1,加工所述貨物訂 單001的貨物數量爲a2,所述機台A2沒有正在加工的貨 φ物叮單。産能規劃模組212計算所述工站A中機台A1的 剩餘産能,假設將所述貨物訂單〇〇2在工站A加工的貨物 數量分配給工站A中的一個機台加工,如果a — (ai+a2)>=The planting station capacity planning system includes a host and a database, wherein the database stores the order information of the goods and the capacity data of the station, and the order data includes the number of the stations processed by the order, and the quantity of the goods of each station. And the processing sequence of the station, the capacity information of the station includes the number of machines included in the station and the fixed capacity of each machine, and the host includes: a data acquisition module, configured to access the database , to obtain the goods in the database. The Ding Shan data and the capacity data of the station, and the quantity of the goods being processed by the station; the station allocation module, which is used for processing the stations and stations according to the order of the goods to be processed The goods order is allocated to different stations; the capacity planning module is used to find the machine with the remaining capacity in each station according to the goods order data obtained by the data acquisition module and the capacity data of the station, and The quantity of goods processed by the goods order at each station is assigned to the machine with the remaining capacity at the station. - The planting station capacity planning method' includes the following steps: obtaining the goods order data in the database and the capacity data of the station, and simultaneously obtaining the station: the quantity of the processed goods; the station to be processed according to the goods order The OL sequence of the station assigns the goods order to the goods order data and the capacity data of the station at the "P:" capacity machine, and the goods order is added at the station: The quantity of goods is allocated to the 4 orders of the goods that are slack and processed, to the station and the machine ^°; repeat (4) to distribute the goods station until each station in the goods order allocates more than 4 hours of machine The above-mentioned station capacity planning system and method can be used to find the machine with surplus capacity, and allocate the quantity of goods processed by each station in 200844 4242 to the machine with surplus capacity in the station. It avoids the cumbersome steps of manually performing capacity scheduling of the station and improves the efficiency and accuracy of the station capacity planning. [Embodiment] Referring to Figure 1, there is shown a system architecture diagram of a preferred embodiment of a power plant planning system of the present invention. The system mainly includes a display 1, a host 2, a keyboard 3 and a mouse 4. The host 2 is connected with a database 5, and the database 5 stores the order data of the goods and the capacity of the station. Including: the processing station for order processing, the quantity of goods processed by each station, processing time and sequence. The capacity information of the station includes: the average capacity of the station, the maximum capacity of the station, the number of machines included in the station, the fixed capacity of each machine, and the working time of the machine. The capacity data of the station can be set by the user himself. For example, the user can set the working time of each machine and the working time of each day. The host 2 is configured to perform capacity planning on the goods order according to the capacity data φ of the station in the database 5, that is, the goods order is allocated to different stations and their machines, and a station machine is generated. Table assignment table. The work station machine operation allocation table includes the work station and the machine station for the goods order allocation. In general, the processing of a batch of goods requires some specific station, and before the formal processing of the goods, it is necessary to determine whether the capacity of the station meets the demand for the goods. The host 2 is connected with a display 1, a keyboard 3 and a mouse 4 for use as an input and output device for the production capacity planning of the station. Referring to FIG. 2, it is a functional module diagram of the host 2 shown in FIG. 9 200847042 The host 2 includes a data acquisition module, a planning module 212, an abnormal information output mode = a touch, and a capacity 214. The module referred to in the present invention is a complete-and-e-table generation module. The program is more suitable for the tracing body in the (4) towel H彳=== segment. The invention is described in the following description of the software. Therefore, in the present, the data acquisition module 210 obtains the quantity of the goods being processed by the station by asking: the goods order in the database 5 and the capacity data of the station. . The same station distribution module 211 is configured to allocate the goods order to a work order of a different goods station and a processing order of each work station according to the processing order of the processing station and the work station. The order is fixed and the station assignment module 211 sequentially assigns the goods order to each station. The capacity planning module 212 is configured to search for the machine with the remaining capacity in each station according to the data acquisition data, such as the material information and the capacity data of the station, and place the goods in the order. The quantity of goods processed at each station is assigned to the machine with the remaining capacity at the station. Specifically, the capacity planning module 212 obtains a calculation formula of the machine capacity according to the capacity data of the station, and calculates a fixed capacity of each machine in the station. Then, the capacity planning module 212 calculates the remaining capacity of each machine based on the quantity of goods that the goods order needs to be processed at the station and the quantity of goods being processed by the machine. The remaining capacity refers to the fixed capacity of the machine minus the quantity of goods that the goods order needs to be processed at the station and the quantity of goods being processed by the machine. If the fixed capacity of the machine minus the quantity of goods to be processed by the station at 10 200847042 and the quantity of goods being processed by the machine is greater than or equal to zero, the capacity planning module 212 determines that the machine is still There is surplus capacity, and the quantity of goods processed by the goods order at the station is allocated to the machine. For example, the station that needs to be processed for a goods order 002 is station A, station B and station C. The order of processing is station A - station station C, and the fixed capacity of a station A1 in station A is a, the goods order 002 requires the quantity of goods processed at station A to be al. In addition, the machine A1 is processing the goods order 001, and the quantity of the goods processed by the goods order 001 is a2. It is assumed that the quantity of goods processed by the goods order 002 at the station A is distributed to one of the stations A. If a - ( al + a2 ) > = 〇, the capacity planning module 212 determines the machine Taiwan A1 has remaining capacity. Then, the capacity planning module 212 searches for the remaining capacity machine in the station B and the station C according to the same method, and allocates the quantity of the goods processed by the goods order at the station B and the station C to the work. There are machines with remaining capacity in Station B and Station C. φ The user can also set the number of goods processed by the goods order at one station to be distributed to the plurality of machines of the station, if the quantity of goods processed by the goods order at the station is allocated to the station The machine planning, the capacity planning module 212 determines whether the sum of the fixed capacities of the plurality of machines is greater than or equal to the quantity of goods that the goods order needs to be processed at the station and the plurality of machines are being processed. The sum of the quantity of goods, the machine that judges whether there is any remaining capacity in the station. If the sum of the fixed capacity of the plurality of machines minus the quantity of goods that the goods order needs to be processed at the station and the quantity of goods being processed by the plurality of machines is greater than or equal to zero, then the production 11 200847042 The module 212 determines the machine having the remaining capacity in the station, and allocates the quantity of the goods processed by the goods order at the station to the plurality of machine abnormal information output modules 213 for use in the capacity planning module. = When there is a machine that finds surplus capacity in the station, it is also sent to the relevant department head in the form of an email. The abnormal information includes the information of the goods order and the quantity of the capacity lacked by the station. ^ ' The report generation module 214 is configured to generate a station machine after the capacity planning module 212 allocates the quantity of goods processed by the goods order at each station to the machine with the remaining capacity of the work site. Table assignment table. The work assignment table of the escaping station station includes the station and the i-stage of the goods order allocation. As described below, the steps of capacity planning for the station are implemented through the aforementioned station capacity planning system. First, the user introduces the data of the goods order 〇〇2 10 to be processed into the data 庠5, and sets the capacity data of the station in the database 5. It is assumed that the stations that need to be processed for the goods order 002 are station A, station B and station ^, and the processing order is station A~ station B~ station C. After the station capacity planning system is started, the data acquisition module 210 accesses the database 5, and obtains the information of the goods order 002 and the station A, the station B and the work from the warehouse. The capacity data of station C, and the quantity of goods being processed by the station A, the station B and the station c are obtained at the same time. The station allocation module 211 first allocates the goods order 〇〇 2 to the station a 12 according to the processing order of the station and the station to be processed of the goods order 0 〇 2 2008. The processing is performed. Then, the capacity planning module 212 obtains the calculation formula of the machine capacity according to the production capacity of the station, and calculates the fixed capacity of each machine in the station. It is assumed that the station A includes the machine A1 and the machine A2, wherein the fixed capacity of the machine A1 is a, the fixed capacity of the machine A2 is b, and the quantity of goods processed by the goods order 002 at the station A is a. Further, the machine A1 is processing the goods order 〇〇1, and the quantity of the goods for processing the goods order 001 is a2, and the machine A2 has no goods 正在 material order being processed. The capacity planning module 212 calculates the remaining capacity of the machine A1 in the station A, and assumes that the quantity of the goods processed by the goods order 〇〇2 at the station A is distributed to one of the stations A, if a — (ai+a2)>=

切叮早002需要在工站 A中有剩餘產能的機台 和A2所缺的産能作爲異常資訊以電子郵 相關部門的主管。 當産能規劃模組212將所述貨物寸單 A加工的貨物數量分配給所述工站a 002需要加工的 002到下一個丁 後,工站分配模組211根據所述貨物^丁單 工站及工站的加工順序分配所述貨物訂單 13 200847042 ” =B進行加工。然後,產能規劃模組212繼續在工站B中 ,尋$有剩餘産能的機台。同樣,當産能規劃模組212將所 貝物σ丁單〇〇2需要在工站b加工的貨物數量分配給所述 工:Β中有剩餘產能的機台後,工站分配模組211根據所 述1物叮單〇〇2需要加工的工站及工站的加工順序分配所 2 =物訂單002到下一個工站c進行加工。然後,産能規 J杈=212繼續在工站c中尋找有剩餘産能的機台。 φ 田所述産能規劃模組212將所述貨物訂單〇〇2在工站 工站Β及工站c加工的貨物數量分配給工站a、工站 B 丁 站C中有剩餘産能的機台後,報表生成模組214生 成個工站機台作業分配表。所述工站機台作業分配表中 匕含有所述貨物訂單分配的工站及機台。 以上所述是以一個貨物訂單002的工站産能規劃爲例 說明’如果有多個貨物訂單,則所述工站産能規劃系 統將依次對每個貨物訂單進行工站産能的規劃。 • 參閱圖3所示,係本發明工站産能規劃方法較佳實施 例的流程圖。首先,步驟S401,資料獲取模組210訪問所 述資料庫5,獲取所述資料庫5中的貨物訂單資料及工站 的產能資料,同時獲取所述工站正在加工的貨物數量。所 遂叮單資料包括:訂單加工的工站、每個工站加工的貨物 數量、加工時間及順序等。所述工站的産能資料包括:工 站的平均産能、工站的最大産能、工站包含的機台數量、 母個機台的固定産能及機台的工作時間等。所述工站的産 月匕資料可以由用戶自己設置,例如用戶可以設定每個機台 14 200847042 ,一周的工作時間及每天的工作時間等。 - 步驟S402,工站分配模組211根據所述貨物訂單需要 加工的工站及工站的加工順序將所述貨物訂單分配到二個 工站。一個貨物訂單需要加工的工站及每個工站加工的= 後順序是固定的,工站分配模組2n依次將所述貨物。。 分配給每個工站。 早 ^步驟S403,産能規劃模組212根據資料獲取模組2 籲獲取的貨物訂單資料及工站的産能資料在所述工站中 有剩餘産能的機台。具體而言,産能規劃模組加根^所 述工站的産能資料得到所述機台産能的計算公式,計算出 所述工站中每個機台的固定産能。然後,産能規聽组加 根據所述貨物訂單在該工站需要加工的貨物數量及該機台 正在加工的’貝物數篁計算出每個機台的剩餘產能,所述剩 餘産能是指機台的固定產能減去所述貨物訂單在該工站需 要加工的貨物數量及該機台正在加工的貨物數量。 _ 纟驟S404’産錢劃模組212判斷所述工站是否存在 剩^產能的機台。如果所述機台的固定産能減去所述貨物 。丁早在該工站需要加卫的貨物數量及該機台正在加工的貨 物數量大於或等於零,則產能規劃模組212判斷所述機台 避有剩餘産能。例如,某貨物訂單〇〇2需要加工的工站爲 工站A、工站B及工站C’加工的順序爲工站A一工站B :站C工站A中某機台…的固定産能所述貨物 :早〇〇2需要在工站“工的貨物數量爲&1。另外,戶斤述 機台A1正在加工貨物訂單〇〇ι,加工所述貨物訂草〇〇1 15 200847042 的貨物數量爲a2。假設將所述貨物訂單002在工站A加工 的貨物數量分配給工站A中的一個機台加工,如果a -' (al+a2) >= 0,則産能規劃模組212判斷所述機台A1還有 剩餘産能。 如果所述工站不存在剩餘産能的機台,步驟S405,異 常資訊輸出模組213輸出異常資訊並將該異常資訊以電子 郵件的形式發送給相關部門的主管,流程直接轉到步驟 S407。所述異常資訊包括有所述貨物訂單的資料及所述機 @台所缺産能的數量等。 如果所述工站存在剩餘産能的機台,步驟S406,産能 規劃模組212將所述貨物訂單在所述工站加工的貨物數量 分配給該工站有剩餘産能的機台。 步驟S407,産能規劃模組212判斷所述貨物訂單中所 有工站是否分配完畢。如果所述貨物訂單中還有工站沒有 分配完畢,則流程回到步驟S402。 φ 如果産能規劃模組212將所述貨物訂單在每個工站加 工的貨物數量分配給該工站有剩餘産能的機台後,步驟 S408,報表生成模組214生成一個工站機台作業分配表。 所述工站機台作業分配表中包含有所述貨物訂單分配的工 站及機台。 以上所述是以一個貨物訂單的工站産能規劃爲例進 行說明,如果有多個貨物訂單,則所述工站産能規劃方法 將依次對每個貨物訂單進行工站産能的規劃。 本發明工站産能規劃系統及方法,雖以較佳實施例揭 16 200847042 露如上,然其並非用以限定本發明。任何熟悉此項技藝之 * 人士,在不脫離本發明之精神及範圍内,當可做更動與潤 飾,因此本發明之保護範圍當視後附之申請專利範圍所界 定者為準。 【圖式簡單說明】 圖1係本發明工站産能規劃系統較佳實施例的硬體架 構圖。 圖2係圖1所示主機的功能模組圖。 ® 圖3係本發明工站產能規劃方法較佳實施例的流程 圖。 【主要元件符號說明】 顯示器 1 主機 2 鍵盤 3 滑鼠 4 資料庫 5 資料獲取模組 210 工站分配模組 211 産能規劃模組 212 異常資訊輸出模組 213 報表生成模組 214 17In the early days of 002, it is necessary to have the capacity of the machine in the station A and the capacity of the A2 as the abnormal information to be the head of the relevant department of the e-mail. When the capacity planning module 212 allocates the quantity of the goods processed by the goods order A to the work station a 002 that needs to be processed 002 to the next one, the station distribution module 211 is based on the goods And the processing order of the station assigns the goods order 13 200847042 ” = B for processing. Then, the capacity planning module 212 continues to find the machine with remaining capacity in the station B. Similarly, when the capacity planning module 212 The amount of goods to be processed at the station b is allocated to the work: after the machine having the remaining capacity in the Β, the station distribution module 211 is based on the one. 2 The processing order of the station and station to be processed is 2 = object order 002 to the next station c for processing. Then, the capacity gauge J杈=212 continues to find the machine with the remaining capacity in station c. The capacity planning module 212 of the φ field allocates the quantity of the goods processed by the goods order 〇〇2 at the station station and the station c to the station a, the station B, and the machine with the remaining capacity. After that, the report generation module 214 generates a work station machine work allocation table. The job assignment table contains the station and machine that the goods order is assigned. The above is an example of the station capacity planning of a goods order 002. 'If there are multiple goods orders, the station capacity planning The system will plan the station capacity for each goods order in turn. • Refer to Figure 3, which is a flow chart of a preferred embodiment of the capacity planning method of the station of the present invention. First, in step S401, the data acquisition module 210 accesses the station. The database 5 obtains the goods order data in the database 5 and the capacity data of the station, and simultaneously obtains the quantity of the goods being processed by the station. The document includes: the processing station of the order processing, each The quantity of goods processed by the station, processing time and sequence, etc. The capacity of the station includes: the average capacity of the station, the maximum capacity of the station, the number of machines included in the station, the fixed capacity of the mother machine and The working hours of the machine, etc. The monthly production data of the station can be set by the user himself. For example, the user can set each machine 14 200847042, one week working time and daily. For the time, etc. - Step S402, the station assignment module 211 assigns the goods order to two stations according to the processing order of the station and the station that the goods order needs to be processed. And the processing order of each station is fixed, and the station allocation module 2n sequentially allocates the goods to each station. [Step S403], the capacity planning module 212 is based on the data acquisition module 2 Calling for the goods order data and the capacity data of the station to have the remaining capacity in the station. Specifically, the capacity planning module adds the capacity information of the station to obtain the capacity of the machine. Calculating a formula to calculate the fixed capacity of each machine in the station. Then, the capacity listening group adds the quantity of goods that need to be processed at the station according to the goods order and the number of items that the machine is processing.篁 Calculate the remaining capacity of each machine, which refers to the fixed capacity of the machine minus the quantity of goods that the goods order needs to process at the station and the quantity of goods being processed by the machine. _ Step S404' The money generating module 212 determines whether the station has a machine with a remaining capacity. If the fixed capacity of the machine is subtracted from the goods. The capacity planning module 212 determines that the machine avoids the remaining capacity when the number of goods that need to be reinforced at the station and the quantity of goods being processed by the machine are greater than or equal to zero. For example, the order of a certain goods order 〇〇2 to be processed for station A, station B and station C' is the order of station A station B: station C station A Capacity of the goods: As early as 2, the number of goods required to be worked at the station is &1. In addition, the household is said that the machine A1 is processing the goods order 〇〇ι, processing the goods, ordering grass 1 15 200847042 The quantity of goods is a2. It is assumed that the quantity of goods processed by the goods order 002 at station A is assigned to one machine in station A, and if a - ' (al+a2) >= 0, capacity planning The module 212 determines that the machine A1 has remaining capacity. If the station does not have a machine with remaining capacity, in step S405, the abnormal information output module 213 outputs abnormal information and sends the abnormal information as an email. To the supervisor of the relevant department, the process goes directly to step S407. The abnormal information includes the information of the goods order and the quantity of the capacity of the machine, and the like. If the station has a machine with remaining capacity, the steps S406, the capacity planning module 212 places the goods order in the The quantity of goods processed by the station is allocated to the machine with the remaining capacity of the station. In step S407, the capacity planning module 212 determines whether all the stations in the goods order are allocated. If there are still stations in the goods order, there is no station. After the distribution is completed, the flow returns to step S402. φ If the capacity planning module 212 allocates the quantity of the goods processed by the goods order at each station to the machine with the remaining capacity of the station, step S408, the report generation mode The group 214 generates a station machine operation allocation table. The station machine operation allocation table includes the station and the machine station for which the goods order is allocated. The above is a station capacity planning of a goods order. For example, if there are multiple goods orders, the station capacity planning method will sequentially plan the station capacity for each goods order. The station capacity planning system and method of the present invention are disclosed by the preferred embodiment. 16 200847042 The above is not intended to limit the invention, and any person skilled in the art can make changes without departing from the spirit and scope of the invention. The scope of the present invention is defined by the scope of the appended claims. BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a hardware architecture diagram of a preferred embodiment of the station capacity planning system of the present invention. Figure 1 is a flow chart of the host module of the present invention. Figure 3 is a flow chart of a preferred embodiment of the capacity planning method of the station of the present invention. [Main component symbol description] Display 1 Host 2 Keyboard 3 Mouse 4 Database 5 Data Acquisition module 210 station allocation module 211 capacity planning module 212 abnormal information output module 213 report generation module 214 17

Claims (1)

200847042 、申請專利範圍: 1 · 一種工站產能規劃系統,包括主機及資料 庫,所述資料庫中存 站的産能資料,所述 的工站、每個工站加 站的加工順序,所述 台數量及每個機台的 主機包括: 資料獲取模組,用於 所述資料庫中的貨物 產能資料,同時獲取 物數量; 工站分配模組,用於 加工的工站及工站的 早分配到不同工站; 産能規劃模組,用於 獲取的貨物訂單資料 個工站中尋找有剩餘 貝物&丁早在每個工站 該工站有剩餘產能的 2 ·如申請專利範圍第i 系統,其中,所述主 異常資訊輸出模組, 組沒有在所述工站中 儲有貨物訂單資料及工 訂單資料包括訂單加工 工的貨物數量及所述工 工站的産能資料包括機 固定産能,其中,所述 訪問所述資料庫,獲取 訂單資料及所述工站的 所述工站正在加工的貨 根據所述貨物訂單需要 加工順序將所述貨物訂 及 根據所述資料獲取模組 及工站的産能資料在每 產能的機台,並將所述 力Π工的貨物數量分配給 機台。 項所述的工站産能規劃 機還包括: 用於當所述産能規劃模 尋找到剩餘産能的機台 18200847042, the scope of application for patents: 1 · A station capacity planning system, including a host and a database, the capacity data of the station in the database, the processing sequence of the station, each station plus station, The number of stations and the host of each machine include: a data acquisition module, which is used for the capacity of the goods in the database, and the quantity of the materials acquired; the station distribution module, the early use of the station and the station for processing Assigned to different stations; Capacity planning module, used to obtain the goods order data in the station to find the remaining shells & Ding early in each station, the station has the remaining capacity 2 · If the patent scope The i system, wherein the main abnormal information output module, the group does not store the goods order data and the work order data in the station, including the quantity of the order processing worker and the capacity information of the working station including the machine fixing Capacity, wherein the accessing the database, obtaining order data, and the goods being processed by the station of the station are processed according to a processing order of the goods order And was custom data acquisition module and production work station in accordance with the data capacity of each machine, and the machine is assigned to the number of cargo work force Π. The station capacity planning machine described in the item further includes: a machine for finding the remaining capacity when the capacity planning module is used.
TW96118714A 2007-05-25 2007-05-25 System and method for planning outputs of stations TW200847042A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW96118714A TW200847042A (en) 2007-05-25 2007-05-25 System and method for planning outputs of stations

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW96118714A TW200847042A (en) 2007-05-25 2007-05-25 System and method for planning outputs of stations

Publications (1)

Publication Number Publication Date
TW200847042A true TW200847042A (en) 2008-12-01

Family

ID=44823417

Family Applications (1)

Application Number Title Priority Date Filing Date
TW96118714A TW200847042A (en) 2007-05-25 2007-05-25 System and method for planning outputs of stations

Country Status (1)

Country Link
TW (1) TW200847042A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI609341B (en) * 2013-06-03 2017-12-21 鴻海精密工業股份有限公司 Production schedule system and method

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI609341B (en) * 2013-06-03 2017-12-21 鴻海精密工業股份有限公司 Production schedule system and method

Similar Documents

Publication Publication Date Title
Mak et al. Sequencing appointments for service systems using inventory approximations
Lu et al. Optimal due-date assignment problem with learning effect and resource-dependent processing times
WO2003094107A2 (en) Constraint-based production planning and scheduling
CN101295377A (en) Work station capacity planning system and method
TW202133097A (en) Method for semiconductor processing scheduling, system for semiconductor processing scheduling and non-temporary computer-readable storage medium
JP2020119491A (en) Delivery date prediction device, delivery date prediction method and program
CN110648033A (en) Method and device for acquiring engineering list, computer equipment and storage medium
Lin et al. A case study of batch scheduling for an assembly shop
JP5826509B2 (en) Scheduling apparatus and scheduling method
TW200847042A (en) System and method for planning outputs of stations
Talapatra et al. Overall efficiency improvement of a production line by using Yamazumi chart: a case study
JPH10254962A (en) Group-based work capability correction device and work allocation system
Wang et al. An assemble-to-order production planning with the integration of order scheduling and mixed-model sequencing
CN115438952A (en) Production scheduling method and related equipment thereof
CN107544451A (en) A kind of job shop Digit Control Machine Tool centralized dispatching system and method
JP2005267488A (en) Process management system
CN107544452B (en) Promptly add processing workshop numerically-controlled machine tool centralized dispatching method under one-state
CN112801515A (en) Project resource allocation method, electronic equipment and computer readable storage medium
Becker et al. Dynamic safety-stock calculation
CN108681838B (en) Scheduling plan determining method and device
US20200134526A1 (en) Resource planning apparatus and resource plan visualization method
CN114648185A (en) Plan scheduling method, plan scheduling device, computer device, and storage medium
CN101794417A (en) Work flow dispatching and business flow modeling method based on sequence number
Xia et al. Energy-efficient production scheduling considering outsourced manufacturing and tardiness cost
Hahn et al. Enhancing aggregate production planning with an integrated stochastic queuing model