TW200903355A - System and method for arranging a purchase order - Google Patents

System and method for arranging a purchase order Download PDF

Info

Publication number
TW200903355A
TW200903355A TW96124673A TW96124673A TW200903355A TW 200903355 A TW200903355 A TW 200903355A TW 96124673 A TW96124673 A TW 96124673A TW 96124673 A TW96124673 A TW 96124673A TW 200903355 A TW200903355 A TW 200903355A
Authority
TW
Taiwan
Prior art keywords
station
goods
order
production
post
Prior art date
Application number
TW96124673A
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 TW96124673A priority Critical patent/TW200903355A/en
Publication of TW200903355A publication Critical patent/TW200903355A/en

Links

Landscapes

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

Abstract

A system for arranging a purchase order is disclosed. The system includes a computer and a database. The database stores purchase order information, throughput information of each workstation in a factory. The computer is configured for obtaining the purchase order information stored in the database, determining whether a product of the purchase order information has production information, arranging operation of each workstation according corresponding throughput if the product has production information, saving the arrange of the product of the purchase order in the database. A related method is also disclosed.

Description

200903355 九、發明說明: 【發明所屬之技術領域】 本發明涉及一種訂單計劃排程系統及方法。 【先前技術】 -叙而s -批訂單貨物的加工製造需要 力:工工站,在每一個工站出現時間延誤等問題時,都。 的:Γ貨’因此需要對訂單貨物在各工站二 工衣k進㈣程。所·程是根據訂單㈣求 =編,機台設備的使用狀況,生產能力等 σ考慮*而制δ 丁出的一個合理的生産計劃,最炊 戶的按時出貨需求。現在生産部門的作爲人 行生産㈣的㈣,㈣有訂單貨㈣生1 2 部門中有經驗的人員排配。由於訂單多,生 排程人員不能完全掌控訂單需求的原材料的到料 機台的使用狀況,生産能力等 到处六七丁 Α 所以其排配的生産計 ^私了此存在不5 _地方,導致訂單不能按時出貨, 此外,人工排配的效率也很低。 用電腦系統自動對訂單作業進行排程,訂單需求㈣ 站的產能資訊’提高排配工作的效率和準確性, 減父3丁單不能按時出貨的風險。 【發明内容】 鑒於以上内谷,有必要提出一種訂單 能夠根據逆向排程自動_ w ]排私系.·充 滿足工站生産產能規^…丁早所需要的工站產能,快速 200903355 種訂單計劃排程方法, 需要的工站產能,快速 鑒於以上内容,有必要提出— 能夠根據逆向排程自動計算訂單所 滿足工站生産產能規劃。 種訂皁計劃排程系 c括電腦主機及與該電縣 =目連的諸庫,該資料庫t存儲有訂單 =況’所述電腦主機包括―用於從該資= 獲取進㈣㈣訂單t物的f號、數Μ 用於判斷該訂單貨物的貨號是否有途程資料,及ir、,且’ 於該訂單中所需的數量;叶曾模勿的庫存數量是否小 數量小於該訂單中所需的數量時 的庫存 去該貨物的庫存數量得到生产數旦^#所需的數量減 ㈣州… 所述判斷模組還用於 =據二貝物的返程資料判斷該貨物是否需要經過後製程工 11^組,用於當該貨物需要經過後製程工 仃後製程工站排裎,;^田认A斗化丨, 了 運 站排程或所料制 不需要進行後製程工 程™Γ衣程工站排程完成時,進行前製程工站排 二,…m杈組還用於判斷所述前製程 全部排配完成’及當該訂單貨物的所有前製程::= 排配完成時’判斷該 機口 模組,用於當兮〜達成;及儲存 排程儲存至;:::貨物的交期達成時’將該訂單貨物的 /¾ 士種7單计劃排程方法,該方法包括如下步驟.…π 枓庫中獲取進行排 據該訂單貨物的化丁早如'物的U、數量及交期;根 貝唬判斷該訂單貨物是否有途程資料;當 200903355 該訂單貨物有途程資料時,判 該貨物訂單令所需的數量一==== 物訂單令所需的數量時,將該的 2该貝 物的庫存數量得到生產數量;根料二:的數夏減去該貨 該貨物是否需要經過後製程二:::貝枓判斷 葙工吐B 士 ^ 6,田。亥貝物需要經過後製 Γ 後製程工站排程;當後製程工站排配完成 後進仃則製程工_程;根據前製程 ς :配是否完成判斷該訂單貨物的所有前製二 :全部排配完成,·當該訂單貨物的所有前製程工站的^ :根據前製程工站的第-工站排配的生產曰i 期:早:物的父期是否能達成;及當該訂單貨物的交 /達成%,將该5丁早貨物的排程儲存至資料庫中。 ^較于習=術,、树明所提供的訂單計劃排程系統 /可將。丁單需求貧訊轉換爲工站的産能資訊,實現 工站産能規劃,提高工作的效率和準確性。 、 【實施方式】 /如圖1所示,係本發明訂單計劃排程系統較佳實施例的 ^统架構圖。該系統主要包括電腦主機h資料庫2、顯示 為3、鍵盤4及滑鼠5。所述資料庫2與電腦主機丄相連,用於 存儲客戶的訂單及各卫站的生産排配情況等。所述資料庫2 中可以存儲每種貨物的途程資料,所述途程資料包括貨物 的貨號、完成該貨物需經過的工站名稱、工站途序。所述 ,機1用於根據所述資料庫2中存儲的各工站的排配資料等 資Λ對所述αΤ單進行生産計劃的排程。所述主機玉連接有 200903355 . 顯示器3、鍵盤4及滑鼠5,用於訂單計劃排程時相關參數的 輸入及輸出設備。 如圖2所不^係圖1中電腦主機1的功能模組圖。所述電 腦主機1包括獲取模組10、判斷模組12、計算模組14、排程 模組16、儲存模組18及輸出模組20。 所述獲取模組10用於從資料庫2中獲取進行排程的訂 單的資訊。該訂單的資訊包括貨物的貨號、數量及交期。 所述判斷模組12用於根據該訂單貨物的貨號查詢資料 庫2判斷該訂單貨物是否有途程資料。 所述判斷模組12還用於當該訂單貨物有途程資料時, 判斷該貨物的庫存數量是否小於訂單所需的數量。 所述計算模組14用於當該貨物的庫存數量小於訂單所 需的數量時,將訂單所需的數量減去上述庫存數量得到生 産數量。 所述判斷模組12還用於根據所述途程資料中的工站名 稱判斷該訂單貨物是否需要經過後製程工站。其中,在“空 \ 板”工站以前的工站統稱爲前製程工站;在“空板”工站 以後的工站統稱爲後製程工站,後製程工站包括組裝工站 及表面貼裝工站。 所述排程模組16用於當訂單貨物需要進行後製程工站 時,進行後製程工站排程。首先,當貨物需要經過組裝工 站時,排程模組16逆向遍歷組裝工站所有生產線別,將訂 單所需的生産數量、時間排配到生產線別。例如:若訂單 所需的生産數量爲100K,交期爲6月20曰。若組裝工站有 9 200903355 該貨物庫存數量20K,則排配組裝工站實際生產數量爲 80K。若該組裝工站有生產線別1和生產線別2,生產線別1 優先於生產線別2,生產線別1處於空閒狀態且産能爲 60K,生產線別2處於空閒狀態且産能爲60K,則排配生產 線別1在6月20日生産60K,生產線別2在6月20日生産20K。 進一步的,所述排程模組16判斷6月20日當天是否假期,若 6月20曰爲周曰,則需向前推算至6月19曰(該曰爲生産 曰)。接著,當貨物需要經過表面貼裝工站時,排程模組16 逆向遍歷表面貼裝工站的所有生產線別,將訂單所需的生 産數量、時間排配到生產線別。表面貼裝工站的排配方法 同組裝工站的排配方法。 所述排程模組16用於後製程排配完成時,進行前製程 工站排程。首先,排程模組16逆向遍歷途程資料中該訂單 貨物需經過的前製程工站名稱,根據訂單生産數量、訂單 交期排配各工站的生産數量及生産時間。例如:若該貨物 的生産數量爲100K,交期爲6月20日,需要經過的工站有 裁切、NC、黑孔、鍍銅、前處理線路、幹膜、曝光。首先, 排配最後一個工站曝光生産開始時間爲6月20曰,生産數量 爲100K,若該工站有該貨物庫存數量20K,則排配該工站 實際生産數量爲80K。進一步的,所述排程模組16判斷6月 20曰當天是否假期,若6月20日爲周日,則需向前推算至6 月19曰(該曰爲生産曰)。“曝光”工站的作業時間、數量 確定之後,繼續按照上述方法逆向排配其前一工站的作業 時間。接著,排程模組16逆向遍歷一前製程工站的機台佇 10 200903355 列,根據該工站各機台的産能排配各機台的生產時間、生 産數量。一個工站可包括若干個機台,在排配時根據機台 的優先順序進行排配。例如:若最後一工站“曝光”工站6 月19日排配的生産數量爲1000k,該工站有機台1和機台2, 機台1排配順序優先於機台2,機台1處於空閒狀態且産能爲 400k,機台1不能完全滿足排配的生産數量,查看機台2, 機台2處於空閒狀態且産能爲800K,機台1加機台2的産能 大於該工站排配的生産數量,則排配6月19日機台1生産 400k,機台2生産600k;若6月19日機台1處於工作狀態且已 滿負荷,機台2處於空間狀態,産能爲800K,機台2的産能 小於該工站排配的生産數量,則推後一天查看6月20日這天 機台1的狀況,若6月20日機台1處於空閒狀態,産能爲 400k,則排配6月19曰機台2生産800k,6月20曰機台1生産 200k。“曝光”工站機台生産時間確定後,依次類推,確 定各工站機台的生産時間。 所述判斷模組12還用於判斷該貨物所有前製程工站的 % 機台是否全部排配完成。當前製程工站中的第一個工站排 配完成時,判斷模組12判斷所有前製程工站的機台排配完 成;當前製程工站中的第一個工站排配沒有完成時,判斷 模組12判斷前製程工站的機台排配沒有完成。 所述判斷模組12還用於當該貨物所有前製程工站排配 完成時,根據第一工站機台排配的生産時間與當前時間判 斷該訂單的交期是否達成。當前製程工站的第一工站排配 的生産日期在排配當天的日期之前時,判斷訂單貨物的交 11 200903355 期不能達成;當前製程工站的第一工站棑配的生産日期和 排配當天的日期相同或在排配當天的期曰之後時,判斷訂 單貨物的交期能達成。例如:若當前時間爲6月10日,第一 工站機台的生産時間爲6月12日,則判斷訂單的交期可以達 成;若當前時間爲6月10日,第一工站機台的生産時間爲6 月8日,則判斷訂單交期不能達成。 所述儲存模組18用於當該訂單的交期達成時,將該訂 單的作業排程儲存至資料庫2中。 所述輸出模組20用於當該訂單貨物沒有途程資料時或 該貨物的庫存大於訂單的數量時或該訂單的交期不能達成 時,輸出異常資訊以提示工作人員。 如圖3所示,係本發明訂單計劃排程方法較佳實施例的 流程圖。首先,步驟S10,獲取模組10從資料庫2中獲取進 行作業排程訂單的資訊。該訂單的資訊包括貨物的貨號、 數量及交期。 步驟S12,判斷模組12根據該訂單貨物的貨號查詢資 料庫2判斷該訂單貨物是否有途程資料。 步驟S14,當該訂單貨物有途程資料時,判斷模組12 判斷該貨物的庫存數量是否小於該貨物訂單的數量。 步驟S16,當該貨物的庫存數量小於該貨物訂單的數 量時,計算模組14將該貨物訂單的數量減去上述庫存數量 得到生産數量。 步驟S18,判斷模組12根據所述途程資料中的工站名 稱判斷該貨物是否需要經過後製程工站。其中,在“空板” 12 200903355 工站以前的工站統稱爲前製程工站;在“空板”工站以後 的工站統稱爲後製程工站,後製程工站包括組裝工站及表 面貼裝工站。 步驟S20,當該貨物需要進行後製程工站排程時,排 程模組16進行後製程工站排程。如圖4所示,後製程計劃排 程的具體步驟爲:步驟S202,判斷模組12根據該貨物途程 資料中的工站名稱判斷該貨物是否需要經過組裝工站;若 該貨物需要經過組裝工站,則步驟S204判斷模組12判斷該 貨物在組裝工站的庫存是否小於該貨物的訂單數量;若該 貨物在組裝工站的庫存小於該貨物的訂單數量,則步驟 S206排程模組16遍歷組裝工站所有生產線別,將該貨物訂 單的生産數量、時間排配到生產線別;步驟S208,判斷模 組12根據該貨物途程資料中的工站名稱判斷該貨物是否需 要經過表面貼裝工站;若該貨物需要經過表面貼裝工站, 則步驟S210判斷模組12判斷該貨物在表面貼裝工站的庫 , 存是否小於該貨物的訂單數量;若該貨物在表面貼裝工站 k ' 的庫存小於該貨物的訂單數量,則步驟S212排程模組16遍 歷表面貼裝工站所有生產線別,將該貨物訂單的生産數 量、時間排配到生產線別。 步驟S22,當後製程工站排配完成時,排程模組16進 行前製程工站排程。如圖5所示,前製程計劃排程的具體步 驟爲:步驟S220,逆向遍歷該貨物途程資料中需要經過的 前製程工站名稱,根據該貨物訂單的生産數量、交期排配 各前製程工站的生産數量及生産時間。步驟S222,判斷所 13 200903355 述前製程工站的庫存數量是否小於生産數量。步驟S224, 當所述前製程工站的庫存數量小於生産數量時,逆向遍歷 所述前製程工站的機台佇列,根據所述前製程工站機台的 産能排配相應機台的生産時間、生産數量。 步驟S24,判斷模組12根據前製程工站的第一工站的 排配是否完成判斷該訂單貨物所有前製程工站的機台是否 全部排配完成。當前製程工站中的第一個工站排配完成 時,判斷模組12判斷所有前製程工站的機台排配完成;當 前製程工站中的第一個工站排配沒有完成時,判斷模組12 判斷前製程工站的機台棑配沒有完成。 步驟S26,若該訂單貨物所有工站的機台排配完成, 則判斷模組12根據第一工站機台排配的生產時間判斷該訂 單的交期是否達成。當前製程工站的第一工站排配的生産 曰期在排配當天的曰期之前時,判斷訂單貨物的交期不能 達成;當前製程工站的第一工站排配的生産日期和排配當 天的日期相同或在排配當天的期日之後時,判斷訂單貨物 的父期能達成。 步驟S28,若該訂單的交期達成,則儲存模組18將該 訂單貨物的計劃排程儲存至資料庫2中。 在步驟S12中,若該訂單貨物沒有途程資料,則步驟 S30輸出異常資訊後結束流程。 在步驟S14中,若該訂單貨物的庫存數量大於或等於 該訂單的數量,則步驟S30輸出異常資訊後結束流程。 在步驟S18中,若該貨物不需要經過後製程工站,則 14 200903355 至步驟S22進行前製程計劃排程。 在步驟S24中,若前製程工站的機台排配沒有完成, 則返回至步驟S22進行前製程工站排程。 在步驟S26中,若該訂單的交期未達成,則至步驟S30 輸出模組20輸出異常資訊後結束流程。 【圖式簡單說明】 圖1係本發明訂單計劃排程系統較佳實施例的硬體架 構圖。 圖2係圖1所不電腦主機的功能模組圖。 圖3係本發明訂單計劃排程方法較佳實施例的流程 圖。 圖4係圖3中後製程工站排程的流程圖。 圖5係圖3中前製程工站排程的流程圖。 【主要元件符號說明】 電腦主機 1 資料庫 2 顯示器 3 鍵盤 4 滑鼠 5 獲取模組 10 判斷模組 12 計算模組 14 排程模組 16 儲存模組 18 200903355 輸出模組 20 從資料庫中獲取進行計劃排程訂單的資訊 S10 該訂單貨物是否有途程資料 S12 該訂單貨物的庫存是否小於訂單所需數量 S14 將訂單所需數量減去該貨物庫存數量得到需要生產的 數量 S16 是否需要經過後製程工站 S18 進行後製程工站計劃排程 S20 進行前製程工站計劃排程 S22 所有前製程工站是否排配完成 S24 該訂單貨物的交期是否達成 S 2 6 將該訂單貨物的計劃排程儲存至資料庫中 S 2 8 16200903355 IX. Description of the Invention: [Technical Field of the Invention] The present invention relates to an order planning scheduling system and method. [Prior Art] -Synthesis s - Processing and manufacturing of batch order goods Needs: The work station, when there is a delay in each station, etc. The: goods are therefore required to enter the order of goods at each station. The company is based on the order (four) seeking = editing, the use of machine equipment, production capacity, etc. σ considers a reasonable production plan for the production of δ, the most timely on-time shipping demand. At present, the production department is engaged in the production of personnel (4) (4), (4) There are orders for goods (4), and 1 2 departments have experienced personnel in the department. Due to the large number of orders, the production scheduler can not completely control the use of the raw materials of the order, and the production capacity is everywhere, so the production of the arrangement is not 5 _ place, resulting in Orders cannot be shipped on time, and manual placement is also inefficient. Using the computer system to automatically schedule the order work, order demand (4) station capacity information 'improve the efficiency and accuracy of the allocation work, reduce the risk that the father 3 can not ship on time. [Summary of the Invention] In view of the above, it is necessary to propose an order that can be automatically ordered according to the reverse schedule. Planning the scheduling method, the required station capacity, and quickly considering the above, it is necessary to propose – it is possible to automatically calculate the production capacity planning of the station for the order based on the reverse scheduling. The customized soap plan scheduling system includes a computer host and a library connected to the electricity county, and the database t stores an order=status. The computer host includes “for obtaining the (four) (four) order from the capital= The f number and number of the item are used to judge whether the item number of the order goods has the route information, and ir, and 'the quantity required in the order; whether the quantity of the quantity of the leaf Zengmo is not smaller than the quantity in the order When the quantity is required, the inventory quantity of the goods is obtained by the quantity of the goods. The quantity required is reduced by (4) the state... The judgment module is also used to determine whether the goods need to pass the post-process according to the return data of the two shells. Work 11^ group, used to process the work station after the goods need to pass the post-process work,; ^Tian recognizes A bucket of chemical, the station schedule or the required system does not need to carry out the post-process engineering When the schedule of the Chenggong station is completed, the pre-process station is ranked second, and the ...m杈 group is also used to judge that all the pre-processes of the pre-process are completed 'and all the pre-processes of the order goods::= when the arrangement is completed' Judge the machine port module for use when 兮~ reach; and store the schedule Save to;::: When the delivery of the goods is reached, 'the order of the goods is 3/4, and the method includes the following steps.... The π 枓 library is used to obtain the goods for the order. Ding Zaoru's U, quantity and delivery date; Genbee judges whether the order goods have route information; when 200903355 the order goods have route information, the quantity required for the order of the goods is ==== When the order quantity is required, the stock quantity of the 2 items of the shell is obtained by the production quantity; the number of the second item: the summer minus the goods, whether the goods need to pass the post-process 2::: Bellow judges the sputum spit B Shi ^ 6, Tian. The haibei object needs to pass the post-production Γ post-process station schedule; when the post-process station is completed, the process _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ The completion of the allocation, · when all the pre-process stations of the order goods ^: according to the production station of the pre-process station - the production period :i period: early: whether the parent of the object can be reached; and when the order The delivery/contraction % of the goods, the schedule of the 5 Ding early goods is stored in the database. ^ Compared to Xi = surgery, Shu Ming provides the order planning scheduling system / can be. Dingdan demand is converted into productivity information of the station, which realizes the productivity planning of the station and improves the efficiency and accuracy of the work. [Embodiment] / As shown in Fig. 1, it is a schematic diagram of a preferred embodiment of the order planning scheduling system of the present invention. The system mainly includes a computer host h database 2, a display of 3, a keyboard 4 and a mouse 5. The database 2 is connected to a computer host , for storing customer orders and production scheduling of each station. The database 2 can store the route information of each cargo, and the route information includes the item number of the goods, the name of the station to be completed to complete the goods, and the order of the station. The machine 1 is configured to schedule the production plan according to the allocation data of each station stored in the database 2 and the like. The host jade is connected with 200903355. Display 3, keyboard 4 and mouse 5 are used for input and output devices of relevant parameters in order scheduling. FIG. 2 is not a functional module diagram of the computer host 1 in FIG. The computer host 1 includes an acquisition module 10, a determination module 12, a calculation module 14, a scheduling module 16, a storage module 18, and an output module 20. The obtaining module 10 is configured to obtain information of the scheduled order from the database 2. The information for this order includes the item number, quantity and delivery date of the goods. The determining module 12 is configured to determine, according to the item number query database 2 of the order goods, whether the order goods have a route data. The determining module 12 is further configured to determine whether the quantity of the goods in the order is less than the quantity required by the order when the order goods have the way data. The calculation module 14 is configured to, when the quantity of the goods in the stock is less than the quantity required by the order, subtract the quantity required for the order from the quantity of the quantity to obtain the quantity of the production. The determining module 12 is further configured to determine, according to the name of the station in the route data, whether the order goods need to pass through the post-processing station. Among them, the former stations in the “empty board” station are collectively referred to as the pre-process station; the stations after the “empty board” station are collectively referred to as the post-processing station, and the post-processing station includes the assembly station and surface stickers. Loading station. The scheduling module 16 is configured to perform post-processing station scheduling when the order goods need to be processed by the post-processing station. First, when the goods need to pass through the assembly station, the scheduling module 16 reversely traverses all the production lines of the assembly station, and arranges the production quantity and time required for the order to the production line. For example, if the production quantity required for the order is 100K, the delivery time is June 20曰. If the assembly station has 9 200903355, the quantity of the goods in stock is 20K, the actual production quantity of the assembly station is 80K. If the assembly station has production line 1 and production line 2, production line 1 takes precedence over production line 2, production line 1 is idle and the capacity is 60K, production line 2 is idle and the capacity is 60K, then the production line is allocated. 1 Production of 60K on June 20, production line 2 on production of 20K on June 20. Further, the scheduling module 16 determines whether the holiday is on the day of June 20, and if the week is June 20, it needs to be forwarded to June 19 (the production is 生产). Then, when the goods need to pass through the surface mount station, the scheduling module 16 reversely traverses all the production lines of the surface mount station, and arranges the production quantity and time required for the order to the production line. The method of arranging the surface mount station and the method of arranging the assembly station. The scheduling module 16 is configured to perform pre-processing station scheduling when the post-process scheduling is completed. First, the scheduling module 16 reversely traverses the name of the pre-process station of the order goods in the course data, and allocates the production quantity and production time of each station according to the order quantity and the order delivery time. For example, if the production quantity of the goods is 100K and the delivery date is June 20th, the stations that need to pass through are cut, NC, black holes, copper plating, pre-treatment lines, dry film, and exposure. First, the production start time of the last station is 20 June, and the production quantity is 100K. If the station has 20K of the goods, the actual production quantity of the station is 80K. Further, the scheduling module 16 determines whether the holiday is on the day of June 20, and if the June 20th is Sunday, it needs to be forwarded to June 19 (the production is 曰). After the operation time and quantity of the “exposure” station are determined, continue to schedule the operation time of the previous station in the reverse manner as described above. Then, the scheduling module 16 reversely traverses the machine 伫 10 200903355 column of a former process station, and allocates the production time and the production quantity of each machine according to the capacity of each machine of the station. A station can include several machines that are sorted according to the order of priority of the machine during the sorting. For example, if the production quantity of the last station “exposure” station is 1000k on June 19th, the organic station 1 and the machine 2 of the station, the order of the machine 1 is prioritized over the machine 2, the machine 1 In the idle state and the capacity is 400k, the machine 1 can not fully meet the production quantity of the deployment. Check the machine 2, the machine 2 is idle and the capacity is 800K, and the capacity of the machine 1 plus machine 2 is greater than the station row. The production quantity of the distribution is scheduled to be 400k on the machine on June 19th and 600k on the machine 2; if the machine 1 is in working state and full load on June 19th, the machine 2 is in a space state with a capacity of 800K. If the capacity of the machine 2 is less than the production quantity of the station, then the day of the machine 1 on June 20 will be pushed back. If the machine 1 is idle in June 20, the capacity is 400k. Arranged on June 19, the machine 2 produces 800k, and on June 20, the machine 1 produces 200k. After the production time of the “exposure” station is determined, the production time of each station is determined by analogy. The judging module 12 is further configured to determine whether all of the % machines of all the pre-process stations of the cargo are completed. When the first station in the current processing station is completed, the judging module 12 judges that the scheduling of all the pre-processing stations is completed; when the first station in the current processing station is not completed, The judging module 12 judges that the machine arrangement of the pre-process station is not completed. The judging module 12 is further configured to determine whether the delivery of the order is reached according to the production time of the first station machine and the current time when all the pre-processing stations of the goods are completed. When the production date of the first station of the current processing station is before the date of the day of the allocation, it is judged that the delivery of the order goods cannot be reached in 200903355; the production date and arrangement of the first station of the current processing station When the date of the day is the same or after the period of the day of the arrangement, it is judged that the delivery of the order goods can be achieved. For example, if the current time is June 10, the production time of the first station machine is June 12, then the delivery time of the order can be judged; if the current time is June 10, the first station machine The production time is June 8, and it is judged that the order delivery cannot be reached. The storage module 18 is configured to store the job schedule of the order into the database 2 when the delivery of the order is reached. The output module 20 is configured to output abnormal information to prompt the staff member when the order goods have no way data or when the inventory of the goods is greater than the quantity of the order or the delivery time of the order cannot be reached. As shown in Fig. 3, it is a flow chart of a preferred embodiment of the order planning scheduling method of the present invention. First, in step S10, the acquisition module 10 acquires information on the job scheduling order from the database 2. The information for this order includes the item number, quantity and delivery date of the goods. In step S12, the judging module 12 judges whether the order goods have a route data according to the item number query resource library 2 of the order goods. In step S14, when the order goods have route information, the judging module 12 judges whether the quantity of the goods in the goods is less than the quantity of the goods orders. In step S16, when the inventory quantity of the goods is less than the quantity of the goods order, the calculation module 14 subtracts the quantity of the goods orders from the quantity of the goods to obtain the production quantity. In step S18, the judging module 12 judges whether the goods need to pass the post-processing station according to the name of the station in the route data. Among them, the former stations of the “empty board” 12 200903355 station are collectively referred to as the former process station; the stations after the “empty board” station are collectively referred to as the post-process station, and the post-process station includes the assembly station and surface. Mounting station. In step S20, when the goods need to be scheduled by the post-processing station, the scheduling module 16 performs the scheduling of the post-processing station. As shown in FIG. 4, the specific steps of the post-process planning schedule are: step S202, the judging module 12 judges whether the cargo needs to pass through the assembly station according to the name of the station in the cargo route data; if the cargo needs to pass through the assembly machine If the station is in step S204, it is determined that the module 12 determines whether the inventory of the goods at the assembly station is less than the order quantity of the goods; if the inventory of the goods at the assembly station is less than the order quantity of the goods, then the scheduling module 16 of step S206 Traverse all production lines of the assembly station, and arrange the production quantity and time of the goods order to the production line; in step S208, the determining module 12 determines whether the goods need to pass the surface mount work according to the name of the station in the goods route data. If the goods need to pass through the surface mount station, step S210 determines that the module 12 determines whether the goods are in the library of the surface mount station, and whether the deposit is less than the order quantity of the goods; if the goods are at the surface mount station If the inventory of k ' is less than the order quantity of the goods, then the scheduling module 16 traverses all the production lines of the surface mount station in step S212, and the production of the goods order The amount of time to the production line with another row. In step S22, when the rear process station is completed, the scheduling module 16 performs the pre-process station scheduling. As shown in FIG. 5, the specific steps of the pre-process schedule are: step S220, reversely traversing the name of the pre-process station in the transit route data, and scheduling the pre-process according to the production quantity and delivery date of the goods order. Production quantity and production time of the station. In step S222, it is determined whether the inventory quantity of the pre-process station is less than the production quantity. Step S224, when the inventory quantity of the pre-process station is less than the production quantity, reversely traverse the machine train of the pre-process station, and arrange the production of the corresponding machine according to the capacity of the pre-process station Time, quantity of production. In step S24, the judging module 12 determines whether all the pre-processing stations of the order goods are all sorted according to whether the disposition of the first station of the pre-process station is completed. When the first station in the current processing station is completed, the judging module 12 judges that the scheduling of all the pre-processing stations is completed; when the first station in the current processing station is not completed, The judging module 12 judges that the machine mating of the pre-process station is not completed. In step S26, if the machine scheduling of all the stations of the order goods is completed, the judging module 12 judges whether the delivery time of the order is reached according to the production time of the first station machine. The production schedule of the first station of the current process station is judged before the expiration date of the day of the allocation, and the delivery date of the order goods cannot be reached; the production date and the arrangement of the first station of the current process station If the date of the day is the same or after the date of the day of the arrangement, the parental period of the order goods can be determined. In step S28, if the delivery of the order is reached, the storage module 18 stores the planned schedule of the order goods in the database 2. In step S12, if the order goods have no route information, step S30 outputs the abnormality information and ends the flow. In step S14, if the stock quantity of the order goods is greater than or equal to the quantity of the order, step S30 outputs the abnormal information and ends the flow. In step S18, if the cargo does not need to pass through the post-processing station, 14 200903355 to step S22 perform the pre-process scheduling. In step S24, if the machine scheduling of the previous processing station is not completed, the process returns to step S22 to perform the pre-processing station scheduling. In step S26, if the delivery of the order has not been reached, then the output module 20 outputs the abnormality information in step S30 and ends the flow. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a diagram showing the hardware configuration of a preferred embodiment of the order planning scheduling system of the present invention. Figure 2 is a functional block diagram of the computer host of Figure 1. Figure 3 is a flow diagram of a preferred embodiment of the order planning scheduling method of the present invention. Figure 4 is a flow chart of the schedule of the post-process station in Figure 3. Figure 5 is a flow chart of the schedule of the pre-process station in Figure 3. [Main component symbol description] Computer host 1 Database 2 Display 3 Keyboard 4 Mouse 5 Get module 10 Judgment module 12 Calculation module 14 Scheduling module 16 Storage module 18 200903355 Output module 20 Obtained from the database Information on planning scheduled orders S10 Is there any way to order the goods? S12 Is the stock of the order goods less than the quantity required for the order? S14 The quantity required for the order minus the quantity of the goods in the order to obtain the quantity to be produced S16 Is it necessary to go through the post-process? Station S18 Post-Processing Station Planning Scheduling S20 Performing Pre-Processing Station Planning Scheduling S22 Whether all pre-processing stations are scheduled to be completed S24 Whether the delivery of the order goods is fulfilled S 2 6 Planning the order of the goods Save to database S 2 8 16

Claims (1)

200903355 十、申請專利範圍: 1-種3T單計劃排程系統,包括電腦主機及與該電腦 主機相連的資料庫,該資料庫中存儲有訂單及各工 站的生産排配資料,所述電腦主機包括: ^取模組,用於從該資料庫中獲取進行排程的訂單 貨物的貨號、數量及交期; 判斷扠組,用於判斷該訂單貨物的貨號是否有途程 貝料,及當該訂單貨物的貨號有途程資料時,判斷 該$物的庫存數量是否小於該訂單中所需的數量; 計算模組,用於當該貨物的庫存數量小於該訂單令 所需的數量時,將該訂單所需的數#減 庫存數量得到生産數量; 貝物的 :述判斷模組_於根據該貨物的途程資料判斷該 貨物是否需要經過後製程工站; X 排私輪組,用於當該貨物需要經過後製程工站時, =後製程卫站排程’及用於#該貨物不需要進行 後衣程工站排程或所述後製程工站排程完 行前製程工站排程; & 所述判斷模組還用於判斷所述前製程工站 θ 否全部排配完成,及當該訂單貨物的所 = 站的機台排配完成時,判斷 衣柱 能達成;& 丁早“勿的交期是否 ’將該 交峨時 17 200903355 2·如申請專利範圍第w所述的 所述主機還包括: 丁」純糸統, ^ :杈、、且帛於當邊訂單貨物的貨號沒有 :::物的庫存大於訂單所需的數量時;::; 貝物的父期不能達餅,輪出異常資訊。 3如申%專㈣㈣丨項所述的訂 所述途程資料包括貨物 一〉丁、統 的工站沾夕於 虎凡成该貝物需經過 、%、工站的途序,所述判斷模袓杞攄所 处工站名稱判斷該貨物是否經過後製程工站二斤、f 判斷模組根據所述工站途序中前製程工二所: 是否完成。所有所製程工站的機台排配 4 劃排程方法,該方法包括如下步驟: =庫t獲取進行排輕的訂單貨物的貨號、數量 Ϊ ^ °T早貝物的貨號判斷該訂單貨物是否有途程 有途程資料時,判斷該貨物庫存數量 疋否小於該貨物訂單中所需的數量; 里 =該貨物料存數量小於該㈣ 時,將該訂單中所兩沾叙θ丄 汀而的數里 得到生産數量; 讀去該貨物的庫存數量 根據該貨物的途程 製程工站; 唧X貝物疋否而要經過後 18 200903355 當該貨物需要經過後制 排程; 傻衣轾工站時,進行後製程工站 富後製私工站排配完成、 根據前製程工站的;成:進仃所製程工站排程; 該訂單貨物的所;;:::的排配是否完成判斷 完成; 衣私工站的機台是否全部排配 虽5亥S丁單貨物的所 時,根據前製程工站的第 站的機台排配完成 磨斤化此 站的弟—工站排配的生産曰期判 心亥S丁早貝物的交期是否能達成;及 當該訂單貨物的交期. 儲存至資料庫中達成一,將該訂單貨物的排程 5 =、料利範圍第4項所述的訂單計《程方法, δ亥方法還包括步驟: ^該訂單沒有途程資料或庫存大於該訂單貨 :需:數量或該訂單的交期不能達成, 常貢訊後結束流程。 6 ·:申Λ專利範圍第4項所述的訂單計劃排程方法, 述判斷m是否需要經過後製程工站步驟包 括. :該貨物的途程資料的工站名稱中包括後製程工站 日"’判斷模__貨物需料過後製程工站;冬 !貨物料程諸的工站名财不包括後製程工站 日才,判斷模組判斷該貨物不經過後製程工站。 7.如申料圍第4項所料訂料劃排程方法, 19 200903355 所速判_訂單貨物的所有前製程卫站的機台是否 全部排配完成的步驟包括: 當珂製程工站的第一個工站排配完 判斷該訂單貨物的所有前製程工站的機=: 成;當前製程工站的第-個工站排配沒有完I時 判斷該訂單貨物的前製程工站的機台排配 >又有元成。 •如申請專利範圍第4销述的訂單計劃排程方法, =斷訂單貨物的交期是否能達成的步驟包括: 田刖衣私工站的第一工站排配的生產 天=日期之前時’判斷訂單貨物的交期不能達成; ::製:呈工站的第一工站排配的生産曰期和排配當 的日』相同或在排配當天的日期之後時,判斷訂 單貨物的交期料成。 1 .如申請翻範目第4韻述料科_程方法, 所述後製程工站排程包括步驟: =該貨物途程資射的後製程工站名稱判斷該貨 物疋否需要經過組裝工站; 當該貨物需要經過組裝工站時,判斷該貨物在組裝 =站的庫存是否小於該貨物訂單所需的數量; :::物在組裝工站的庫存小於該貨物訂單所需的 ,遍歷經裝工站所有生產線別,將該貨物訂 早所f的生産數量、時間排配到生產線別; 根據該貨物途程f料中的後製程工站名稱判斷該貨 20 200903355 物是否需要經過表面貼裝工站; 當該貨物需要經過表面貼裝工站時,判斷該貨物在 表面貼裝工站的庫存是否+於該貨物訂單所需的數 量;及 當該貨物在表面貼裝工站的庫存小於該貨物訂單所 需的數量時,遍歷表面貼裝卫站所有生產線別,將 該貨物訂單所需的生産數量、時間排配到生產線別。 所述前製程工站排程包括步驟: 圯向遍歷該貨物途程資料中需經過的前製程工站名 稱,根據該訂單所需生産數量、訂單交期排配各前 製程工站的生產數量及生産時間; 判斷所述前製程工站的庫存數量是否小於生産數 量;及 當所述前製程工站的庫存數量小於生産數量時,逆 1 向遍歷所述前製程工站的機台佇列,根據所述前製 程工站機台的產能排配相應機台的生産時間、生産 數量。 11 ·如申請專㈣圍第4項所述的訂單計劃排程方法, 該方法還包括步驟: 當該貨物不需要進行後製程工站時,直接轉至進行 前製程工站排程的步驟。 12.如申請專利範圍第4項所述的訂單計劃排程方法, 該方法還包括步驟: 21 200903355 則返回至進行 若前製程工站的機台排配沒有完成 前製程工站排程的步驟。 22200903355 X. Patent application scope: 1-type 3T single-plan scheduling system, including a computer host and a database connected to the computer host, the database stores the order and the production and distribution data of each station, the computer The host includes: a module for obtaining the item number, quantity, and delivery date of the scheduled goods from the database; determining the fork group for determining whether the item number of the order goods has a route, and when When the item number of the order goods has the route information, it is determined whether the quantity of the item is less than the quantity required in the order; the calculation module is used when the quantity of the item is less than the quantity required by the order, The quantity required for the order is reduced by the number of stocks; the sample of the shell: the judgment module _ is based on the route information of the goods to determine whether the goods need to pass through the post-processing station; X-row private wheel group, used for When the goods need to pass through the post-processing station, = after the process station schedule 'and for # the goods do not need to carry out the post-work station schedule or the post-process station schedule before the completion of the process station The judging module is further configured to judge whether the pre-processing station θ is all completed, and when the scheduling of the station of the order goods is completed, determining that the clothes column can be achieved; &D; Ding early "Do not pay the delivery time or not" at the time of delivery 17 200903355 2 · The host as described in the patent application scope w also includes: Ding pure system, ^: 杈, and 帛When the order number of the goods is not::: The inventory of the goods is greater than the quantity required by the order;::; The parent of the item cannot reach the cake, and the abnormal information is rotated. 3 The order information mentioned in the application of the “%” (4) (4) item includes the goods, the Ding, the station of the station, the case of the tiger, the passage of the house, the %, the station, the judgment mode.名称 The name of the station where the station is located determines whether the goods have passed the post-process station and two kilograms, and the f-determination module is based on the pre-programming process of the station: whether it is completed. All the stations of the engineering station are equipped with a 4-row scheduling method. The method includes the following steps: = library t obtains the item number of the order-ordered goods, quantity Ϊ ^ °T The item number of the morning item determines whether the order goods are When there is a way to have the route information, it is judged whether the quantity of the goods in the goods is less than the quantity required in the order of the goods; If the quantity of the goods stored in the goods is less than the (4), the number of the two items in the order is narrated The quantity of the production is obtained; the quantity of the goods in the goods is read according to the route of the goods; the 唧X shell is not passed after 18 200903355 when the goods need to go through the post-production schedule; After the completion of the post-process station, the post-production system of the post-production system is completed, according to the pre-process station; into: the schedule of the station of the process; the arrangement of the order goods;;::: Whether the machine of the private labor station is all equipped with the goods of the 5th S S single-sale, according to the machine arrangement of the first station of the pre-process station, the finishing of the station-work station is completed. Production period Whether the delivery of the goods can be reached; and when the delivery of the goods is delivered. The storage is completed in the database, the order of the order goods is 5 =, and the order mentioned in item 4 of the profit range is calculated. The δHai method also includes the steps: ^ The order has no route information or the inventory is larger than the order goods: need: the quantity or the delivery date of the order cannot be reached, and the process ends after the tribute. 6 ·: The order planning method described in item 4 of the scope of patent application, the judgment of whether m needs to pass the post-processing station step includes: The name of the station of the goods includes the post-processing station day &quot ; 'Judgement mode __ goods need to be processed after the process station; winter! The goods of the various routes of the station do not include the post-process station, the judgment module judges that the goods do not pass the post-process station. 7. For the scheduling method according to item 4 of the application, 19 200903355 The speed of the judgment _ all the pre-process stations of the order goods are all completed. The steps include: The first station is equipped with the machine of all the pre-department stations that judge the order goods =: Yes; the first station of the current process station is not equipped with the I, and the pre-process station of the order goods is judged The machine is equipped with > • If the order planning method for the fourth paragraph of the patent application is made, the steps for the delivery of the broken goods can be reached: The production date of the first station of the Tianyiyi private station is before the date = date 'Determining the delivery date of the order goods cannot be fulfilled; :: System: The production period of the first station of the station is the same as the day of the production and the date of the allocation is the same or the date of the day of the allocation is judged. Delivery schedule. 1. If the application process is changed, the process of the post-process station includes the following steps: = the name of the post-process station of the cargo route to determine whether the cargo needs to pass through the assembly station When the goods need to pass through the assembly station, determine whether the goods in the assembly = station inventory is less than the quantity required for the goods order; ::: the inventory at the assembly station is less than the required for the goods order, traversing All the production lines of the loading station, the production quantity and time of the goods are allocated to the production line; according to the name of the post-processing station in the cargo process, it is judged whether the goods need to be surface-mounted. a station; when the goods need to pass through a surface mount station, determine whether the inventory of the goods at the surface mount station is + the quantity required for the goods order; and when the goods are at a surface mount station, the inventory is less than When the quantity required for the goods order is traversed, all production lines of the surface mount station are traversed, and the production quantity and time required for the order of the goods are allocated to the production line. The pre-process station schedule includes the steps of: traversing the name of the pre-process station in the way of traversing the goods, and arranging the production quantity of each pre-process station according to the quantity of production required for the order, the delivery date of the order, and a production time; determining whether the inventory quantity of the pre-process station is less than the production quantity; and when the inventory quantity of the pre-process station is less than the production quantity, traversing the machine queue of the pre-process station According to the capacity of the pre-process station, the production time and production quantity of the corresponding machine are allocated. 11 · If you apply for the order planning method described in item 4 of the special (4), the method further includes the steps: When the goods do not need to be used in the post-processing station, go directly to the step of scheduling the pre-processing station. 12. The order planning method according to claim 4, wherein the method further comprises the step of: 21 200903355, returning to the step of performing the pre-processing station scheduling of the pre-processing station without completing the pre-processing station scheduling . twenty two
TW96124673A 2007-07-06 2007-07-06 System and method for arranging a purchase order TW200903355A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW96124673A TW200903355A (en) 2007-07-06 2007-07-06 System and method for arranging a purchase order

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW96124673A TW200903355A (en) 2007-07-06 2007-07-06 System and method for arranging a purchase order

Publications (1)

Publication Number Publication Date
TW200903355A true TW200903355A (en) 2009-01-16

Family

ID=44722110

Family Applications (1)

Application Number Title Priority Date Filing Date
TW96124673A TW200903355A (en) 2007-07-06 2007-07-06 System and method for arranging a purchase order

Country Status (1)

Country Link
TW (1) TW200903355A (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI616827B (en) * 2016-11-28 2018-03-01 財團法人資訊工業策進會 Scheduling system and method
TWI636419B (en) * 2016-09-07 2018-09-21 三菱電機股份有限公司 Information processing device, information processing method and information processing program product

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TWI636419B (en) * 2016-09-07 2018-09-21 三菱電機股份有限公司 Information processing device, information processing method and information processing program product
TWI616827B (en) * 2016-11-28 2018-03-01 財團法人資訊工業策進會 Scheduling system and method

Similar Documents

Publication Publication Date Title
US7921027B2 (en) Constraint-based production planning and scheduling
Ribas et al. Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
Manavizadeh et al. A Simulated Annealing algorithm for a mixed model assembly U-line balancing type-I problem considering human efficiency and Just-In-Time approach
Kolisch Make-to-order assembly management
Khojasteh Production Control Systems
Bonfill et al. Decision support framework for coordinated production and transport scheduling in SCM
JP2004537772A (en) System and method for allocating supply of critical material components and manufacturing capacity
Qi Two-stage production scheduling with an option of outsourcing from a remote supplier
Grobler-Dębska et al. Formal scheduling method for zero-defect manufacturing
TW200903355A (en) System and method for arranging a purchase order
Fani et al. Balancing assembly line in the footwear industry using simulation: A case study
Chen et al. Adaptive scheduling in random flexible manufacturing systems subject to machine breakdowns
JP2009134399A (en) Sales production planning method, sales production planning system and computer program
Chen et al. Adaptive scheduling and tool flow control in flexible job shops
Vinci-Carlavan et al. Personalized production in Industry 4.0: a CONWIP approach
Mostafa et al. A proposed approach for selecting third party logistic alternatives
JP5102525B2 (en) A method for calculating a material requirement plan for demand including multiple demand dates and priorities
Saeed et al. A Review on Strategic Positioning of Bottleneck around the Customer Order Decoupling Point and Issues on Production Planning in Supply Chain
Zambrano-Rey et al. Minimizing the expected maximum lateness for a job shop subject to stochastic machine breakdowns
Kumar et al. Modelling and analysis of part and tool allocation decisions in a flexible manufacturing system under dynamic tool sharing
Wheeler Pulling a job shop into supply chain management
Chandar Optimizing lot sizes and establishing supermarkets in a multi-part, limited-capacity manufacturing system
Mähl et al. Lean Remanufacturing: Material Flows at Volvo Parts Flen
Pinto Operations management and production cells implementation: Operations Management, Energy Optimization, Kaizen, Lean, Production Cells
Skołud et al. Prioritizing and scheduling of production orders in non-homogenous production systems