TW201017576A - System and method to determine root cause constraints and resolution options to solve order promising exceptions - Google Patents

System and method to determine root cause constraints and resolution options to solve order promising exceptions Download PDF

Info

Publication number
TW201017576A
TW201017576A TW098133434A TW98133434A TW201017576A TW 201017576 A TW201017576 A TW 201017576A TW 098133434 A TW098133434 A TW 098133434A TW 98133434 A TW98133434 A TW 98133434A TW 201017576 A TW201017576 A TW 201017576A
Authority
TW
Taiwan
Prior art keywords
dfx
quot
value
order
report
Prior art date
Application number
TW098133434A
Other languages
Chinese (zh)
Inventor
Deepak Sanghi
Alok Ashtikar
Nitin Gupta
Toolika Maria Lewis
Sachin Maheshwari
Arvindh Murugan
Original Assignee
I2 Technologies Us Inc
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 I2 Technologies Us Inc filed Critical I2 Technologies Us Inc
Publication of TW201017576A publication Critical patent/TW201017576A/en

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0637Strategic management or analysis, e.g. setting a goal or target of an organisation; Planning actions based on goals; Analysis or evaluation of effectiveness of goals
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/067Enterprise or organisation modelling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/08Logistics, e.g. warehousing, loading or distribution; Inventory or stock management
    • G06Q10/087Inventory or stock management, e.g. order filling, procurement or balancing against orders

Abstract

A system and method is disclosed for determining root cause constraints and resolution options to solve order promising exceptions. The system includes a database storing order promise data associated with one or more enterprises. The system further includes a computer coupled with the database, the computer is configured to receive an order promise from the one or more enterprises, define one or more constraints, and create one or more strategy models comprising one or more strategy changes. The computer is further configured to execute the one or more strategy models to relax the one or more constraints using the one or more strategy changes and generate a report of the reasons for lateness and shortness of the order promise and store the generated report in the database.

Description

201017576 六、發明說明: 【發明所屬之技術領域】 本發明大體而言係關於訂貨承諾,且更特定而言係關 於用以決定根本原因限制與解析選擇來解決訂貨承諾異 常的系統與方法。 【先前技術】 - ' . 傳統的訂貨承諾解決方案主要涉及在給定特定需求、 產品或企業要求的情況下產生最佳需求提交回應。然 而,傳統訂貨承諾解決方案之缺點之一在於當訂貨有所 縮短或延遲時,不存在瞭解經縮短或變晚訂貨之原因的 機制。當產生即時回應以對傳人之需求提交供應時,由 於分析需求要求與回應之間的不匹配並採取措施之時間 ㈣較小’ 13此問題變得更複雜。出現無法提供瞭解經 縮短或變晚/延遲訂貨之原因的機制之此現象並非所想 要的。 ^ 【發明内容】 本發明揭.示.—·種描板 . 誕供一訂鲕承諾系統的系統。該系統 包括一資料庫,i儲左j,. _ 八傩存與一或多個企業相關聯之訂貨承 :資料肖系統進_步包括一電腦其與該資料庫耦接, 該電腦經組態以:接此 ^ 接收—來自該等一或多個企業之訂貨 承諾;界定-或多個限制;及產生包含〜戈多個策略改 4 201017576 型。該電蹈進—步經组態以使用該 等一或多個策略改變執行該等—或多個策略模型以放寬 該等一或多個限制,及產生該訂t承諾之較晚及較短之 原因的報I且將該產生之報告儲存於該資料庫中。 揭不一種提供一訂貨承諾系統的方法。該方法提供·· 由-電滕接收一來自一或多個企業之訂貨承諾;由該電 猫界定一或多個限制;及由兮Φ 及由該電腦產生包含一或多個策 略改變之-或多個策略模型。該方法進—步提供:由該 電滕使用該等一或多個笛欢-,Α. ti* Jfcl y 取夕個策略改變執行該等一或多個策略 模型以放寬料—或多餘制;f職生該訂貨 承諾之較晚及較短之原因的報告,且儲存該產生之報告。 揭示一種實施有啟用訂貨承諾系統之軟體的電滕可讀 媒艎。該電腦可讀媒髏:接收來自一或多個企業之訂貨 承諾;界定-或多個限制;及產生包含—或多個策略改 變之—或多個策略㈣。該電腦可讀媒體進—步使用該 等一或多個策略改變執行該等—或多個策略模型以放寬 該等一或多個限制;及產生該訂貨承諾之較晚及較短之 原因的報告,且儲存該產生之報告。 【實施方式】 見在將參考較佳及替代實施例以下之詳細描述。熟習 此項技術者將認識到,本發明提供許多發明性概念及新 穎特徵,其僅為說明性的且不解釋為限制性的。因此, 201017576 本文論述之特定實施例係以實例之形式給出且不限制本 發明之範_。 第1圖圖示根據較佺實施例之示範性系統1〇〇、系統 100包含訂貨承諾系統110、一或多個企業120a-i 20η、 一或多個顧客130a_13〇n、網路14〇及通信鏈路ΐ42、 144a-144η及146a-146η。儘管展示及描述單一訂貨承諾 系統110、一或多個企業u〇a_12〇n及一或多個顧客 130a-13〇n ’但根據特定需要,實施例可涵蓋任意數目之 訂貨承諾系統11〇、任意數目之企業12〇al2〇n及/或任 意數目之顧客13〇a_i3〇n。另外或作為替代,訂貨承諾系 統110可與該等一或多個企業120a-120η中之任一者之 硬趙及/或軟鱧成一體式或分離式。 在一實施例中,訂貨承諾系統11()決定根本原因限制 與解析選擇來解決訂貨承諾異常。另外或作為替代訂 貨承諾系統11〇對一或多個企業12〇a_12〇n區分優先 權,且選擇一策略階層以分析及解析針對一個或一組訂 貨之訂貨承諾異常。亦即,在回應未與需求中指定之要 求或分析時供應鏈中可用之供應/分配相配合的訂貨 中。作為實例且並非限制,訂貨承諾系統11〇可放寬針 對個部署之訂貨的(例如)分配、延遲及來源限制, 且訂貨承諾系統11 〇可放寬不同部署之最小數量及供應 限制。因此,該方法經設計以用於每一部署以此方式 放寬可為獲得來自一或多個顧客130a l30n之高優先權 需求而修改之特定限制,以便協商對此等高優先權需求 6 201017576 之同意的提交回應。 在另一實施例中,一或多個企業120a-120η可使用一 或多個階層策略分析一個或一組訂貨,以模擬例如圖形 使用者介面上之可能回答’假定限制以階層方式放寬, 將硬」需求要求保持在適當位置,從而清楚地識別模 » 型中導致不匹配回應之某些根本原因中,且最終導引使 用者利用其應選擇之動作來使用放寬之限制修改不匹配 回應。 在一個實施例中,系統可在一或多俩電腦上操作,該 等電腦可與支援訂貨承諾系統11〇、一或多個企業 120a-120n及一或多個顧客i3〇a-130n之硬體及/或軟體 成一體式或分離式。此等一或多個電滕可包括任何合適 輸入裝置’諸如小鍵盤、滑鼠、觸控螢幕、麥克風或其 他用以輸入資訊之裝置。另外,此等一或多個電腦可包 括可傳達與系統100之操作相關聯之資訊的任何合通輸 〇 出裝置,該資訊包括數位或類比資料、視覺資訊或音訊 資訊。此外,此等一或多個電腦可包括固定或可移除電 &quot; 腦可讀儲存媒體’諸如磁性電腦磁盤、CD-ROM或甩以 , 自系統100接收輸出及向系統100提供輸入的其他合適 媒體。另外’此等一或多傭電腦可.包..括一 '或多個..處理器 及相關聯記憶體,以根據系統100之操作執行指令及操 縱資訊。 另外或作為替代,訂貨承諾系統11 〇、一或多個企業 120a-120n及/或一或多個顧客I30a-130n每一者可在一 201017576 或夕個單獨電腦上操作,或可在-或多個共用電腦上操 作等或夕個電腦中之每一者可為工作臺、個人電 腦(pc )、網路雷魁 /m ^ 电腿》、個人數位助理(pda )、無線資料 淳或任何其他合谪士+曾 0週叶算裝置。在另一賁施例中,一或多 個使用者可與訂佐之#/ 、。丁貨承諾系統110、一或多個企業 120a-120n及一卷客加紅办 %多個顧客130a-130n相關聯。此等一或 多個使用者可包括例如處置系統⑽内之訂貨承諾及/或201017576 6. INSTRUCTIONS OF THE INVENTION: TECHNICAL FIELD OF THE INVENTION The present invention relates generally to order commitments and, more particularly, to systems and methods for determining root cause limitations and analytical choices to resolve order commitment exceptions. [Prior Art] - ' . The traditional order commitment solution mainly involves generating the best demand submission response given the specific requirements, products or business requirements. However, one of the shortcomings of traditional order-commitment solutions is that there is no mechanism for understanding the reasons for shortened or late orders when orders are shortened or delayed. When an immediate response is generated to submit a supply to a descendant's needs, the time between the analysis of the demand requirement and the response is not matched and the time taken to take the action (4) is smaller. 13 This problem becomes more complicated. This phenomenon of failure to provide a mechanism for understanding the reasons for shortening or late/delayed orders is not desirable. ^ [Summary of the Invention] The present invention discloses a method for displaying a system of commitments. The system includes a database, i store left j,. _ octopus and one or more enterprises associated with the order bearing: the data system _ step includes a computer coupled to the database, the computer group State: to receive this ^ Receive - order commitments from the one or more companies; define - or multiple restrictions; and generate multiple types of strategies including ~ ~ 201017576. The step-by-step configuration is to use the one or more policies to change the execution of the one or more policy models to relax the one or more restrictions, and to generate the late and shorter of the subscription commitments. The reason for the report I and the generated report is stored in the database. A method of providing an order commitment system is not disclosed. The method provides for receiving an order fulfillment from one or more businesses; defining one or more restrictions by the electric cat; and by 兮Φ and generating one or more policy changes by the computer - Or multiple policy models. The method further provides: by using the one or more flute-, Α. ti* Jfcl y, a strategy change to execute the one or more strategy models to relax the material - or redundant system; f The employee reports on the reason for the late and shorter reasons for the order commitment, and stores the report of the occurrence. A readable medium for implementing a software having an order fulfillment system is disclosed. The computer readable medium: receiving an order fulfillment from one or more businesses; defining - or multiple restrictions; and generating - or multiple policy changes - or multiple strategies (4). The computer readable medium further uses the one or more policies to change the execution of the one or more policy models to relax the one or more restrictions; and to generate the later and shorter reasons for the order commitment Report and store the resulting report. [Embodiment] The following detailed description will be referred to with reference to preferred and alternative embodiments. It will be appreciated by those skilled in the art <RTIgt;the</RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; </ RTI> <RTIgt; Therefore, the specific embodiments discussed herein are presented by way of example and not limitation of the invention. 1 illustrates an exemplary system 1 according to a more illustrative embodiment, system 100 includes an order commitment system 110, one or more businesses 120a-i 20n, one or more customers 130a_13〇n, a network 14 and/or Communication links ΐ42, 144a-144n and 146a-146n. Although a single order commitment system 110, one or more businesses u〇a_12〇n, and one or more customers 130a-13〇n' are shown and described, embodiments may encompass any number of order commitment systems, depending on particular needs. Any number of businesses 12〇al2〇n and/or any number of customers 13〇a_i3〇n. Additionally or alternatively, the order fulfillment system 110 can be integrated or separated from the hard copy and/or soft pack of any one or more of the one or more businesses 120a-120n. In one embodiment, the order fulfillment system 11() determines the root cause limit and the resolution choice to resolve the order commitment exception. Additionally or alternatively, the order fulfillment system 11 prioritizes one or more businesses 12〇a_12〇n and selects a policy level to analyze and resolve order fulfillment anomalies for one or a group of orders. That is, in an order that matches the supply/distribution available in the supply chain when it is not required to be specified or analyzed in the requirements. By way of example and not limitation, the order commitment system 11 can relax, for example, allocation, delay, and source restrictions for a deployed order, and the order commitment system 11 can relax the minimum number of different deployments and supply constraints. Thus, the method is designed for each deployment to relax certain restrictions that may be modified to obtain high priority requirements from one or more customers 130a l30n in order to negotiate such high priority requirements 6 201017576 Agree to submit a response. In another embodiment, one or more enterprises 120a-120n may analyze one or a set of orders using one or more hierarchical policies to simulate, for example, a possible answer to the graphical user interface 'assumed restrictions are relaxed in a hierarchical manner, The hard requirements are kept in place to clearly identify some of the root causes of the mismatch response in the model, and ultimately guide the user to use the action that should be selected to modify the mismatch response using the relaxed limit. In one embodiment, the system can operate on one or more computers that can be hardened with a support order commitment system 11 , one or more businesses 120a-120n, and one or more customers i3〇a-130n The body and / or soft body are integrated or separated. The one or more electrical devices may include any suitable input device such as a keypad, mouse, touch screen, microphone or other means for inputting information. In addition, the one or more computers may include any communicative output device that conveys information associated with the operation of system 100, including digital or analog data, visual information, or audio information. Moreover, such one or more computers may include fixed or removable electrical &quot; brain readable storage media such as magnetic computer disks, CD-ROMs or cartridges, receiving input from system 100 and providing input to system 100; Suitable media. In addition, such one or more commissioning computers may include a package or processor and associated memory for performing instructions and manipulating information in accordance with the operation of system 100. Additionally or alternatively, the order fulfillment system 11 , one or more businesses 120a-120n and/or one or more customers I 30a-130n may each operate on a single computer at 201017576 or on a separate computer, or may be at - or Each of the multiple shared computers, or each of the computers, can be a workbench, a personal computer (pc), a network leikui/m^ electric leg, a personal digital assistant (pda), a wireless data file, or any Other combined gentlemen + once 0 weeks of the device. In another embodiment, one or more users can subscribe to #/,. The Ding Commodity Commitment System 110, one or more businesses 120a-120n, and a Roll of Customer Plus Red Offices are associated with a plurality of customers 130a-130n. Such one or more users may include, for example, an order commitment and/or within the treatment system (10)

或多個相關任務的「計劃者」。另外或作為替代,此等 或多個使用者可包括例如一或多個經程式化以自主處 置系統100内之_ 3 μ Λ 訂貨承諾、訂貨實現、供應鏈計劃及/或 一或多個相關任務之電腦。 在個實施例中,訂貨承諾系統110可使用通信鏈路 142與網路140耦接,通信鏈路142可為適於在系統1〇〇 之操作期間支援訂貨承諾系統」i 〇與網路! 4〇之間的資 料通信的任何有線、無線或其他鏈路。一或多個企業 120a-120n可使用通信鍵路144a l44n與網路」耦接, 通信鏈路144a_144n可為適於在系統1GG之操作期間支 援一或多假企業12〇a-i20n與網路140之間的資料通信 的任何有線、無線或其他鏈路。一或多個顧客l3〇a_l3〇n 可使用通信鏈路146a-146η與網路140麵接,通信鏈路 146a-16n可為適於在系統1〇〇之操作期間支援一或多嗰 顧客130a-130n與網路14〇之間的資料通信的任何有 線、無線或其他鏈路。 儘管通信鏈路142、U4a-144n及146a-146n展示為將 201017576 訂貨承諾系統110、一或多個企業i2〇a l2〇n 一 . .夕個 顧客130a-13 0n整體耦接至網路14〇,但根據特 要, 訂貨承諾系統110、一或多個企業i2〇a l2〇n έΒ _ ^一或多個 顧客130a-130n可直接彼此通信。另外或作 抑 缺 穴*,根 據特定需要,訂貨承諾系統11〇可駐留於一或多個企業 120a-120η 内。 在另一實施例中,網路14〇可包括網際網路及耦接訂 貨承諾系統lio、一或多個企業120a_120n及—或多個顧 客130a-13On的任何適當區域網路(LAN)、都會區域網 路(MAN )或廣域網路(WAN广熟習此項技術者將認 識到,未描繪或描述系統1〇〇内之通信網路14〇及其他 組件的完整結構及操作。可結合已知通信網路及其他組 件而使用實施例。 第2圖根據較佳實施例更詳細圖示第1圖之訂貨承諾 系統110。如上文論述,訂貨承諾系統11〇包含位於一或 多個位置處之一或多個電腦,其包括相關聯輸入裝置、 輸出裝置、電腦可讀儲存媒體、處理器、記憶體’或用 於根據系統100之操作而接收、處理、儲存及傳送資訊 的其他組件。在一實施例中,訂貨承諾系統1 10在資料 庫220中接收、處理、儲存及傳送與一或多個企業 12〇a-120n及/或一或多個顧客13〇a_13〇n相關聯之策略 資料。 伺服器2 10包含一或多個需求實現引擎2丨2。儘管伺 服器210展示且描述為包含一或多個需求實現引擎 201017576 212但根據特定需要,實施例可涵蓋任何合適最佳化 器、工作流程、訂貨承諾引擎'引擎或引擎組合。 在—實施例中,需求實現引擎212可取決於供應、分 , 配及/或供應鏈限制而縮短或延遲訂貨。作為實例且並非 〜限制,供應鏈限制包括(但不限於)以下者: k訂貨數量小於可裝運之最小數量。在此情況下,即 使存在充足供應及分配,整個訂貨亦將縮短。 _ 2.訂貨數量並非裝運之批量的倍數。在此情況下,訂 貨將縮短(假定對訂貨之承諾政策允許用於部分裝運)。 /針對自敎位置(卫礙、倉庫、分配中心或其他特 定位置)m請求之訂貨。在此情況下,若在所選位 置處不存在充分供應及分配,則訂貨可縮短或延遲。 4.針對特定運輸模式而請求之訂貨。在此情況下,裝 僅可自提供選疋運輸模式的位置進行且可能將引擎 具有之選擇崎於完全滿足訂貨或按時滿足訂貨。 ”卜或作為替代’上述限制中的—些限制可為硬限制 1可能為不可協商,而其他限制可為彈性限制:另外, 彈1±限制可為次最佳承諾之原因,且可例如在高優先權 訂貨之情況下放寬。 . ' . . . .. . 在另—實施例中,需求實現引擎212僅考慮可放寬之 :因(供應鏈限制)。舉例而言,若裝運批量(供應鍵限 制)無法改變’則不將此限制提供予需求實現引擎212, =需求實現引擎21r不決定放寬此限Μ否可提供較佳 201017576 資料庫220包含位於飼服器21〇纟地或遠端之一或多 個位置處的—或多個資料庫或其他資料储存酉己置。資料 庫220包括例如一或多個策略模型、改變資料 及報告資料226。僅作為實例而非限制,訂貨承諾系統 , 110儲存與一或多個企業120a-120n及一或多個顧客 130a 130η相關聯之訂貨承諾資料其可由伺服器21〇 且特定而言由一或多個需求實現引擎212使用。 φ 另外,與訂貨承諾系統11〇相關聯之使用者可指定需 求實現引擎212在經由一或多個策略模型222計算原因 時應考慮之限制。需求實現引擎212包含一或多個策略 模型,且使用者可提供需求實現引擎212在計算下文更 詳細論述之原因及解析報告時應使用之策略。 在一實施例中,一或多個策略模型222界定需求實現 引擎212在產生原因及解析報告時考慮之限制需求的類 型。另外,策略可在設計偕段期間界定,且可取決於使 ❿用者為改良訂貨之承諾而授權做出之所有改變。如上文 淪述,若使用者無法改變裝運批量,則需求實現引擎2D ’中並無產生以此作為原因之報告之需要,因為其為耗時 , 之計算。另外或作為替代,需求實現引擎212可指定在 針對使用者關注之訂货產生原因及解析報告時,該等一 或多個策略模型222將使用之待定策略。 在一實施例中’每一策略模型222包括一或多個需求 實現引擎212在界定序列中考慮之改變資料224 (即, 下文更詳細描述之一或多.個改變 201017576 在一實施例中,放寬最小數量(Relax_Min Quanthy) 改變放寬最小裝運數量。本質上,最小數量為—或多個 企業120a-120n在任何交付中可裝運之最小數量。舉例 而言,若所請求數量小於最小數量,則無法承諾訂貨。 另外或作為替代,最小數量是在銷售訂貨線、產品(根 本)及交付通道上建立模型。另外,此策略改變放寬針Or "planners" for multiple related tasks. Additionally or alternatively, the one or more users may include, for example, one or more of the _ 3 μ 订货 order commitments, order fulfillment, supply chain plans, and/or one or more correlations within the autonomous disposal system 100 The computer of the mission. In one embodiment, the order fulfillment system 110 can be coupled to the network 140 using a communication link 142 that can be adapted to support an order fulfillment system "i" and network during operation of the system 1"! Any wired, wireless, or other link that communicates between the data. One or more enterprises 120a-120n may be coupled to the network using communication keys 144a to 44n, which may be adapted to support one or more fake businesses 12〇a-i20n and the network during operation of system 1GG Any wired, wireless or other link between the 140 data exchanges. One or more customers l3〇a_l3〇n may be interfaced with network 140 using communication links 146a-146n, which may be adapted to support one or more customers 130a during operation of system 1〇〇 Any wired, wireless or other link that communicates with the data between the network and the network 14〇. Although the communication links 142, U4a-144n, and 146a-146n are shown as integrally coupling the 201017576 order commitment system 110, one or more enterprises i2〇a l2〇n.., the customers 130a-13 0n are integrally coupled to the network 14 Oh, but according to special circumstances, the order commitment system 110, one or more enterprises i2〇a l2〇n έΒ _ ^ one or more customers 130a-130n can directly communicate with each other. Alternatively or in the absence of a hole*, the order commitment system 11 can reside within one or more of the businesses 120a-120n, depending on the particular needs. In another embodiment, the network 14 may include an internet and any suitable local area network (LAN) that is coupled to the order commitment system lio, one or more enterprises 120a-120n, and/or multiple customers 130a-13On. Local Area Network (MAN) or Wide Area Network (WAN) Those skilled in the art will recognize that the complete structure and operation of the communication network 14 and other components within the system 1 are not depicted or described. Embodiments are used with the network and other components. Figure 2 illustrates the order commitment system 110 of Figure 1 in more detail in accordance with a preferred embodiment. As discussed above, the order commitment system 11A includes one of one or more locations Or a plurality of computers, including associated input devices, output devices, computer readable storage media, processors, memory's or other components for receiving, processing, storing, and transmitting information in accordance with the operation of system 100. In an embodiment, the order commitment system 110 receives, processes, stores, and transmits strategic data associated with one or more businesses 12〇a-120n and/or one or more customers 13〇a_13〇n in the repository 220. Server 2 10 includes one or more requirements implementation engines 2丨 2. Although server 210 is shown and described as including one or more requirements implementation engines 201017576 212, embodiments may encompass any suitable optimizer, depending on particular needs, Workflow, order commitment engine 'engine or engine combination. In an embodiment, demand implementation engine 212 may shorten or delay ordering depending on supply, distribution, allocation, and/or supply chain constraints. As an example and not a limitation, supply Chain restrictions include (but are not limited to) the following: k The order quantity is less than the minimum quantity that can be shipped. In this case, the entire order will be shortened even if there is sufficient supply and distribution. _ 2. The order quantity is not a multiple of the shipment quantity. In this case, the order will be shortened (assuming that the commitment policy for the order is allowed for partial shipment). / Order for the request for the location (guard, warehouse, distribution center or other specific location) m. In this case If there is no sufficient supply and distribution at the selected location, the order can be shortened or delayed. 4. Requested for a specific mode of transport In this case, the installation can only be carried out from the position where the transport mode is provided and may have the engine's choice to meet the order or meet the order on time. "Bu or as an alternative to the above restrictions - some restrictions The hard limit 1 may be non-negotiable, while the other limit may be a flexible limit: in addition, the bounce 1 ± limit may be the cause of the sub-optimal commitment and may be relaxed, for example, in the case of a high priority order. In another embodiment, the requirements implementation engine 212 only considers that it can be relaxed: due to (supply chain restrictions). For example, if the shipping lot (supply key limit cannot be changed), then this limit is not provided. The demand fulfillment engine 212, = the demand fulfillment engine 21r does not decide to relax the limit, may provide a better 201017576 database 220 contains one or more locations located at one or more locations of the feeder 21 remotely or remotely The library or other data is stored separately. Database 220 includes, for example, one or more policy models, change profiles, and report data 226. By way of example only and not limitation, the order fulfillment system 110 stores order fulfillment information associated with one or more businesses 120a-120n and one or more customers 130a 130n that may be by the server 21 and, in particular, by one or more The requirements implementation engine 212 is used. In addition, the user associated with the order commitment system 11A can specify the constraints that the demand implementation engine 212 should consider when calculating the cause via one or more policy models 222. The requirements fulfillment engine 212 includes one or more policy models, and the user can provide a strategy that the requirements implementation engine 212 should use in calculating the reasons discussed in more detail below and parsing the reports. In one embodiment, one or more policy models 222 define the types of demand requirements that the requirements implementation engine 212 considers when generating the cause and parsing the report. In addition, the strategy may be defined during the design phase and may depend on all changes that are authorized by the user to make a commitment to improve the order. As described above, if the user cannot change the shipment lot size, there is no need in the demand realization engine 2D' to report as a cause, because it is a time-consuming calculation. Additionally or alternatively, the demand fulfillment engine 212 can specify a pending policy that the one or more policy models 222 will use when generating an order for the user's attention and analyzing the report. In one embodiment, 'each policy model 222 includes one or more change profiles 224 that the requirements implementation engine 212 considers in the defined sequence (ie, one or more of the changes 201017576 are described in more detail below, in one embodiment, Relax_Min Quanthy Changes the minimum number of shipments. Essentially, the minimum number is - or the minimum number of multiple companies 120a-120n that can be shipped in any delivery. For example, if the requested quantity is less than the minimum quantity, then Unable to promise to order. In addition or as an alternative, the minimum quantity is modeled on the sales order line, product (essential) and delivery path. In addition, this strategy changes the relaxation needle

對銷售訂貨之所有此等最小數量。 僅作為實例而非限制,針對一項目之3〇個單位之訂貨 關於盡可能快(ASAP)承諾政策是在^日到期。在此 實例中,供應為第1日之12個單位及第5日之12個單 位。銷售訂貨線上之最小數量為1G個單位,且產品根本 上之最小數量為20個單位。訂貨之承諾將為第1日之 Π)個單位及第5日之1G個單位’且剩餘1Q個單位將縮 短。當需求實現引擎212執行此策略時,可在第丨曰承 諾12個單位且在第5日承諾12個單位,且剩餘6個單 位將縮短。在此情況下,銷售訂貨將經改變以將最小數 量設定為-丨且訂貨將經再承諾。此舉確保針對此訂貨, 不考慮最小數量。 在另一實施例中,放寬報價倍數 (Relax一Quote_Multiple )改變放寬訂貨線上之装運批 量。在此改變中,任何交付數量可僅為報價倍數之倍數。 舉例而言,若報價倍數為10個單位且所請求數量為Η 個單位,則訂貨將縮短。報價倍數是在銷售訂貨線、產 品(根本)及交付通道上建立模型。此策略改變放寬所 12 201017576 有此等報價倍數,且隨後可在對交付數量無任何限制之 情況下承諾訂貨。 僅作為實例而非限制,針對一項目之80個單位之訂貨 . 關於ASAP承諾政策是在第1日到期。供應為第]日之 25個單位及第5曰之1〇個單位。銷售訂貨線產品及 交付通道上之報價倍數分別為2〇、4〇及3〇個單位。訂 貨之承諾將為第i日之20個單位,且剩餘6〇個單位將 縮短。當需求實現引擎212以放寬報償倍數改 策略時,其提供可在第1日按時承諾25個單位,在第5 日承諾1G個單位’且剩餘45個單位將縮短。在此情況 下’訂貨將經改變以具有·i之報價倍數且訂貨將經再承 諾。 在另一實施例中,放寬選包時間 (Relax一Pick一Pack_Time )改變放寬訂貨線上之選包時 間》選包時間為在銷售訂貨線上建立模型之額外時間、 參 加至在產品(根本)及交付通道處建立模型之 選包時間且因此可使訂貨延遲。放寬此限制象徵著材 , 料之加速處置。然而,不同於最小數量及報價倍數改變, ' 選包時間經添加i因此放寬此限制並不㈣產品及交付 通道處之選包時間。 • . . . · . ... .. . 僅作為實例而非限制,針對2〇個單位之訂貨關於 ASAP承諾政策是在第1日到期。供應為第1日之⑽ 個單位。銷售訂貨線、產品(根本)及交付通道上之選 包時間分別為3曰、:曰及」日。訂貨之承諾將為第… 13 201017576 曰之20個單位(增加全部三個選包時間)。當需求實現 引擎212以放寬選包時間改變執行此策略時,其提供: 可在第3日承諾2〇個單位。在此情況下,選包時間將自 銷售訂貨線移除且訂貨將經再承諾。 在另一實施例中,放寬最大邊緣(Relax_Max_Edges ) 改變放寬裝運分支之數目且此舉使得多點交付成為可 能。銷售訂貨線上之最大邊緣向最大運輪分支提供此線 可採取之交付。特定而言,此指示與滿足訂貨相關聯之 裝運成本》若最大分支數目較多,則訂貨可自不直接裝 運至顧客之供應源獲得供應。放寬此限制象徵著採用較 高裝運成本之意願以便滿足顧客。另外,每一訂貨線指 定針對該訂貨線之交付可採用之最大裝運分支(邊緣)。 舉例而言,若訂貨線上之咖”_設定為i,則自消 耗供應之位置至顧客目的地之交付必須為直接的。 參. 僅作為實例而非限制,針對20個單位之訂貨關於 AS AP承諾政策是在第丨日到期。在位置1及位置2之供 應為在第1日各自為1G個單位。訂貨之目的地為分配中 心2。通道是自位置h分配中Ή配中心2且自位 置2…刀配中心2。销售訂貨線上之最大邊緣為1。在此All such minimum quantities for sales orders. By way of example and not limitation, orders for 3 units of a project are subject to expiration as soon as possible (ASAP) commitment policy. In this example, the supply is 12 units on the 1st day and 12 units on the 5th day. The minimum quantity on the sales order line is 1G units, and the minimum number of products is 20 units. The order commitment will be 1 unit on the 1st day and 1G units on the 5th day and the remaining 1Q units will be shortened. When the demand implementation engine 212 executes this strategy, it can commit 12 units at the third and commit 12 units on the 5th, and the remaining 6 units will be shortened. In this case, the sales order will be changed to set the minimum quantity to - and the order will be re-committed. This ensures that the minimum quantity is not considered for this order. In another embodiment, the Relax Quote Multiple (Relax-Quote_Multiple) changes the shipping lot on the order line. In this change, any delivery quantity can be only a multiple of the quote multiple. For example, if the quote multiple is 10 units and the requested quantity is Η units, the order will be shortened. The quotation multiple is modeled on the sales order line, the product (essential) and the delivery channel. This strategy changes the relaxation of the 12 201017576 with these quotation multiples, and can then promise to place an order without any restrictions on the quantity delivered. Orders for 80 units of a project, by way of example and not limitation. The ASAP commitment policy is due on the first day. The supply is 25 units on the 5th day and 1 unit on the 5th. The quotation multiples on the sales order line product and delivery channel are 2〇, 4〇 and 3〇 units respectively. The commitment to order will be 20 units on the i-th day, and the remaining 6 units will be shortened. When the demand fulfillment engine 212 relaxes the compensation multiple policy, it provides that 25 units can be promised on time on the first day, and 1G units on the fifth day, and the remaining 45 units will be shortened. In this case, the order will be changed to have a quote multiple of ·i and the order will be re-committed. In another embodiment, the relaxation of the selection time (Relax-Pick-Pack_Time) changes the selection time of the relaxed order line. The selection time is the extra time to build the model on the sales order line, participation in the product (essential) and delivery. The selection time of the model is established at the channel and thus the order can be delayed. Relaxing this restriction symbolizes the accelerated disposal of materials and materials. However, unlike the minimum quantity and the quote multiple change, 'the package time is added by i so the limit is relaxed and (4) the package time at the product and delivery channel. • . . . . . . . . . . . . . . . . . As an example and not a limitation, the order for 2 units of the ASAP commitment policy is due on the first day. The supply is (10) units on the first day. The selection time for the sales order line, product (essential) and delivery channel is 3曰, 曰 and 日 respectively. The promise of ordering will be the first... 13 201017576 20 20 units (add all three option time). When the demand implementation engine 212 performs this policy with a relaxed package time change, it provides: 2 units can be committed on the 3rd day. In this case, the selection time will be removed from the sales order line and the order will be re-committed. In another embodiment, relaxing the maximum edge (Relax_Max_Edges) changes the number of relaxed shipping branches and this makes multipoint delivery possible. The largest edge of the sales order line provides this line to the largest wheel branch for delivery. In particular, this indication relates to the cost of shipping associated with the order. If the maximum number of branches is large, the order can be supplied from a source that is not directly shipped to the customer. Relaxing this limit symbolizes the willingness to adopt higher shipping costs to satisfy customers. In addition, each order line specifies the maximum shipping branch (edge) that can be used for the delivery of the order line. For example, if the ordering coffee _ is set to i, the delivery from the point of supply to the customer's destination must be direct. 参. For example only and not as a limitation, order for 20 units for AS AP The commitment policy expires on the first day. The supply at position 1 and position 2 is 1G units on the first day. The destination of the order is distribution center 2. The channel is assigned from the location h to the center distribution center 2 From position 2... knife with center 2. The maximum edge of the sales order line is 1. Here

t。當需求實現引擎212執行此策略時,其提供:可在 第1日承諾自位置1夕雜AL I 厶 額卜10個單位。在此情況下,最 貨將經再承諾。線中之預設值(極高數目)且訂 201017576 在另一實施例中,放寬許可交付區 (Relax_permitted_Delivery_zones)改變放寬此限制, 且允許需求實現引擎212考慮針對向顧客之最終交付的 所有裴運點。銷售訂貨線指定向顧客之最終裝運可進行 之裝運位置,稱為交付區。放寬此限制自銷售訂貨移除 許可交付區之清單,且提供不具有此限制之承諾。另外, 每一訂貨線指定向顧客之最終裝運應發生之裝運點。t. When the demand implementation engine 212 executes this policy, it provides: 10 units that can be promised from the first day of the day. In this case, the best goods will be re-committed. Preset values in the line (very high number) and subscription 201017576 In another embodiment, the Relaxation License Delivery Area (Relax_permitted_Delivery_zones) change relaxes this limit and allows the Demand Implementation Engine 212 to consider all shipments for final delivery to the customer. point. The sales order line specifies the shipping location at which the final shipment to the customer can be made, known as the delivery area. Relaxing this restriction removes the list of licensed delivery areas from the sales order and provides a commitment not to have this limitation. In addition, each order line specifies the point of shipment at which the final shipment to the customer should occur.

僅作為實例而非限制,針對2〇個單位之訂貨關於 AS:P承諾政策是在第!日到期。在位置1之供應為2〇 個早位》交付通道是位置分配中心】,位置1—分配 中心分配中心2 (耗費1日)。僅許可自分配中心2 之裝運。訂貨之承諾將為在第2日之20個單位,其中材 料自位置1裝運至分配中心!,且自分配中心i裝運至 分配t心2。當需求實現引擎212執行此策略時,若裝 運進行之順序為自位置丨至分配中心丨,而至一或多個 顧客130a-130n,則其提供可在第」日按時承諾訂貨二在 此情況下’訂貨之許可交付區將經移除且訂貨將經再承 話0 . ' ' . . - - ' ' ' . - 在另一實施例中,放寬許可交付源 (Relax—PermiUed-Delivery_s〇urces )之改變允許需求 實現引擎2 i 2考慮所有可能的供應源。銷售訂貨線可指 定必須藉以祕供應之m等來轉教付源二 寬此限制自銷售訂貨移除交付源清單,且允許需求實現 引擎212尋找所有可能來源處之供應。另外,每一訂貨 15 201017576 線可指定將藉以消耗供應之位置。 僅作為實例而非限制’針對20個單位之訂貨關於 ASAP承諾政策是在第1日到期。在位置1之供應為10 個單位且在位置2為10個單位。銷售訂貨線處之交付源 清單僅含有位置訂貨承諾將為在第丨日自位置丨之 個單位。當需求實現引擎212執行此策略時,若亦自 位置2消耗供應,則其提供:可在第丨日按時承諾訂貨。As an example and not a limitation, the order for 2 units is about the AS:P commitment policy is in the first! The date expires. The supply at position 1 is 2 〇 early positions. The delivery channel is the location distribution center. The location 1 - distribution center distribution center 2 (consuming 1 day). Only shipments from Distribution Center 2 are licensed. The order commitment will be 20 units on the 2nd day, where the material is shipped from location 1 to the distribution center! And shipped from distribution center i to distribution t2. When the demand fulfillment engine 212 executes this policy, if the order of shipment is from the location to the distribution center, and to one or more customers 130a-130n, then the offer can be ordered on time on the first day. In the case of 'ordered delivery area will be removed and the order will be re-submitted 0. ' ' . . - - ' ' ' - In another embodiment, the license delivery source is relaxed (Relax-PermiUed-Delivery_s〇 The change in urces allows the requirements implementation engine 2 i 2 to consider all possible sources of supply. The sales order line may specify that the source of the supply must be transferred to the source. This limit removes the list of delivery sources from the sales order and allows the demand realization engine 212 to find the supply of all possible sources. In addition, each order 15 201017576 line can specify where the supply will be consumed. Just as an example and not a limitation 'Orders for 20 units. The ASAP Commitment Policy is due on the 1st. The supply at position 1 is 10 units and at position 2 is 10 units. The delivery source at the sales order line The list only contains the position order commitments will be the units from the position on the second day. When the demand implementation engine 212 executes this policy, if the supply is also consumed from location 2, then it is provided that the order can be promised on time on the second day.

在此情況下,訂貨之許可交付源經移除且訂貨將經再承 諾0 在另一實施例中,放寬許可交付服務 (Relax一Permitted—Delivery_Serviees )之改變允許需求 實現引擎212考慮所有可能的運輸模式以改良承諾。銷 售訂貨線指定將用於裝運訂貨之運輸模式。放寬此限制 允許需求實現引擎212使用較快運輸模式,或允許具有 與使用者所選模式不同之運輪模式的其他來源及區域。 另外’每一訂貨線可指定裝運應使用之運輸模式。 僅作為實例而非限制’針對2〇個單位之訂貨關於 ASAP承諾政策是在第2日到期。訂貨之目的地為分配中 心1 °自位置1至分配中心!存在兩種運輸模式:耗費i 日之空中運輸模式及耗費2日之道路運輸模式。交付服 務清單僅含有道路運輸模式。在第1日在位置i存在2〇 個單位之供應。訂貨夂承諾將為使用道路運輸樣式自位 置1在第3日(晚1日)之2〇個單位。當需求實現引擎 212執行此策略時,其提供:可使用空中運輸模式按時 201017576 承諾訂貨。在此情況下,訂貨之許可交付服務經移除且 訂貨將經再承諾。In this case, the license delivery source for the order is removed and the order will be re-committed. In another embodiment, the change in the license delivery service (Relax-Permitted-Delivery_Serviees) allows the demand implementation engine 212 to consider all possible transportation. The model is to improve the promise. The sales order line specifies the shipping mode that will be used for the shipment order. Relaxing this limit allows the demand implementation engine 212 to use a faster mode of transport or to allow other sources and zones with a different mode of the wheel than the mode selected by the user. In addition, each order line can specify the mode of transport that should be used for shipment. Just as an example and not a limitation 'Orders for 2 units are about the ASAP commitment policy that expires on the 2nd day. The destination of the order is 1 ° from the distribution center to the distribution center! There are two modes of transportation: the air transportation mode that consumes i day and the road transportation mode that consumes 2 days. The delivery service list contains only road transport modes. On the first day, there are 2 units of supply at location i. The order 夂 promises to use the road transport pattern from position 1 to 2 units on the 3rd (late 1st). When the demand implementation engine 212 executes this strategy, it provides: the air transport mode can be used to order on time 201017576. In this case, the order delivery service is removed and the order will be re-committed.

在另一實施例中,放寬許可匹配產品 (Relax_permitted—Matching—pr〇ducts )之改變允許需求 實現引擎212使用所請求項目藉以鏈接以滿足訂貨的所 有產品。銷售訂貨線指定可藉以消耗供應的不同產品之 凊單。換言之,訂貨線指定供應應進行以滿足訂貨的產 =。在需求實現引擎212中,在所請求項目與訂貨中指 疋之產tm凊單之間可能不存在任何相關。當需求實現引 擎212放寬此限制時’一或多個需求實現引擎212可能 能夠藉由自項目映射至之所有產品進行消耗來改良訂貨 之承諾。 報告分配短缺 在另一實施例中 (Report一Allocation_Sh〇mge )之改變放寬所有分配, 且允許訂貨直接自供應消耗。若供應未分配至訂貨可消 耗之賣方’則訂f將不獲得最佳承諾。此僅可在以下情 況下發生:若存在供應且下文論述之原因及解析報告, ^變報告—訂貨接蚊料承諾,假定使得分配至其他 賣方之某種供應可獲甩於進行訂之古* 寶之賣方0此改變僅報 ,为配短缺,且在再承諾訂貨 解決問題之前將必須移 勁分配。 僅作為實例而非限制針對 H一备 針對25個單位之訂貨在賣方1 處進仃且在第1日到期。供盔 供應為在第1曰(第1周)之 17 201017576 10個單位及在第2日(第2周)之10個單位。此供應 分配於賣方1 (第1周5個單位及第2周5個單位)及 賣方2 (第1周5個單位及第2周5個單位)。訂單之承 諾將為第1日之5個單位及第8曰之5個單位。當需求 實現引擎212執行此策略時,假定使得分配可獲用於賣 方1’其提供可在第1日及第8日承諾額外5個單位。 在此情況下,必須在第i周及第2周自賣方2至賣方1 移動分配》 ❿ 在另一實施例中,報告承諾可用短缺 (Report_Atp—Shortage)改變允許需求實現引擎212計 算供應中之不足量以按時完全滿足訂貨。若存在自廠商 或自製造商加速此供應之選擇,則可按時承諾訂貨。在 能夠承諾(CTP)材料訂單(bom)之情況下,可在一 個以上等級(最終項目、第一等級組件或最上游組件等) 處採購供應。此導致解決短缺或延遲之一個以上選擇。 Φ 另外或作為替代,需求實現引擎212僅在例如部署階段In another embodiment, the change in Relaxation License Matching Product (Relax_permitted-Matching-pr〇ducts) allows the demand implementation engine 212 to use the requested item to link to satisfy all products ordered. The sales order line specifies a list of different products that can be consumed by the supplier. In other words, the order line specifies that the supply should be made to meet the order's production =. In the demand implementation engine 212, there may not be any correlation between the requested item and the order tm in the order. When demand implementation engine 212 relaxes this limit, one or more demand fulfillment engines 212 may be able to improve the commitment of the order by consuming all of the products from which the project is mapped. Report Distribution Shortages In another embodiment (Report-Allocation_Sh〇mge) changes relax all allocations and allow orders to be consumed directly from the supply. If the supplier is not assigned to the order to consume, then the order will not receive the best promise. This can only happen if there is a supply and the reasons discussed below and an analytical report, the change report - the order for the mosquito feed, assuming that a certain supply to other sellers is available for the order* The seller of Baozhi 0 this change is only reported, it is a shortage, and it will have to be allocated before re-committed to order to solve the problem. By way of example only, and not limitation, for H-ready, the order for 25 units is entered at Seller 1 and expires on the first day. The helmet is supplied as 10 units on the 1st (1st week) 17 201017576 and 10 units on the 2nd (2nd week). This supply is allocated to Vendor 1 (5 units in Week 1 and 5 units in Week 2) and Vendor 2 (5 units in Week 1 and 5 units in Week 2). The commitment of the order will be 5 units on the first day and 5 units on the 8th. When the demand implementation engine 212 executes this policy, it is assumed that the allocation is available for the seller 1' whose offer can commit an additional 5 units on the 1st and 8th days. In this case, the distribution must be moved from the seller 2 to the seller 1 in the i-week and the second week. In another embodiment, the report commitment shortage (Report_Atp-Shortage) changes the allowable demand realization engine 212 to calculate the supply. The shortage is sufficient to fully satisfy the order on time. If there is a choice to accelerate this supply from the manufacturer or from the manufacturer, the order can be placed on time. In the case of a commitment (CTP) material order (bom), the supply can be sourced at more than one level (final item, first level component or most upstream component, etc.). This leads to more than one choice to resolve the shortage or delay. Φ Additionally or alternatively, the demand implementation engine 212 is only for example in the deployment phase

期間,針對所選之預先決定產品提供供應短缺。在cTP - 環境之情況下,可自一小組組件製造大量中間物及成品。 - 在一實施例中,使用者對僅某些組件及僅某些亦可自 外部廠商採購之t間物之供應進行控制。因此,若原因 及解析報告在中間物或額外供應無法移動之組件處提供 供應紐缺’則非常多的且並非彳艮有用之資料呈現予使用 者。可在藉由對產品進行標記而使供應變為彈性的情況 下識别產。Π,且此等產品稱為經標記緩衝區(Marked 18 201017576During this period, supply shortages were provided for selected pre-determined products. In the case of cTP-environment, a large number of intermediates and finished products can be manufactured from a small group of components. - In one embodiment, the user controls the supply of only certain components and only certain t-intermediaries that may also be purchased from an external manufacturer. Therefore, if the cause and resolution report provide a supply defect at the middleware or an additional supply that cannot be moved, then a large amount of information that is not useful is presented to the user. The production can be identified by making the supply elastic by marking the product. Oh, and these products are called marked buffers (Marked 18 201017576

Buffer) ’下文中更詳細論述。 文變報σ需完全且按時地承諾訂貨之額外供應乂此 «可含有用以改良訂貨之承諾的—個以上選擇。使用 者將必須選擇該選擇,且在再承諾訂貨之前以人工方式 、應在可自組件製造所請求項目之情況下,此報 有夕個選擇。在深供應鏈(多層ΒΟΜ)之情況下, 選擇之數目可非常大。Buffer) is discussed in more detail below. The varietal σ needs to be fully and on time to commit to the additional supply of orders. This «can contain more than one choice to improve the commitment of the order. The user will have to choose this option and will make a selection before the re-commitment of the order, manually, and in the case of the project that can be requested from the component manufacturing. In the case of deep supply chains (multiple layers), the number of choices can be very large.

,在實施例中,對產品進行標記以使額外供應(此等 稱為、里標°己緩衝區)移動。在許多情況下,額外供應可 在中間物處及在最終項目處配置。在此等情況下,若上 游組件經標記’職選擇此等組❹懒縣應短缺。 為進-步說明ΑΤΡ短缺報告,現在給出實例。在以下 實例中’針對項目Ρ之4〇個單位的訂貨在第」日到期。 10個單位之供應可在第1日獲得,幻〇個單位之供應 可在第5日獲得。訂貨之承諾為第j日之n固單位及第 5曰之10個單位。當需求實現引擎212執行此策略時, (在第1日)承諾訂貨。在此情況下,僅存在一個選擇, 且此將僅在項目Ρ經標記之情況下報告。 舉例而言,假設項目Ρ可自材科%及容量c製造。不 存在材料Μ之供應,且在第丨日供應容量义之5〇個單 位之。在此情況下,策略將提供兩個選擇以用於按時滿 足訂貨: ' : ... I在第1日項目Ρ之30個單位之供應… 201017576 2·在第1曰材料Μ之30個單位之供應。 若無法獲得項目Ρ之額外供應,意即,此項目僅可製 造且無法自外部採購,則使用者將僅標記材料Μ。在該 情況下’僅有之選擇將為增加材料Μ之供應^In an embodiment, the product is marked to move the additional supply (this is referred to as the internal buffer). In many cases, additional supplies can be configured at the intermediate and at the final project. In such cases, if the upstream component is marked by the job, the group should be in short supply. For the step-by-step description of the shortage report, an example is given now. In the following example, the order for 4 units of the project is due on the first day. The supply of 10 units can be obtained on the 1st day, and the supply of the Magic Unit can be obtained on the 5th day. The promise of ordering is the n solid units on the jth day and the 10 units on the 5th. When the demand implementation engine 212 executes this strategy, the order is promised (on the 1st day). In this case, there is only one selection, and this will only be reported if the item is marked. For example, assume that the project can be manufactured from the material % and the capacity c. There is no material supply, and 5 units of capacity are available on the next day. In this case, the strategy will provide two options for ordering on time: ' : ... I supply of 30 units on the first day of the project... 201017576 2·30 in the first material The supply of units. If the additional supply of the item is not available, meaning that the item can only be manufactured and cannot be purchased from outside, the user will only mark the material. In this case, the only choice would be to increase the supply of materials.

需求實現引擎212在計算ΑΤΡ短缺報告時首先嘗試盡 可能使用現存材料供應及資源(此稱為平衡步驟)。為解 釋平衡步驟,硯在給出一實例。在以下實例中,若項目 Ρ可自Μ及C製造。所有產品ρ、Μ及c為經標記緩衝 區,且P不具有供應。材料Μ及容量C處之供應如下所 不: •材料Μ :第2日之1〇姐單位 •谷量C :第1日之…1 〇個.單位 針對30.個單位之訂貨在,第$ η . a 炅隹弟5日到期。針對此情況之 ΑΤΡ短缺報告將如下(存在兩個選擇): •選擇1 : 〇第1日材料Μ之1 〇個單位之供應 〇第2日容量C之10個單位之供應 〇第5日材料Μ之10傭單位之供應 。第5日容量〇之10個單位之供應 .選擇2 : 第1日材料Μ之1 0個單位之供應 第2曰容量C之1〇個單位之供應 之供應 獲得前兩個供應短缺》此 〇第5曰項目ρ之20個單位 由於盡可能消耗現存供應, 201017576 等供應短缺是在計算所有其他選擇之前計算,且其對所 有選擇而言為共同的。 如上文論述’當藉由對產品進行標記而使供應可為彈 性的情況下識別產品時,此等產品稱為「經標記緩衝 區」。另外,此等產品亦可經識別,其中在限制之情況下 可使過量供應移動。在一實施例中,在產品根本模型處 產生使用者界定攔位(UDF )以儲存其是否經標記。產 品根本模型處之UDF是藉由在儲存於資料庫220中之項 目位點主體(Item Site Master )表中產生攔位來界定。 舉例而言’若此欄位為fie丨dl »藉由使用例如計劃腳本 中之以下OIL程式命令而使用爛位fieidl中之值設定經 標記緩衝區:The demand fulfillment engine 212 first attempts to use existing material supplies and resources whenever possible in the calculation of the shortage report (this is referred to as the balancing step). To explain the balancing steps, an example is given. In the following examples, if the project can be manufactured from C and C. All products ρ, Μ and c are labeled buffers and P does not have a supply. The supply of material Μ and capacity C is as follows: • Material Μ: 1st day 1 〇 sister unit • Valley C: 1st day... 1 .. Unit for 30. Units in order, $ η . a 炅隹 brother expires on the 5th. The shortfall report for this situation will be as follows (there are two options): • Option 1: 〇1st material Μ1 〇1 unit supply 〇2nd day capacity C 10 units of supply 〇5th day material The supply of 10 servants. Supply of 10 units of capacity on the 5th day. Option 2: Supply of 1 unit of material on the 1st day 2nd supply of 1 unit of capacity C 1 supply of supply of the first two supply shortages The 20 units of the 5th project ρ are consumed as much as possible, and the supply shortages such as 201017576 are calculated before all other options are calculated, and they are common to all choices. As discussed above, when a product is identified by marking the product, the product is referred to as a "marked buffer." In addition, such products may also be identified, where excess supply may be moved under restricted conditions. In one embodiment, a User Defined Intercept (UDF) is generated at the product base model to store whether it is flagged. The UDF at the product model is defined by generating a block in the Item Site Master table stored in the repository 220. For example, if the field is fie丨dl » set the marked buffer by using the value in the rotten fieidl using, for example, the following OIL program command in the plan script:

Supply_chains[l ]. sellers, for—each(#. product—roots .for _each( do( ❷ define(pro〇t, #), if(pro〇t.field 1, proot.set_marked_buffers(proot.fieldl)), ) )); 在另一實施例中,可藉由移動一組件之分配,且產生 另一組件之供應而解析BOM情況下之較晚且較短訂 ^ 另外’若已較早執行Rep〇rt_A】i〇cati〇n—shortage步 驟’則所有此尊情況均在Report—ATP_Sh〇rtage步驟中報 - · . . . . . . . . 1 · ------- -- -... . .. .. 21 201017576 告0 另夕卜’如上文論述,策略模型222包括上文論述之改 變中的-或多者’其中此等改變中之每—者是以其經界 定之順序應用。舉例而言’若策略包括放寬最小數量及 . 放寬報價倍數改變,則需求實現引擎212首先計算最小 裝運數量對訂貨之影響,且隨後將裝運批量在其最大值 處放寬。另外,原因及解析報告將—直藉由應用第一改 • 變’隨後-起應用第一及第二改變等等而提供承諾之改 良。此情形持續,直至需求實現引擎212執行策略中之 所有改變或訂貨經按時完全承諾為止(無論何者首先發 生)。 帛3圖圖示根據實施例之示範性系統则其包含用 於交付服務之兩個選擇’包括空中運輸模式31〇、及道路 運輸模式320。系統3〇〇包含位置」(L〇ei) 3i2a、位置 2(Loc2) 312b 及位置 3(L〇c3) 312c、分配中心 i(Dc〇 ❹ 3 i4a、分配中心2 ( DC2 ) 3 !朴及複數個交付路徑…儘 g展示及描述特定數目之位置、分配中心及交付路徑, • 但根據特定需要’實施例可涵蓋任何教目之位置、分配 中心及/或_交付路.徑_ 為進步解釋系統3〇〇之操作及分析,並解析系統300 中之較晚及較短訂貨問題之示範性工作流程現在給出 一實例。在以下實例中,Iteml在Locl 312a、LOC2 312b 及L〇C3 312c處可用。以下表1中展示Iteml之供應。 201017576 賣方 項目 位置 開始曰期 結束曰期 已分配 已消耗 可用 τ 項目 1 Loci 10/6/2007 10/7/2007 15 0 15 τ 項目 1 Loc2 10/5/2007 10/6/2007 15 0 15 τ 項目 1 Loc3 10/5/2007 10/6/2007 15 0 15 表1 下表2中展示Iteml對賣方S1及S2之分配。 賣方 項目 位置 開始曰期 結束日期 已分配 已消耗 可用 S1 項目 1 Loci 10/1/2007 10/8/2007 10 0 10 S2 項目 1 Loci 10/1/2007 10/8/2007 5 0 5 S1 項目 1 Loc2 10/1/2007 10/8/2007 10 0 10 S2 項目 1 Loc2 10/1/2007 10/8/2007 5 0 5 S1 項目 1 Loc3 10/1/2007 10/8/2007 10 0 10 S2 項目 1 Loc3 10/1/2007 10/8/2007 5 0 5 表2 在此實例中,訂貨為在2007年10月6曰到期之針對 在賣方S1處Iteml之60個單位的OrderOl-Iteml,其中 目的地為分配中心2 ( DC2) 314b。在此實例中,承諾政 策為AS AP,且以下屬性在項目請求上設定: 許可交付區:DC1 314a 許可交付源:Loc2 312b及Loc3 3 12c 許可交付服務:道路運輸模式320 許可匹配產品根本:Iteml::SKU::Loc3 由於許可交付區為DC 1 314a且目的地為DC2 314b, 因此交付之最後邊緣為DC 1 3 14a — DC2 3 14b。如上所 示,許可交付源及許可匹配產品根本限制了僅自 Loc3 3 12c之消耗,因此僅一個交付路徑是可能的:Loc3 312c —DC1 314a — DC2 314b。 23 201017576 繼續此實例,交付請求之最大邊緣的預設值為1,且 交付無法以具有 2個邊緣之交付路徑進行》因此, OrderOl-Iteml經完全縮短。 在此實例中之策略改變(上文描述)具有以相同順序 之以下步驟:Supply_chains[l ]. sellers, for—each(#. product—roots .for _each( do( ❷ define(pro〇t, #), if(pro〇t.field 1, proot.set_marked_buffers(proot.fieldl)) In another embodiment, the later and shorter orders of the BOM can be resolved by moving the allocation of one component and generating the supply of another component. If the Rep is executed earlier. rt_A] i〇cati〇n—shortage step' then all the cases are reported in the Report-ATP_Sh〇rtage step-- . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . As discussed above, the strategy model 222 includes one or more of the changes discussed above, wherein each of these changes is in its defined order. application. For example, if the strategy includes relaxing the minimum amount and relaxing the quote multiple change, the demand fulfillment engine 212 first calculates the impact of the minimum shipment quantity on the order and then relaxes the shipment lot at its maximum. In addition, the reason and analysis report will provide a commitment to improve directly by applying the first change, then applying the first and second changes, and so on. This situation continues until the demand fulfillment engine 212 performs all of the changes in the strategy or the order is fully committed on time (whichever occurs first). The Fig. 3 diagram illustrates an exemplary system in accordance with an embodiment which includes two options for delivering a service&apos; including an air transportation mode 31〇, and a road transportation mode 320. System 3 includes location "L〇ei" 3i2a, position 2 (Loc2) 312b, and position 3 (L〇c3) 312c, distribution center i (Dc〇❹ 3 i4a, distribution center 2 (DC2) 3 Multiple delivery paths... show and describe a specific number of locations, distribution centers, and delivery paths, but • depending on the specific needs, the embodiment can cover any location, distribution center, and/or _ delivery path. An exemplary workflow for interpreting the operation and analysis of the system and parsing the later and shorter ordering problems in system 300 now gives an example. In the following example, Iteml is in Locl 312a, LOC2 312b, and L〇C3. Available at 312c. The supply of Iteml is shown in Table 1. 201017576 The position of the seller's project begins at the end of the period. The period has been allocated and consumed. τ Item 1 Loci 10/6/2007 10/7/2007 15 0 15 τ Item 1 Loc2 10 /5/2007 10/6/2007 15 0 15 τ Item 1 Loc3 10/5/2007 10/6/2007 15 0 15 Table 1 The assignment of Iteml to sellers S1 and S2 is shown in Table 2 below. Period End Date Allocated Available S1 Item 1 Loci 10/ 1/2007 10/8/2007 10 0 10 S2 Project 1 Loci 10/1/2007 10/8/2007 5 0 5 S1 Project 1 Loc2 10/1/2007 10/8/2007 10 0 10 S2 Project 1 Loc2 10 /1/2007 10/8/2007 5 0 5 S1 Project 1 Loc3 10/1/2007 10/8/2007 10 0 10 S2 Project 1 Loc3 10/1/2007 10/8/2007 5 0 5 Table 2 Here In the example, the order is OrderOl-Iteml for 60 units of Iteml at the seller S1 due to expire on October 6, 2007, where the destination is Distribution Center 2 (DC2) 314b. In this example, the commitment policy is AS AP, and the following attributes are set on the project request: License Delivery Area: DC1 314a License Delivery Source: Loc2 312b and Loc3 3 12c License Delivery Service: Road Transportation Mode 320 License Matching Product Fundamentals: Iteml::SKU::Loc3 Due to License The delivery area is DC 1 314a and the destination is DC2 314b, so the final edge of the delivery is DC 1 3 14a - DC2 3 14b. As indicated above, the license delivery source and the license matching product simply limit the consumption only from Loc3 3 12c, so only one delivery path is possible: Loc3 312c - DC1 314a - DC2 314b. 23 201017576 Continuing with this example, the default edge of the delivery request has a default value of 1, and delivery cannot be done with a delivery path with 2 edges. Therefore, OrderOl-Iteml is completely shortened. The policy change (described above) in this example has the following steps in the same order:

1. RELAX, MAX_EDGES 2. RELAX一 PERMITTED, DELIVERY, ZONES 3. RELAX_ PERMITTED, MATCHING. —PRODUCTS 4. RELAX一 PERMITTED一 •DELIVERY— SOURCES 5. RELAX_ PERMITTED, DELIVERY— SERVICES 6. REPORT _ALLOCATION_SHORTAGE 7. REPORT ATP SHORTAGE 在此實例中,第一步驟放寬最大邊緣將在再承諾之後 針對較晚及較短項目執行》然而,由於在供應圖片中不 存在改變,因此再承諾將提供相同結果,意即,無承諾。 ❹/ 因此,_第一步驟是针.對:在:此實例_.中:H.OrderOl-Iteml之訂 貨提供之60個單位的數量,執行放寬最大邊緣… • 結果..·· On_time_q.ty......O late_qty... 10: .late—date..07-10-0.8 • short一qiy 50 API輸出如下: &lt;dfx: Strategy St epResult&gt; .. . - ..... .... &lt;dfx: Strategy St epName&gt; &lt;dfx:Value&gt;RELAX MAX EDGES&lt;/dfx:Value&gt; &lt;/dfx:StrategyStepName&gt; 24 201017576 &lt;dfx:PromiseInformation&gt; &lt;dfx: Promise Quantity OnTime Value=&quot;0&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt; &lt;dfx:PromiseQuantityLate Value=&quot; 10,,&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;dfx:PromiseQuantity Short Value = &quot;5 0&quot;&gt;&lt;/dfx:PromiseQuantity Short&gt; &lt;dfx: Late Date Value = &quot; 10/08/2007&quot;&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx: Strategy StepRe suit &gt; 如上所示,在放宽最大邊緣限制之後,Loc3 312c — DC1314a — DC2314b變為可能的交付路徑,且因此可 在S1處消耗Iteml::SKU::Loc3之分配之後,在第8日提 供10個單位數量之承諾。另外,由於許可交付服務限 制,交付DC 1 314a — DC2 314b之最後邊緣必須使用 φ 道路運輸模式320,其如第3圖中所示為2曰。然而,1. RELAX, MAX_EDGES 2. RELAX-PERMITTED, DELIVERY, ZONES 3. RELAX_ PERMITTED, MATCHING. —PRODUCTS 4. RELAX-PERMITTED-•DELIVERY— SOURCES 5. RELAX_ PERMITTED, DELIVERY— SERVICES 6. REPORT _ALLOCATION_SHORTAGE 7. REPORT ATP SHORTAGE In this example, the first step of relaxing the maximum edge will be performed for later and shorter items after the recommitment. However, since there is no change in the provisioning picture, the recommitment will provide the same result, meaning no commitment. ❹ / Therefore, the first step of _ is the needle. Pair: In: This example _. In the number of 60 units provided by the order of H.OrderOl-Iteml, perform the relaxation of the maximum edge... • Result..·· On_time_q.ty ...O late_qty... 10: .late—date..07-10-0.8 • short-qiy 50 API output is as follows: &lt;dfx: Strategy St epResult&gt; .. . - ..... .... &lt;dfx: Strategy St epName&gt;&lt;dfx:Value&gt;RELAX MAX EDGES&lt;/dfx:Value&gt;&lt;/dfx:StrategyStepName&gt; 24 201017576 &lt;dfx:PromiseInformation&gt;&lt;dfx: Promise Quantity OnTime Value =&quot;0&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt;&lt;dfx:PromiseQuantityLateValue=&quot;10,,&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;dfx:PromiseQuantity Short Value = &quot;5 0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx: Late Date Value = &quot;10/08/2007&quot;&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx: Strategy StepRe suit &gt; As shown above, after relaxing the maximum edge limit, Loc3 312c - DC1314a - DC2314b becomes a possible delivery path, and thus After the allocation of Iteml::SKU::Loc3 is consumed at S1, a commitment of 10 units is provided on the 8th day. In addition, due to the license delivery service limitation, the final edge of the delivery DC 1 314a - DC2 314b must use the φ road transport mode 320, which is 2曰 as shown in Figure 3. however,

Loc3 312c -&gt; ΓΚΠ 314A可使用第3圖中所示之空中運 ' 輸模式310,其為較木耗時之服務且僅耗費1日。因此, • 總交付時間為3日。L〇c3 3 12c處之供應在第5日可用, . ... ....... .. . . 且因此在3日之後(意即,在第8日)提供承諾。 繼續此實例,下一步驟是針對來自先前步驟之較晚及 較短項目執行放寬許可交付區,該項目再次為60個單位 . .. .. . ...... .. ... ..... (意即,10個較晚及50個較短)。 .. .. . : : 結果:〇n_time_qty Ό. late_qty· 10:.late_dat.e 07-10-07 . . . 1 . ... ........ ..... ........ .: ....... ... 25 . . . 201017576 short_qty 50 API輸出如下: &lt;dfx: Strategy Step Re suit〉 &lt;dfx:StrategyStepName&gt;, &lt;dfx:Value&gt;RELAX_PERMITTED DELIVERY ZONES&lt;/dfx: Value〉 &lt;/dfx:StrategyStepName&gt; &lt;dfx:PromiseInformation&gt;Loc3 312c -&gt; ΓΚΠ 314A can use the air transport mode 310 shown in Fig. 3, which is a more time-consuming service and only takes 1 day. Therefore, • The total delivery time is 3 days. The supply at L〇c3 3 12c is available on the 5th day, . . . . . . . . . and therefore the commitment is provided after 3 days (ie, on the 8th day). Continuing with this example, the next step is to implement a relaxed license delivery area for the later and shorter items from the previous step, which is again 60 units. . . . . . . . . . . .... (meaning, 10 are late and 50 are shorter). .. .. . : : Result: 〇n_time_qty Ό. late_qty· 10:.late_dat.e 07-10-07 . . . 1 . ... ........ ..... ... ..... .: ....... ... 25 . . . 201017576 short_qty 50 The API output is as follows: &lt;dfx: Strategy Step Re suit〉 &lt;dfx:StrategyStepName&gt;, &lt;dfx:Value&gt; RELAX_PERMITTED DELIVERY ZONES&lt;/dfx: Value〉 &lt;/dfx:StrategyStepName&gt;&lt;dfx:PromiseInformation&gt;

&lt;dfx:PromiseQuantityOnTime Valu e = &quot;0',x/dfx: Promise Quantity OnTime&gt; &lt;dfx:PromiseQuantityLate Value=&quot; 10&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;dfx:PromiseQuantity Short Value = &quot;5 0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDate&lt;dfx:PromiseQuantityOnTime Valu e = &quot;0',x/dfx: Promise Quantity OnTime&gt;&lt;dfx:PromiseQuantityLateValue=&quot;10&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;dfx:PromiseQuantity Short Value = &quot ;5 0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate

Value = &quot;10/07/2007,,&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx: Strategy Step.Res.ult&gt; 如上所示,在放寬許可交付區限制之後’ 2個交付路 徑是可能的,一個交付路徑在先前步驟中展示,且第二 交付路徑為使用道路運輸模式320之Loc3 312c — DC2 3 14b,其如第3圖中所示為2日。在此實例中給定後者 為較佳,因為其耗費較少交付時間,意即,2曰。因此, 先前步驟中提供之承諾現在可提前1日(意即,在第7 -2β ::;; 201017576 日)提供。 繼續此實例,下一步驟是針對來自先前步驟之較晚及 較短項目執行放寬許可匹配產品,該項目再次為60個單 位。 .結果:On_time_qty 0 late—qty..20 late_date. .07-10-07 .short_qty 40 . .. API輸出如下: &lt;dfx: Strategy StepResult&gt; ❿ &lt;dfx:StrategyStepName&gt;Value = &quot;10/07/2007,,&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx: Strategy Step.Res.ult&gt; As shown above, after relaxing the license delivery area limit 'Two delivery paths are possible, one delivery path is shown in the previous step, and the second delivery path is Loc3 312c - DC2 3 14b using road transport mode 320, which is 2 days as shown in FIG. The latter is preferred in this example because it consumes less delivery time, meaning 2 曰. Therefore, the commitments provided in the previous steps can now be provided one day in advance (ie, on the 7th - 2β ::;; 201017576). Continuing with this example, the next step is to perform a relaxed license matching product for the later and shorter items from the previous step, which is again 60 units. Result: On_time_qty 0 late—qty..20 late_date. .07-10-07 .short_qty 40 . . . The API output is as follows: &lt;dfx: Strategy StepResult&gt; ❿ &lt;dfx:StrategyStepName&gt;

&lt;dfx:Value&gt;RELAX_PERMITTED_MATCHING_PRODU CTS&lt;/dfx:Value&gt; &lt;/dfx: Strategy StepName&gt; &lt;d fx: Promis el n formation〉 &lt;dfx:PromiseQuantityOnTime 參 Value = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt; &lt;dfx:PromiseQuantityLa1;e:&lt;dfx:Value&gt;RELAX_PERMITTED_MATCHING_PRODU CTS&lt;/dfx:Value&gt;&lt;/dfx: Strategy StepName&gt;&lt;d fx: Promis el n formation〉 &lt;dfx:PromiseQuantityOnTime Parameter Value = &quot;0&quot;&gt;&lt;/dfx :PromiseQuantityOnTime&gt;&lt;dfx:PromiseQuantityLa1;e:

Value = &quot;20&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; . . ... . .... - &lt;dfx: Promise Quantity Short '..... :..... ... .... .........Value = &quot;20&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; . . . . .... - &lt;dfx: Promise Quantity Short '..... :..... ... .. .. .........

Value = &quot;40&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDate . . . . . .... . * . . .Value = &quot;40&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate . . . . . .. . * . . .

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx: StrategyStepResult&gt; . . ...... . . . :..27 ...... 201017576 如上所示,在放寬許可匹配產品根本限制之後,在Loc2 312b處10個單位之供應亦可消耗(在Loci 312a處之供 ' . . . 應由於許可交付源限制而仍無法消耗)。Loc2 312b及 .Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx:StrategyStepResult&gt; . . . . . . . :..27 .. .... 201017576 As indicated above, the supply of 10 units at Loc2 312b may also be consumed after the relaxation of the license-matched product's fundamental limit (at Loci 312a). . . . Consumption). Loc2 312b and .

Loc3 312c具有類似交付網路,且因此採用類似交付路徑 (Loc2 312b — DC2 314b)。先前步驟中提供之承諾改 良10個單位之數量,且總共20個單位之承諾現可在第 7日提供。 繼續此實例,下一步驟是針對來自先前步驟之較晚及 Φ 較短項目執行放寬許可交付源,該項目再次為60個單 位。 結果:On_time_qty 0 late_qty 30 late_date 07-10-08 short qty 30 API輸出如下: &lt;dfx: Strategy StepResult&gt; &lt;dfx:StrategySt;epName&gt;. ❹ &lt;dfx:Value&gt;RELAX_PERMITTED_DELIVERY_SO URCES&lt;/dfx: Value〉 - &lt;/.dfx:StrategyStep.Name&gt;: ........ &lt;dfx:PromiseInformation&gt; &lt;dfx:ProrniseQuantityOnTime Value = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityOiiTime&gt; .&lt;dfx:PromiseQuantityLate Value=&quot; 3 0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; 28 201017576 &lt;(ifx: Promise Quantity Short Value = &quot; 3 0&quot;&gt;&lt;/dfx: Promise Quantity Short&gt; &lt;dfx:LateDate . . ' .. . ·The Loc3 312c has a similar delivery network and therefore uses a similar delivery path (Loc2 312b - DC2 314b). The commitments provided in the previous steps have improved the number of 10 units and a total of 20 units of commitments are now available on the 7th day. Continuing with this example, the next step is to perform a relaxed license delivery source for the later and Φ shorter items from the previous step, which is again 60 units. Result: On_time_qty 0 late_qty 30 late_date 07-10-08 short qty 30 The API output is as follows: &lt;dfx: Strategy StepResult&gt;&lt;dfx:StrategySt;epName&gt;. ❹ &lt;dfx:Value&gt;RELAX_PERMITTED_DELIVERY_SO URCES&lt;/dfx: Value〉 - &lt;/.dfx:StrategyStep.Name&gt;: ........ &lt;dfx:PromiseInformation&gt;&lt;dfx:ProrniseQuantityOnTime Value = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityOiiTime&gt;.&lt;dfx :PromiseQuantityLate Value=&quot; 3 0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; 28 201017576 &lt;(ifx: Promise Quantity Short Value = &quot; 3 0&quot;&gt;&lt;/dfx: Promise Quantity Short&gt;&lt;dfx: LateDate . . ' .. .

Value=&quot;l 0/08/200 7 &quot;&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx:StrategyStepResult&gt; 如上所示’在放寬許可交付源限制之後,Loci 312a 處之10個單位之供應亦.可消耗。Loc 1 3 12a &gt; Loc2 3 12b 及Loc3 3 12c具有類似交付網路,且因此採用類似交付 路徑(Loci 312a — DC2 314B)。由於 Locl 312a 處之 供應在第6日可用’因此來自Loci 312a之承諾可在第8 曰提供(交付時間為2日)。 為報告之目的’在最後承諾日期集合且展示所有較晚 承諾數量。因此,30個單位之承諾現可在第8日提供。 繼續此實例,下一步驟是針對來自先前步驟之較晚及 較短項目執行放寬許可交付服務,該項目再次為6〇個單 位〆 .. ... ' . .. .... . .... 結果:Onjime—qty 20 late—qty 10 late—date 〇7_1〇_〇7 short qty 30 API輸出如下: &lt;dfx:StrategyStepResult&gt; &lt;dfx: Strategy Si epName〉 29 201017576Value=&quot;l 0/08/200 7 &quot;&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx:StrategyStepResult&gt; As shown above 'After relaxing the license delivery source limit, Loci 312a The supply of 10 units is also available. Loc 1 3 12a &gt; Loc2 3 12b and Loc3 3 12c have similar delivery networks and therefore adopt a similar delivery path (Loci 312a - DC2 314B). Since the supply at Locl 312a is available on the 6th day, the commitment from Loci 312a is available at 8th (delivery time is 2 days). For reporting purposes, 'collect and display all late promised quantities on the last commitment date. Therefore, the commitment of 30 units is now available on the 8th day. Continuing with this example, the next step is to perform a relaxed license delivery service for later and shorter projects from the previous steps, which is again 6 units 〆.. ... ' . .. .... . . . .. Result: Onjime-qty 20 late-qty 10 late-date 〇7_1〇_〇7 short qty 30 API output is as follows: &lt;dfx:StrategyStepResult&gt;&lt;dfx: Strategy Si epName〉 29 201017576

&lt;dfx:Value&gt;RELAX_PERMlTTED_DELIVERY_SE RVICES&lt;/dfx:Value&gt; . . &lt;/dfx: Strategy StepName&gt;·.... &lt;dfx:PromiseInformation&gt; &lt;dfx: Promise Quantity OnTime&lt;dfx:Value&gt;RELAX_PERMlTTED_DELIVERY_SE RVICES&lt;/dfx:Value&gt; . . &lt;/dfx: Strategy StepName&gt;·.... &lt;dfx:PromiseInformation&gt;&lt;dfx: Promise Quantity OnTime

Val ue =&quot; 2 0&quot; &gt;&lt;/dfx: Promise Quant ityOnTime&gt; &lt;dfx:PromiseQuantityLateVal ue =&quot; 2 0&quot;&gt;&lt;/dfx: Promise Quant ityOnTime&gt;&lt;dfx:PromiseQuantityLate

Value=&quot; 1 0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;dfx: Promise Quantity ShortValue=&quot; 1 0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;dfx: Promise Quantity Short

Value=&quot;30&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDateValue=&quot;30&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate

Value = ,,10/07/2007,,x/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx: Strategy St epRe suit〉. φ 如上所示,在放寬許可交付服務限制之後,第3圖中 所示之空中運輸模式3 10為較不耗時之服務且將減少至 - 1日。Loc2 3 12b及Loc3 312c現在可提供第6日之按時 • 承諾(在第5日供應),而Loci 312a將仍提供第7日之 ' . . ... ....... . ...... 較晚承諾(在第6日供應)。 繼續此實例,下一步驟是針對來自先前步驟之較晚及 ..... . . 較短項目執行報告分配短缺,該項目現在為40個單位。 . ... .... . ... .. . 結果:On_time_qty 10. late_qty 15 late_date 07-10-07 201017576 針對產品要求之分配 Iteml::SKU::Loc2-Sl::Level2 onValue = ,,10/07/2007,,x/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx: Strategy St epRe suit〉. φ As shown above, after relaxing the license delivery service limit, the third The air transport mode 3 10 shown in the figure is a less time consuming service and will be reduced to -1 day. Loc2 3 12b and Loc3 312c are now available on time 6 • Commitment (supplied on day 5), while Loci 312a will still provide the 7th day ' . . . . . . . ..... late promise (supply on the 6th day). Continuing with this example, the next step is to allocate a shortfall for the project execution report from the later steps of the previous step and ..... . The project is now 40 units. . . . . . . . . . Result: On_time_qty 10. late_qty 15 late_date 07-10-07 201017576 Assignment to product requirements Iteml::SKU::Loc2-Sl::Level2 on

FE Start Date 07-10-01 for Qty 5 Is_On_Time TRUE 針對產品要求之分配 Iteml::SKU::Loe3-Sl::Level2 on FE Start Date 07-10-01 for Qty 5 Is_On_Time TRUE 針對產品要求之分配 Iteml::SKU::Locl-Sl::Level2 onFE Start Date 07-10-01 for Qty 5 Is_On_Time TRUE Assignment for Product Requirements Iteml::SKU::Loe3-Sl::Level2 on FE Start Date 07-10-01 for Qty 5 Is_On_Time TRUE Assignment for Product Requirements Iteml ::SKU::Locl-Sl::Level2 on

FE Start Date 07-10-01 for Qty 5 Is On Time FALSE API輸出如下:FE Start Date 07-10-01 for Qty 5 Is On Time The FALSE API output is as follows:

❹ &lt;dfx: Strategy StepRe suit〉 &lt;dfx: Alloc at ionReport&gt; &lt;dfx: AllocationNeeded&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value=&quot;Item 1 &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:PrDductLocation .. . .... ... . ... ...❹ &lt;dfx: Strategy StepRe suit〉 &lt;dfx: Alloc at ionReport&gt;&lt;dfx:AllocationNeeded&gt;&lt;dfx:Product&gt;&lt;dfx:ItemValue=&quot;Item 1 &quot;&gt;&lt;/dfx:Item&gt ; &lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:PrDductLocation .. . .... ... . ... ...

Value: &quot;Ι^.οο2&quot;&gt;&lt;/(!£χ:ΡΓ〇άιΐί^Ι/ο cation〉:':: . ... . . . . .... &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; ' &lt;d.fx:.:Selle.rName Value = &quot; S 1 &quot;&gt;&lt;/dfx: SellerName&gt; &lt;dfx: SellerLevelValue: &quot;Ι^.οο2&quot;&gt;&lt;/(!£χ:ΡΓ〇άιΐί^Ι/ο cation>:':: . . . . . . .... &lt;/dfx:Product&gt ; &lt;dfx:Seller&gt; ' &lt;d.fx:.:Selle.rName Value = &quot; S 1 &quot;&gt;&lt;/dfx: SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2 &quot;&gt;&lt;7 dfx: SellerLevel&gt; &lt;/dfx:Seller&gt; . .' . . .. ' &lt;dfx:ForecastBucket&gt; 31 201017576Value = &quot;Level2 &quot;&gt;&lt;7 dfx: SellerLevel&gt;&lt;/dfx:Seller&gt; . .' . . .. ' &lt;dfx:ForecastBucket&gt; 31 201017576

Value: &lt;dfx: StartDate = &quot;10/01/2007,,&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDate Value: =&quot;10/0 8/200 7&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx:ForecastBucket&gt; &lt;dfx: Short age QtyValue: &lt;dfx: StartDate = &quot;10/01/2007,,&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate Value: =&quot;10/0 8/200 7&quot;&gt;&lt;/dfx :EndDate&gt;&lt;/dfx:ForecastBucket&gt;&lt;dfx: Short age Qty

Value = &quot;5&quot;&gt;&lt;/dfx:ShortageQty&gt;Value = &quot;5&quot;&gt;&lt;/dfx:ShortageQty&gt;

Value: &lt;dfx:OnTime = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: AllocationNeeded&gt; &lt;dfx: AllocationNeeded&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Item 1 &quot;&gt;&lt;/dfx:Item〉 &lt;dfx:ProductLevel Value: = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx: Pro duct Location Value: = &quot;Loc3 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx: SellerName Value: = &quot;Sr'x/dfx:SellerName&gt; &lt;dfx: Sell er LevelValue: &lt;dfx:OnTime = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:AllocationNeeded&gt;&lt;dfx:AllocationNeeded&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;Item 1 &quot;&gt;&lt;/dfx:Item〉 &lt;dfx:ProductLevel Value: = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx: Pro duct Location Value: = &quot;Loc3 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx: SellerName Value: = &quot;Sr'x/dfx:SellerName&gt;&lt;dfx: Sell er Level

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller〉 32 201017576 &lt;dfx: Fore castBu eke t&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller> 32 201017576 &lt;dfx: Fore castBu eke t&gt;&lt;dfx: StartDate

Value = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot; 10/0 8/200 7 &quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx:ForecastBucket&gt; &lt;dfx: Short age Qty Value=&quot;5&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTimeValue = &quot; 10/0 8/200 7 &quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ForecastBucket&gt;&lt;dfx: Short age Qty Value=&quot;5&quot;&gt;&lt;/dfx:ShortageQty&gt ; &lt;dfx:OnTime

Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: AllocationNeeded&gt; &lt;dfx: Alio cat ionNeeded&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Item 1 &quot;&gt;&lt;/dfx:Item〉 &lt;dfx:ProductLevel 馨 Value=&quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx: Pro ductLo cation Value=&quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt; - &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx: SellerName Value:&quot; S 1 ”&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:AllocationNeeded&gt;&lt;dfx: Alio cat ionNeeded&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;Item 1 &quot;&gt ;&lt;/dfx:Item〉 &lt;dfx:ProductLevel 馨Value=&quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx: Pro ductLo cation Value=&quot;Locl &quot;&gt;&lt;/dfx: ProductLocation&gt; - &lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx: SellerName Value:&quot; S 1 ”&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; 33 201017576 &lt;/dfx: Seller〉 &lt;dfx:ForecastBucket&gt; &lt;dfx:StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; 33 201017576 &lt;/dfx: Seller〉 &lt;dfx:ForecastBucket&gt;&lt;dfx:StartDate

Value = &quot;10/01/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/01/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot; 10/0 8/2007 &quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx:ForecastBucket&gt; &lt;dfx:ShortageQtyValue = &quot; 10/0 8/2007 &quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ForecastBucket&gt;&lt;dfx:ShortageQty

Value = &quot; 5&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTimeValue = &quot;5&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTime

Value = &quot;FALSE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: AllocationNeeded&gt; &lt;/dfx:AllocationReport&gt; &lt;dfx: Strategy StepName&gt;Value = &quot;FALSE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:AllocationNeeded&gt;&lt;/dfx:AllocationReport&gt;&lt;dfx: Strategy StepName&gt;

φ &lt;dfx:Value&gt;REPORT_ALLOCATION_SHORTAGE &lt;/dfx: Value〉 &lt;/dfx: Strategy StepName&gt; - &lt;dfx:PromiseInformation&gt; &lt;dfx:PromiseQuantityOnTime Value = &quot;10&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt; &lt;dfx:PromiseQuantityLate Valuer&quot; 1 5 &quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; 34 201017576 &lt;dfx:PromiseQuantity Short Value = &quot;15&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDateφ &lt;dfx:Value&gt;REPORT_ALLOCATION_SHORTAGE &lt;/dfx: Value〉 &lt;/dfx: Strategy StepName&gt; - &lt;dfx:PromiseInformation&gt;&lt;dfx:PromiseQuantityOnTime Value = &quot;10&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt;&lt;dfx:PromiseQuantityLateValuer&quot; 1 5 &quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; 34 201017576 &lt;dfx:PromiseQuantity Short Value = &quot;15&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate

Value = &quot; 1 0/07/200 7&quot;&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx: Strategy StepResult&gt; 如上所示,報告分配短缺步驟提供仍無法消耗但可在 某些移動分配步驟之後使用的任何剩餘供應。另外,報 馨 告分配短缺步驟亦提供一特定移動分配步驟將添加到按 時承諾或較晚承諾。請注意,其僅提供移動分配步驟之 ‘to_seller’ 資訊,且不提供 ‘ from_seller’ 資訊,例 如,此處其提供:對於Iteml::SKU::Loc2,5個單位之數 量‘在某個賣方處’仍可用,但需要分配至Sl::Level2 以改良按時承諾;對於Iteml::SKU::Loc3情況相同。類 似地,對於Iteml::SKU::Loc3,5個單位之數量‘在某個 φ 賣方處’仍可用,但需要分配至Sl::Level2以改良較晚 承諾。 •繼續此實例,下一步驟是針對來自先前步驟之較晚及 -較短項目執行報告ATP短缺,該項目現在為30個單位。 結果:On_time_qty 30 late_qty 0 late date -------- short_qty 0 ATP選擇數目-1Value = &quot; 1 0/07/200 7&quot;&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx: Strategy StepResult&gt; As shown above, the report allocation shortage step is still not available but can be consumed Any remaining supply used after some mobile allocation steps. In addition, the Reporting Shortage Assignment step also provides a specific mobile allocation step that will be added to the on-time commitment or later commitment. Please note that it only provides the 'to_seller' information for the mobile assignment step and does not provide 'from_seller' information, for example, here it is provided: For Iteml::SKU::Loc2, the number of 5 units 'at a seller 'Also available, but needs to be assigned to Sl::Level2 to improve on-time commitment; the same is true for Iteml::SKU::Loc3. Similarly, for Iteml::SKU::Loc3, the number of 5 units ‘is still available at a certain φ seller', but needs to be assigned to Sl::Level2 to improve the late promise. • Continuing with this example, the next step is to report an ATP shortage for the late and shorter project execution from the previous step, which is now 30 units. Result: On_time_qty 30 late_qty 0 late date -------- short_qty 0 ATP selection number -1

Atp Qty Needed 30 For Product Item 1:: SKU: :Loc3 on ATP Bucket Start Date 07-10-05 Is On Time TRUE 35 201017576 API輸出如下: &lt;dfx: Strategy St epResult&gt; &lt;dfx: ATP Report〉 &lt;dfx: ATPShortageOption&gt; &lt;dfx: ATP ShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:ItemAtp Qty Needed 30 For Product Item 1:: SKU: :Loc3 on ATP Bucket Start Date 07-10-05 Is On Time TRUE 35 201017576 The API output is as follows: &lt;dfx: Strategy St epResult&gt;&lt;dfx: ATP Report〉 &lt ;dfx: ATPShortageOption&gt;&lt;dfx: ATP ShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item

Value=&quot;Iteml&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevelValue=&quot;Iteml&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel

Value=&quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocationValue=&quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation

Value=&quot;Loc3 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx: SellerName ❹ Value=&quot;S 1 &quot;&gt;&lt;/dfx: SellerName&gt; &lt;dfx:SellerLevel . Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; - &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue=&quot;Loc3 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx: SellerName ❹ Value=&quot;S 1 &quot;&gt;&lt;/dfx: SellerName&gt;&lt;dfx:SellerLevel . Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; - &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/05/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/05/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/06/2007&quot;&gt;&lt;/dfx:EndDate&gt; 36 201017576 &lt;/dfx: ATP Bucket〉 &lt;dfx: Short age QtyValue = &quot;10/06/2007&quot;&gt;&lt;/dfx:EndDate&gt; 36 201017576 &lt;/dfx: ATP Bucket〉 &lt;dfx: Short age Qty

Value=&quot;3 0&quot;&gt;&lt;/dfx: Shortage Qty&gt; &lt;dfx:OnTimeValue=&quot;3 0&quot;&gt;&lt;/dfx: Shortage Qty&gt;&lt;dfx:OnTime

Value:&quot; TRUE &quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Short age Requirement〉 &lt;/dfx: ATP Shortage Opt ion&gt;Value:&quot; TRUE &quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Short age Requirement〉 &lt;/dfx: ATP Shortage Option&gt;

&lt;/dfx: ATP Report〉 &lt;dfx:StrategyStepName&gt; &lt;dfx:Value&gt;REPORT ATP SHORTAGE&lt;/dfx:Valu &lt;/dfx: Strategy St epName&gt; &lt;dfx:PromiseInformation&gt;&lt;/dfx: ATP Report> &lt;dfx:StrategyStepName&gt;&lt;dfx:Value&gt;REPORT ATP SHORTAGE&lt;/dfx:Valu &lt;/dfx: Strategy St epName&gt;&lt;dfx:PromiseInformation&gt;

&lt;dfx:PromiseQuantityOnTime Value = &quot;3 0&quot;&gt;&lt;/dfx - Promise Quant ityOnTime&gt; &lt;dfx:PromiseQuantityLate&lt;dfx:PromiseQuantityOnTime Value = &quot;3 0&quot;&gt;&lt;/dfx - Promise Quant ityOnTime&gt;&lt;dfx:PromiseQuantityLate

Value = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;dfx: Promise Quantity ShortValue = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;dfx: Promise Quantity Short

Value = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDateValue = &quot;0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate

Value = &quot; &quot;&gt;&lt;/dfx: Late Date〉 &lt;/dfx:PromiseInformation&gt; &lt;/dfx: Strategy St epResult&gt; 37 201017576 如上所示,可承諾可用短缺步驟之報告考慮 ‘marked-buffer’概念以減少CTP情形中之選擇數目〇 marked-buffer經設m的任何產品僅考慮為可用 於採購更多供應。 在此情況下,所有3個產品Iteml::SKu::L〇ci、Value = &quot;&quot;&gt;&lt;/dfx: Late Date〉 &lt;/dfx:PromiseInformation&gt;&lt;/dfx: Strategy St epResult&gt; 37 201017576 As shown above, you can commit to the report of available shortage steps to consider 'marked-buffer 'Concept to reduce the number of choices in the CTP scenario. Any product with a marked-buffer set m is only considered to be available for purchasing more supplies. In this case, all 3 products Iteml::SKu::L〇ci,

Iteml::SKU::Loc2 ^ Iteml ::SKU::Loc3 ^ marked_buffer 設定為‘真,。因此,可能存在3個可承諾(Ατρ)選 ❿ 擇用於將以30㈣承諾改良―在第5曰採購Iteml::SKU::Loc2 ^ Iteml ::SKU::Loc3 ^ marked_buffer is set to ‘true,. Therefore, there may be three promises (Ατρ) choices that will be used to improve on 30 (four) commitments - in the fifth purchase

Iteml::SKU::Locl ^ Iteml ::SKU::Loc2 或 Iteml::SKU::Loc3之30個單位之數量。 對於 item一request.matching_f〇recasts 清單中之預報, -----首先尋找該預報及其BOM,且決定所有可能的ATp 選擇。另外,即使存在某種較晚及/或較短,則_____僅 到達下一預報以進一步評估。然而,當關於該預報已按 時實現承諾時,___一一將不到達下一預報。 • 在此實例中,item-request.matChing_forecasts 清單中 之恰好為Iteml::SKU::L〇c3,其本身之第一預報能夠按 _ 時實現承諾,因此在此實例中,不評估清單中之其他預 . 報且僅展未一個選擇。 . . - .' ...... . - . 第4圖圖示根據一實施例之示範性位置4〇〇。位置4〇〇 包括組件 1 ( Compl ) 4〇2a、組件 2 ( Comp2) 4〇2b、組 件 3 ( Comp3 ) 402c、組件 4 ( Comp4 ) 402ci、緩衝區 404a、 404b及4l〇、中間容量!( CapIintl ) 4〇6a、十間容量2 (Caplint2 ) 400b、交替中間組件 j ( Aitintl ) 4〇8a、中 201017576 間組件1 ( Inti ) 408b、中間組件2 ( Int2 ) 408c、交替 中間組件 2 ( Altlnt2) 408d、成品容量 1 ( CapFGl ) 412、 成品1 ( FG1 ) 414以及交替成品1 ( AltFGl ) 416。儘管 展示及描述特定數目之組件、緩衝區、中間容量、交替 中間組件、中間組件、成品容量、成品及/或交替成品, 但根據特定需要,實施例可涵蓋任意數目之組件、緩衝 區、中間容量、交替中間組件、中間組件、成品容量、 成品及/或交替成品。 為進一步解釋位置400之操作及分析並解析位置400 中之較晚及較短訂貨問題之示範性工作流程,現在給出 一實例。在以下實例中,下表3中展示成品(FG1 )項 目之供應 賣方 項目 位置 開始曰期 結束曰期 已分配 已消耗 可用 T FG1 Loci 10/10/2007 10/11/2007 15 0 50 T FG1 Loci 10/15/2007 10/16/2007 10 0 10 表 另外,下表4中展示FG1向賣方S1及S2之分配。 賣方 項目 位置 開始曰期 結束日期 已分配 已消耗 ATP S1 FG1 Loci 10/8/2007 10/15/2007 40 0 40 S2 FG1 Loci 10/8/2007 10/15/2007 10 0 10 S1 FG1 Loci 10/15/2007 10/22/2007 10 0 10Iteml::SKU::Locl ^ Iteml ::SKU::Loc2 or Iteml::SKU::Loc3 The number of 30 units. For the forecast in the item-request.matching_f〇recasts list, ----- first look for the forecast and its BOM, and determine all possible ATp choices. In addition, even if there is some sort of later and/or shorter, _____ only reaches the next forecast for further evaluation. However, when the commitment has been fulfilled on time, the ___ one will not reach the next forecast. • In this example, the item-request.matChing_forecasts list happens to be Iteml::SKU::L〇c3, and its first forecast can fulfill the promise by _, so in this example, it is not evaluated in the list. Other pre-reports and only one choice. . . - . . . . - Figure 4 illustrates an exemplary position 4 根据 according to an embodiment. Location 4〇〇 includes component 1 (Compl) 4〇2a, component 2 (Comp2) 4〇2b, component 3 (Comp3) 402c, component 4 (Comp4) 402ci, buffers 404a, 404b, and 4l, intermediate capacity! (CapIintl) 4〇6a, ten capacity 2 (Caplint2) 400b, alternating intermediate component j (Aitintl) 4〇8a, medium 201017576 component 1 (Inti) 408b, intermediate component 2 (Int2) 408c, alternating intermediate component 2 ( Altlnt2) 408d, Finished Capacity 1 (CapFGl) 412, Finished 1 (FG1) 414, and Alternate Finished 1 (AltFGl) 416. Although a particular number of components, buffers, intermediate capacities, alternate intermediate components, intermediate components, finished product capacities, finished products, and/or alternate finished products are shown and described, embodiments may encompass any number of components, buffers, intermediates, depending on particular needs. Capacity, alternating intermediate components, intermediate components, finished product capacity, finished products and/or alternate finished products. To further explain the operation of location 400 and an exemplary workflow for analyzing and resolving later and shorter ordering issues in location 400, an example is now given. In the following example, the supplier of the finished product (FG1) project shown in Table 3 below is started at the end of the period. The period has been allocated and consumed. T FG1 Loci 10/10/2007 10/11/2007 15 0 50 T FG1 Loci 10/15/2007 10/16/2007 10 0 10 Table In addition, the allocation of FG1 to sellers S1 and S2 is shown in Table 4 below. The position of the seller's project begins. The end date has been allocated. The consumed ATP S1 FG1 Loci 10/8/2007 10/15/2007 40 0 40 S2 FG1 Loci 10/8/2007 10/15/2007 10 0 10 S1 FG1 Loci 10/ 15/2007 10/22/2007 10 0 10

表4 . 在此實例中,訂貨為在2007年10月8日到期之針對 在賣方S1處FG1之170個單位的OrderOl-FGl-Locl, 且承諾政策為ASAP。然而在此實例中,不存在'任何按時 承諾,僅將提供兩個較晚承諾,第10日之40個單位及 第1 5日之10個單位,且剩餘120個單位將縮短。 39 201017576 在此實例中之策略改變(上文描述)具有以相同順序 之以下步驟:Table 4. In this example, the order is OrderOl-FGl-Locl for 170 units of FG1 at the seller S1 due on October 8, 2007, and the commitment policy is ASAP. However, in this example, there is no 'on-time commitment, only two later commitments will be provided, 40 units on the 10th day and 10 units on the 15th, and the remaining 120 units will be shortened. 39 201017576 The policy change (described above) in this example has the following steps in the same order:

1. REPORT_ALLOCATION 一 SHORTAGE1. REPORT_ALLOCATION one SHORTAGE

2. REPORT_ATP_SHORTAGE 在此實例中,第一步驟報告分配短缺在再承諾之後針 對較晚及較短項目執行。然而,由於在供應圖片中不存 在改變,因此再承諾將提供相同結果,意即,無承諾。 因此,第一步驟是針對在此實例中以OrderOl-FGl-Locl 之訂貨提供之1 70個單位的數量執行報告分配短缺。 結果:On_time_qty 0 late_qty 60 late_date 07-10-15 short_qty 110 針對產品要求之分配 FGl::SKU::Locl-Sl::_Level2 on FE Start Date 07-10-08 for Qty 10 Is_On_Time FALSE API輸出如下: &lt;dfx:StrategyStepResult&gt; * . . . . ❿:. &lt;dfx: AllocationReport&gt; - 圓 &lt;dfx: AllocationNeeded&gt; ... . ... . . .. . ' • &lt;dfx:Product&gt; .... .. . . .... .... - &lt;dfx:Item Value = &quot;FGl &quot;&gt;&lt;/dfx:Item&gt; ' ... ' ' .. .. .... · . . ..... .... &lt;dfx:ProductLevel . ' ...2. REPORT_ATP_SHORTAGE In this example, the first step reports that the allocation shortage is performed after the recommitment for the later and shorter items. However, since there is no change in the supply picture, the recommitment will provide the same result, meaning no commitment. Therefore, the first step is to perform a report allocation shortage for the number of 1 70 units provided in the order of OrderOl-FGl-Locl in this example. Result: On_time_qty 0 late_qty 60 late_date 07-10-15 short_qty 110 Assignment for product requirements FGl::SKU::Locl-Sl::_Level2 on FE Start Date 07-10-08 for Qty 10 Is_On_Time FALSE API output is as follows: &lt ;dfx:StrategyStepResult&gt; * . . . . ❿:. &lt;dfx: AllocationReport&gt; - Circle&lt;dfx: AllocationNeeded&gt; ... . . . . . . . ' • &lt;dfx:Product&gt; ... . . . . . .... .... - &lt;dfx:Item Value = &quot;FGl &quot;&gt;&lt;/dfx:Item&gt; ' ... ' ' .. .. .... . . ... .... &lt;dfx:ProductLevel . ' ...

Value=&quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx: Product Location Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; -. . .... .. ...... . .. . . . : . .. ' : . ..... .... ... 40 201017576 &lt;dfx: Seller&gt; &lt;dfx:SellerName Value=&quot;S1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevel Value=&quot;Level2&quot;&gt;&lt;/dfx:SellerLevel〉 &lt;/dfx:Seller&gt; &lt;dfx:ForecastBucket&gt; &lt;dfx: StartDate Value=&quot; 10/08/20G7&quot;&gt;&lt;/dfx: StartDate&gt; &lt;dfx:EndDate Value=&quot; 10/1 5/2007M&gt;&lt;/dfx:EndDate&gt; 赢 &lt;/dfx:ForecastBucket&gt; ❹ &lt;dfx:ShortageQty Value = &quot; 1 0&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value=&quot;FALSE”&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: AllocationNeeded&gt; &lt;/dfx:AMocationReport&gt; &lt;dfx:StrategyStepName&gt; &lt;dfx:Value&gt;REPORT_ALLOCATION_SHORTAGE&lt;/df x:Value&gt; ... .. .. ... . . ....Value=&quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx: Product Location Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt; -. . .. .. .. ...... . . . . . . . . . . . . . . . . . . 40 201017576 &lt;dfx: Seller&gt;&lt;dfx:SellerName Value= &quot;S1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevelValue=&quot;Level2&quot;&gt;&lt;/dfx:SellerLevel〉&lt;/dfx:Seller&gt;&lt;dfx:ForecastBucket&gt;&lt;dfx : StartDate Value=&quot;10/08/20G7&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDateValue=&quot; 10/1 5/2007M&gt;&lt;/dfx:EndDate&gt;Win&lt;/dfx:ForecastBucket&gt; ❹ &lt;dfx:ShortageQty Value = &quot; 1 0&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTimeValue=&quot;FALSE"&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:AllocationNeeded&gt;&lt;/dfx:AMocationReport&gt;&lt;dfx:StrategyStepName&gt;&lt;dfx:Value&gt;REPORT_ALLOCATION_SHORTAGE&lt;/dfx:Value&gt; ... .. .. ... . . ....

.參......... &lt;/dfx.: Strategy StepName&gt;’V &lt;dfx:PromiseInformation&gt; * &lt;dfx: Promise Quant ityOnTime * Value = &quot;0&quot;x/dfx: Promise Quant ityOnTime&gt; , . ... ... ......... ... .... &lt;dfx: Promise Quantity L:ate:'.........&lt;/dfx.: Strategy StepName&gt;'V &lt;dfx:PromiseInformation&gt; * &lt;dfx: Promise QuantityOnTime * Value = &quot;0&quot;x/dfx: Promise Quant ityOnTime&gt ; , . ... ... ......... ... .... &lt;dfx: Promise Quantity L:ate:'

Value = &quot;60&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;d fx :Pr o mi se Quantity Short . · . . .. . ; ....Value = &quot;60&quot;&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;d fx :Pr o mi se Quantity Short . · . . . . . ; ....

Value=&quot; 110&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDate.. Val.ue=.&quot; [0./1 5./2007&quot;&gt;&lt;/dfx:LateDa.te&gt;. 201017576 &lt;/dfx:PromiseIn formation〉 &lt;/dfx:StrategyStepResult&gt; 如上所示,報告分配短缺步驟提供仍無法消耗但可在 某些移動分配步驟之後.使用的任何剩餘供應_。其亦提供 一特定移動分配步驟將添加到按時承諾或較晚承諾^請 注意’其僅提供移動分配步驟之‘ to一s.eller’資訊,且不 提供‘ from_seller’資訊,例如,此處其提供:對於 藝 FGl::SKU..:Locl,10個單位之數量‘在某個賣方處,仍 可用,但需要分配至Sl::Level2以改良較晚承諾。因此 總體上’在建議之移動分配步驟之後可提供兩個較晚承 諾’第10曰之50個單位及第15曰之1〇個單位。 另外’在最後承諾日期集合且展示所有較晚承謹數 量。因此,提供第15日之60個單位之承諾。 繼續此實例’下一步驟報告ATP短缺是針對來自先前 步驟之較晚及較短項目執行,該項目再次為170個單位、 ❿ 結果:On一time_qty 170 late_qty 0 late__date -- — shortqty 0 • ATP選擇數目-1Value=&quot;110&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate..Val.ue=.&quot; [0./1 5./2007&quot;&gt;&lt;/dfx:LateDa.te&gt; 201017576 &lt;/dfx:PromiseIn formation〉 &lt;/dfx:StrategyStepResult&gt; As indicated above, the report allocation shortage step provides any remaining provisioning_ that is still not consumed but can be used after certain mobile allocation steps. It also provides a specific mobile allocation step that will be added to the on-time commitment or late commitment ^ Please note that it only provides the mobile allocation step of 'to a s.eller' information, and does not provide 'from_seller' information, for example, here It provides: For Art FGl::SKU..:Locl, the number of 10 units' is still available at a certain seller, but needs to be assigned to Sl::Level2 to improve the late promise. Therefore, in general, after the proposed mobile allocation step, 50 units of the 10th order and 10 units of the 15th unit can be provided. In addition, 'the final commitment date is assembled and shows all the late commitments. Therefore, a commitment of 60 units on the 15th day is provided. Continue with this example 'Next Step Report ATP shortage is for late and shorter project execution from the previous step, the project is again 170 units, ❿ Result: On a time_qty 170 late_qty 0 late__date --- shortqty 0 • ATP selection Number -1

Atp Qty Needed 170 For Product FGl::SKU::Locl onAtp Qty Needed 170 For Product FGl::SKU::Locl on

ATP Bucket Start Date 07-10-0 8 Is—On一Time TRUE ATP選擇數目-2ATP Bucket Start Date 07-10-0 8 Is-On-Time TRUE ATP Selection Number -2

Atp Qty Needed 170 For Product AltFGl ::SKU::Locl onAtp Qty Needed 170 For Product AltFGl ::SKU::Locl on

ATP Bucket Start Date 07-10-08 Is_On—Time TRUE ATP選擇數目-3 . . .. - ... . ............. .. .... . . .. ' .. . . .... 42 201017576ATP Bucket Start Date 07-10-08 Is_On-Time TRUE ATP selection number -3 . . . - ... . ............................... ' .. . . .. 42 201017576

Atp Qty Needed 180 For Product Int2::SKU::Locl on ATP Bucket Start Date 07-1 0-06 Is_On_Time TRUEAtp Qty Needed 180 For Product Int2::SKU::Locl on ATP Bucket Start Date 07-1 0-06 Is_On_Time TRUE

Atp Qty Needed 180 For Product Inti: :SRU: :Locl on 'Atp Qty Needed 180 For Product Inti: :SRU: :Locl on '

ATP Bucket Start Date 07-10-06 Is_On_Time TRUEATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For Product CaplFGl: W1: :RES: :Loc 1 on ATP Bucket Start Date 07-10-06 Is On Time TRUE ATP選擇數目_4Atp Qty Needed 180 For Product CaplFGl: W1: :RES: :Loc 1 on ATP Bucket Start Date 07-10-06 Is On Time TRUE ATP Selection Number_4

Atp Qty Needed 180 For Product AltInt2::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 180 For Product AltInt2::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For Product Inti: :SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 180 For Product Inti: :SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For ProductAtp Qty Needed 180 For Product

CaplFGl :W1 ::RES::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE ATP選擇數目-5CaplFGl :W1 ::RES::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE ATP Select Number -5

Atp Qty Needed 201 For Product Comp4::SKU::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUEAtp Qty Needed 201 For Product Comp4::SKU::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 201 For Product Comp3 ::SKU: :Loc 1 on ATP Bucket Start Date 07-10-01 Is_On_Time TRUEAtp Qty Needed 201 For Product Comp3 ::SKU: :Loc 1 on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 201 For ProductAtp Qty Needed 201 For Product

CaplAltInt2:Wl::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUECaplAltInt2: Wl::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 180 For Product Intl::SKU::Locl on . - .- . - ........... .... : 43 201017576Atp Qty Needed 180 For Product Intl::SKU::Locl on . - .- . - ........... .... : 43 201017576

ATP Bucket Start Date 07-10-06 Is_On_Time TRUEATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For Product . .- .... ....Atp Qty Needed 180 For Product . .- .... ....

CaplFGl: W1 ::RES::Locl on ATP Bucket Start Date . . ..... .. ... . ... .. . 07-10-06 Is—On_Time TRUE ΛΤΡ選擇數目-6CaplFGl: W1::RES::Locl on ATP Bucket Start Date . . . . . .. ... . . . . . 07-10-06 Is—On_Time TRUE ΛΤΡSelect Number-6

Atp Qty Needed 180 For Product Int2::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 180 For Product Int2::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 1 80 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 1 80 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For ProductAtp Qty Needed 180 For Product

Cap 1FG1: W1: :RES: :Locl on ATP Bucket Start Date 07-10-06 Is On Time TRUE ATP選擇數目-7Cap 1FG1: W1: :RES: :Locl on ATP Bucket Start Date 07-10-06 Is On Time TRUE ATP Selection Number-7

Atp Qty Needed 180 For Product AltInt2::SKU: :Locl on 'Atp Qty Needed 180 For Product AltInt2::SKU: :Locl on '

ATP Bucket Start Date 07-10-06 Is_On_Time TRUEATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 180 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For ProductAtp Qty Needed 180 For Product

Cap 1 FG1 : W1: :RES: :Loc 1 on ATP Bucket Start Date . .. .......... . 07-10-06 Is_On_Time TRUE ATP選擇數目-8Cap 1 FG1 : W1: :RES: :Loc 1 on ATP Bucket Start Date . .. .......... . 07-10-06 Is_On_Time TRUE ATP Selection Number - 8

Atp Qty Needed 201 For Product Comp4:;SKU::Locl onAtp Qty Needed 201 For Product Comp4:;SKU::Locl on

ATP Bucket Start Date 07-10-01 Is_On_Time TRUE . ' . ... . .ATP Bucket Start Date 07-10-01 Is_On_Time TRUE . ' . . . .

Atp Qty Needed 201 For Product Comp3 :: SKU: :Loc 1 on ' ...... ' ..... ......... ... . .... ..... . . ...... . . . ...:.. ....... . . ...... 44 201017576Atp Qty Needed 201 For Product Comp3 :: SKU: :Loc 1 on ' ...... ' ..... ......... ... . . . ..... . . . . . . :.. ....... . . . . 44 201017576

ATP Bucket Start Date 07-10-01 Is_On_Time TRUEATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 201 For.. ProductAtp Qty Needed 201 For.. Product

CaplAltlnt2:W1::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUECaplAltlnt2:W1::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 180 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUEAtp Qty Needed 180 For Product Altlntl ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE

Atp Qty Needed 180 For ProductAtp Qty Needed 180 For Product

CaplFGl :W1 ::RES::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time TRUE API輸出如下: &lt;dfx:StrategyStepResult&gt; &lt;dfx: ATPReport&gt; &lt;dfx: ATP Shortage Option〉 &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; . ' . ' ·. &lt;dfx:Item Value = &quot;FGl&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevelCaplFGl :W1 ::RES::Locl on ATP Bucket Start Date 07-10-06 Is_On_Time The TRUE API output is as follows: &lt;dfx:StrategyStepResult&gt;&lt;dfx:ATPReport&gt;&lt;dfx: ATP Shortage Option〉 &lt;dfx: ATPShortageRequirement&gt ; &lt;dfx:Product&gt; . ' . ' ·. &lt;dfx:Item Value = &quot;FGl&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel

Value = &quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; ... ...... . ..... . &lt;dfx:ProductLo cation · . ' ' . · . ...... ........ ..Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; ... ...... . . . . . &lt;dfx:ProductLo cation · . ' ' . . . ........ ..

Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; 昏 . . . . &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value=&quot;S 1 ,,&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevel . ' . ....-:. ... .. .... . .... .... .. .. . .: ..... ... ...; . .. .......... . . .... ... .. ......... ...... . - 45 201017576Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; Faint . . . . &lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerNameValue=&quot;S 1 ,,&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel . ' . ....-:. ... .. .... . .... .... .. .. . .: ... ...................................................................................... 45 201017576

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller&gt; &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller&gt;&lt;dfx:ATPBucket&gt;&lt;dfx: StartDate

Value=&quot;10/08/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=&quot;10/08/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;l 0/09/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket〉 &lt;dfx: Short age Qty Value=&quot; 170&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Short ageRequirement&gt; &lt;/dfx: ATP Shortage Op tion&gt; &lt;dfx: ATP ShortageOption&gt; &lt;dfx: ATPShortageRequirement&gt; ❿ &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;AltFGr'x/dfx:Item&gt; * &lt;dfx:ProductLevelValue=&quot;l 0/09/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATPBucket> &lt;dfx: Short age Qty Value=&quot;170&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Short ageRequirement&gt;&lt;/dfx: ATP Shortage Option&gt;&lt;dfx: ATP ShortageOption&gt;&lt;dfx:ATPShortageRequirement&gt;; ❿ &lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;AltFGr'x/dfx:Item&gt; * &lt;dfx:ProductLevel

Value = ”SKU”&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; &lt;dfx:SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; 46 201017576 &lt;dfx: SellerLevelValue = "SKU"&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx :SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; 46 201017576 &lt;dfx: SellerLevel

Value=&quot;Level2&quot;&gt;&lt;/dfx :SellerLevel&gt; &lt;/dfx:Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue=&quot;Level2&quot;&gt;&lt;/dfx :SellerLevel&gt;&lt;/dfx:Seller〉&lt;dfx:ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/0 8/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/0 8/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/09/200 7&quot;&gt;&lt;/dfx:EndDate&gt; 參 &lt;/dfx: ATPBucket〉 &lt;dfx: Short ageQty Value=&quot;170&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Short ageRequirement&gt; &lt;/dfx: ATP ShortageOption&gt; &lt;dfx: ATPShortageOption&gt; ❹ &lt;dfx: ATP Shortage Re quirement&gt; &lt;dfx:Product&gt; . &lt;dfx:Item Value = &quot;Int2&quot;&gt;&lt;/dfx:Item&gt; - &lt;dfx:Pro duct LevelValue=&quot;10/09/200 7&quot;&gt;&lt;/dfx:EndDate&gt;See&lt;/dfx: ATPBucket> &lt;dfx: Short ageQty Value=&quot;170&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Short ageRequirement&gt;&lt;/dfx: ATP ShortageOption&gt;&lt;dfx:ATPShortageOption&gt; ❹ &lt;dfx: ATP Shortage Re Queryment&gt;&lt;dfx:Product&gt; . &lt;dfx:Item Value = &quot;Int2&quot;&gt;&lt;/dfx:Item&gt; - &lt;dfx:Pro duct Level

Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLo cation Value=&quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; 47 201017576 &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLo cation Value=&quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt; 47 201017576 &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value=&quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=&quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=H10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; &lt;dfx: Shortage Qty Value=&quot; 1 8 0&quot;&gt;&lt;/dfx: Shortage Qty&gt; &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Short ageRequirement&gt; &lt;dfx: ATP Short ageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value=&quot;Inti”&gt;&lt;/dfx:Item〉 &lt;dfx: Product Level Valuer&quot; SKU&quot;&gt;&lt;/dfx: Pro ductLevel&gt; &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx :Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; 48 201017576 &lt;dfx: SellerLevelValue=H10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx: Shortage Qty Value=&quot; 1 8 0&quot;&gt;&lt;/dfx: Shortage Qty&gt;&lt; Dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Short ageRequirement&gt;&lt;dfx: ATP Short ageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:ItemValue=&quot;Inti”&gt;&lt;/dfx:Item〉&lt;dfx: Product Level Valuer&quot;SKU&quot;&gt;&lt;/dfx: Pro ductLevel&gt;&lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt ; &lt;/dfx :Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; 48 201017576 &lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot; 10/06/200 7&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 10/06/200 7&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; 參 &lt;/dfx: ATPBucket&gt; &lt;dfx: Short age Qty Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; ❹ &lt;dfx:Item Value = &quot;CaplFGl &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel * Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt; - &lt;dfx:ProductLocationValue = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;See&lt;/dfx:ATPBucket&gt;&lt;dfx: Short age Qty Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTimeValue=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:ATPShortageRequirement&gt;&lt;dfx:ATPShortageRequirement&gt;&lt;dfx:Product&gt; ❹ &lt;dfx:Item Value = &quot;CaplFGl &quot ;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel * Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt; - &lt;dfx:ProductLocation

Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller〉 49 201017576 &lt;dfx:SellerName Value = &quot;Sl M&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx: Seller〉 49 201017576 &lt;dfx:SellerName Value = &quot;Sl M&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value=&quot;Level2,,x/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATP Bucket〉 &lt;dfx: StartDateValue=&quot;Level2,,x/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATP Bucket〉 &lt;dfx: StartDate

Value = &quot;10/06/200 7&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDate 藝Value = &quot;10/06/200 7&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate Art

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx:ATPB ucket&gt; &lt;dfx: Short age Qty Value=&quot; 1 80 &quot;&gt;&lt;/dfx: Shortage Qty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;〉&lt;/dfx:OnTime&gt; &lt;/dfx: ATPShortageRequirement&gt; &lt;/dfx: ATP Short age Option〉 參 &lt;dfx: ATPShortageOption&gt; &lt;dfx: ATP ShortageRe quirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Valuer&quot;Altlnt2&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; 〈dfxrProduciLocation Value = &quot;Locl&quot;x/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; 50 201017576 &lt;dfx: Seller&gt; &lt;dfx:SellerName Value=&quot;Sl,'x/dfx:SellerName&gt; &lt;dfx: Seller Lev elValue = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx: Short age Qty Value=&quot; 1 80 &quot;&gt;&lt;/dfx: Shortage Qty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;〉&lt;/dfx:OnTime&gt;&lt;/dfx:ATPShortageRequirement&gt;&lt;/dfx: ATP Short age Option> 参&lt;dfx: ATPShortageOption&gt;&lt;dfx: ATP ShortageRe quirement&gt;&lt;dfx:Product&gt;&lt;dfx:ItemValuer&quot;Altlnt2&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; 〈dfxrProduciLocation Value = &quot;Locl&quot;x/dfx:ProductLocation&gt;&lt;/dfx:Product&gt; 50 201017576 &lt;dfx: Seller&gt;&lt;dfx:SellerNameValue=&quot;Sl,'x/dfx:SellerName&gt;&lt;dfx: Seller Lev El

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller&gt; &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller&gt;&lt;dfx:ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; 參 &lt;dfx:EndDateValue = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; See &lt;dfx:EndDate

Value = ,,10/07/2007&quot;x/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 &lt;dfx: Shortage Qty Value = ”180&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Shortage Requirement〉 ❿ &lt;dfx: ATP Short ageRe quir ement&gt; &lt;dfx:Product&gt; * &lt;dfx:Item Value = &quot;Intl &quot;&gt;&lt;/dfx:Item&gt; - &lt;dfx:ProductLevelValue = ,,10/07/2007&quot;x/dfx:EndDate&gt;&lt;/dfx: ATP Bucket〉 &lt;dfx: Shortage Qty Value = "180&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Shortage Requirement> ❿ &lt;dfx: ATP Short ageRe quirement&gt;&lt;dfx:Product&gt; * &lt;dfx:Item Value = &quot; Intl &quot;&gt;&lt;/dfx:Item&gt; - &lt;dfx:ProductLevel

Value = &quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation Value = &quot;Locl,'x/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; 51 201017576 &lt;dfx: SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation Value = &quot;Locl,'x/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt; 51 201017576 &lt; Dfx: SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;x/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;x/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot; 1 0/06/200 7&quot;&gt;&lt;/dfx: StartDate&gt; &lt;dfx:EndDateValue = &quot; 1 0/06/200 7&quot;&gt;&lt;/dfx: StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; &lt;dfx: Short age Qty Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP Short age Requirement〉 參 &lt;dfx: ATP ShortageRe quire ment&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;CaplFGl &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx: Pro duct Level &gt; &lt;dfx:ProductLocation Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; 52 201017576 &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx: Short age Qty Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt; Dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP Short age Requirement> References&lt;dfx: ATP ShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;CaplFGl &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx: Pro duct Level &gt;&lt;dfx:ProductLocation Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; 52 201017576 &lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx :SellerName Value = &quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel

Value = &quot;Level2 &quot;&gt;&lt;/dfx: SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATP Buck et&gt;Value = &quot;Level2 &quot;&gt;&lt;/dfx: SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATP Buck et&gt;

&lt;dfx: StartDate&lt;dfx: StartDate

Value=&quot; 1 0/06/200 7 &quot;&gt;&lt;/dfx: StartDate&gt; &lt;dfx:EndDateValue=&quot; 1 0/06/200 7 &quot;&gt;&lt;/dfx: StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket〉 &lt;dfx: Short age Qty Value = &quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; 參. &lt;/dfx:ATPShortageRequirement&gt; &lt;/dfx: ATP Shortage Option〉 &lt;dfx: ATP Short age Opt ion&gt; - &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value=:&quot;Comp4&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProduciLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation 53 201017576Value=&quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATPBucket> &lt;dfx: Short age Qty Value = &quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;‘&lt;/dfx:ATPShortageRequirement&gt;&lt;/dfx: ATP Shortage Option〉 &lt;dfx: ATP Short age Option&gt; - &lt; Dfx: ATPShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:ItemValue=:&quot;Comp4&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProduciLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt ; &lt;dfx:ProductLocation 53 201017576

Value = &quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller〉 &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx: Seller〉 &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt ; &lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx:StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx:StartDate

Value = &quot; 10/01/2007,,&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/01/2007,,&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; &lt;dfx: Shortage Qty Value = &quot;201 &quot;&gt; &lt;/dfx: Short age Qty&gt; 參 &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATP ShortageRequirement&gt; - &lt;dfx:Product&gt; &lt;dfx:Item Valuer&quot;Comp3&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; 54 201017576 &lt;/dfx:Product&gt; &lt;dfx:Seller&gt;Value=&quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx: Shortage Qty Value = &quot;201 &quot;&gt;&lt;/dfx: Short age Qty&gt;&&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:ATPShortageRequirement&gt;&lt;dfx: ATP ShortageRequirement&gt; - &lt;dfx:Product&gt;&lt;dfx:ItemValuer&quot;Comp3&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; 54 201017576 &lt;/dfx:Product&gt;&lt;dfx:Seller&gt;

Value: &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevel &quot;Level2&quot;x/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDate Value = &quot; 10/01/200 7 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx.:EndDateValue: &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel&quot;Level2&quot;x/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate Value = &quot; 10/01/200 7 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx.:EndDate

Value=&quot; 1 0/02/200 7 &quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 &lt;dfx:ShortageQtyValue=&quot; 1 0/02/200 7 &quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATP Bucket〉 &lt;dfx:ShortageQty

Value=&quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; 參 &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATPShortageRequirement〉 &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Capl Altlnt2 &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLo cation Value = &quot;Locl&quot;x/dfx:ProductLocation&gt; &lt;dfx、WorkcenterName 55 201017576Value=&quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTimeValue=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;‘&lt;/dfx:ATPShortageRequirement&gt;&lt;dfx: ATPShortageRequirement〉 &lt;;dfx:Product&gt;&lt;dfx:Item Value = &quot;Capl Altlnt2 &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt;&lt; Dfx:ProductLo cation Value = &quot;Locl&quot;x/dfx:ProductLocation&gt;&lt;dfx,WorkcenterName 55 201017576

Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt ; &lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉

&lt;dfx: ATPBucket&gt; &lt;dfx:StartDate&lt;dfx: ATPBucket&gt;&lt;dfx:StartDate

Value = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;l 0/02/2007 &quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket〉 &lt;dfx: Short age Qty Value=&quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt; ❿ &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP ShortageRequirement&gt; &lt;dfx: ATP S ho rtageRe quire ment&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Intl&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLo cation Value=&quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; 56 201017576 &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; &lt;dfx:SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue=&quot;l 0/02/2007 &quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATPBucket> &lt;dfx: Short age Qty Value=&quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt; ❿ &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP ShortageRequirement&gt;&lt;dfx: ATP S ho rtageRe ment ment&gt;&lt;dfx:Product&gt;&lt;dfx: Item Value = &quot;Intl&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLo cation Value=&quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; 56 201017576 &lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller&gt; &lt;dfx: ATPBucket&gt; _ &lt;dfx: StartDate ❿Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller&gt;&lt;dfx:ATPBucket&gt; _ &lt;dfx: StartDate ❿

Value = ',10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = ',10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 &lt;dfx: Short age Qty Value=&quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value==&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; 參 &lt;/dfx: ATP Short age Requirement&gt; &lt;dfx: ATPShortageRequirement&gt; ‘ &lt;dfx:Product&gt; - &lt;dfx:Item Value = &quot;CaplFGl &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx: Pro duct L eve 1&gt; &lt;dfx:ProductLocation Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;dfx: WorkcenterName 57 201017576Value=&quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATP Bucket〉 &lt;dfx: Short age Qty Value=&quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTimeValue==&&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;‘&lt;/dfx: ATP Short age Requirement&gt;&lt;dfx:ATPShortageRequirement&gt; ' &lt;dfx:Product&gt; - &lt;dfx: Item Value = &quot;CaplFGl &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx: Pro duct L eve 1&gt;&lt;dfx:ProductLocation Value = &quot ;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;dfx: WorkcenterName 57 201017576

Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = &quot;S 1 ”&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerName Value = &quot;S 1 ”&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; 參 &lt;dfx:StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; See &lt;dfx:StartDate

Value=&quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=&quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/07/2007&quot;x/dfx:EndDate&gt; &lt;/dfx: ATPBucket〉 &lt;dfx: Short age Qty Value=&quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt; 參 &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP ShortageRequi remen t&gt; * &lt;/dfx: ATP Shortage Opt ion&gt; ' &lt;dfx: ATP ShortageOption&gt; &lt;dfx: ATP ShortageRe quirement&gt; &lt;dfx:Product&gt; &lt;dfx:ItemValue = &quot;Int2&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value=&quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; 58 201017576 &lt;d fx: Pro ductL 〇 cationValue=&quot;10/07/2007&quot;x/dfx:EndDate&gt;&lt;/dfx: ATPBucket> &lt;dfx: Short age Qty Value=&quot; 1 80&quot;&gt;&lt;/dfx:ShortageQty&gt;‘&lt;dfx :OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP ShortageRequi remen t&gt; * &lt;/dfx: ATP Shortage Option&gt; ' &lt;dfx: ATP ShortageOption&gt;&lt;dfx: ATP ShortageRe quirement&gt;&lt;dfx:Product&gt;&lt;dfx:ItemValue = &quot;Int2&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevelValue=&quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; 58 201017576 &lt;d fx: Pro ductL 〇cation

Value = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller〉 &lt;dfx:SellerName Value=&quot; S1 &quot;&gt;&lt;/dfx: SellerName&gt; &lt;dfx:SellerLevelValue = &quot;Loc 1 &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx: Seller〉 &lt;dfx:SellerName Value=&quot; S1 &quot;&gt;&lt;/dfx: SellerName&gt ; &lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller〉&lt;dfx:ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/07/200 7&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 &lt;dfx: Short age Qty 參 Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATPShortageRequirement&gt; &lt;&lt;lfx: Product〉 &lt;dfx:Item Value = &quot;AltIntl&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevelValue=&quot;10/07/200 7&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATP Bucket〉 &lt;dfx: Short age Qty Parameter Value = &quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt ; &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx:ATPShortageRequirement&gt;&lt;dfx:ATPShortageRequirement&gt;&lt;&lt;lfx: Product〉 &lt;dfx:Item Value = &quot ;AltIntl&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel

Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt; d fx: Pr o due tLo cation 59 201017576Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt; d fx: Pr o due tLo cation 59 201017576

Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; &lt;dfx:SellerName Value=&quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerNameValue=&quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot; 1 0/06/200 7 &quot;&gt;&lt;/dfx: StartDate&gt; &lt;dfx:EndDateValue = &quot; 1 0/06/200 7 &quot;&gt;&lt;/dfx: StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; &lt;dfx: Short age Qty Value = &quot; 1 80 &quot;&gt;&lt;/dfx: Shortage Qty&gt; ❿ &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP ShortageRequirement&gt; &lt;dfx: ATP ShortageRequirement&gt; &quot; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Cap 1FG1 &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;d fx: Pro ductLo cation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; 60 201017576 &lt;dfx: WorkcenterNameValue = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx: Short age Qty Value = &quot; 1 80 &quot;&gt;&lt;/dfx: Shortage Qty&gt ; ❿ &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP ShortageRequirement&gt;&lt;dfx: ATP ShortageRequirement&gt;&quot;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;Cap 1FG1 &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;d fx: Pro ductLo cation Value = &quot;Locl&quot ;&gt;&lt;/dfx:ProductLocation&gt; 60 201017576 &lt;dfx: WorkcenterName

Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = ”S 1 ”&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerName Value = "S 1 "&gt;&lt;/dfx:SellerName&gt;&lt;;dfx: SellerLevel

Value:&quot; Level 2 &quot; &gt;&lt;/dfx: SellerLevel&gt; _ &lt;/dfx: Seller〉Value:&quot; Level 2 &quot;&gt;&lt;/dfx:SellerLevel&gt; _ &lt;/dfx: Seller〉

W &lt;dfx: ATP Buck et&gt; &lt;dfx: StartDateW &lt;dfx: ATP Buck et&gt;&lt;dfx: StartDate

Value=&quot; 10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=&quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=&quot;10/07/2007,,&gt;&lt;/dfx:EndDate&gt; &lt;/dfx:ATPBucket&gt; &lt;dfx:Shortage.Qty. ❿ Value=M180,,&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:GnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTiiiie&gt; ·. ... &lt;/dfx: ATPShortageRequirement&gt; * &lt;/dfx: ATP Shortage Optiοn&gt; &lt;dfx: ATPShortageOption&gt; &lt;d.fx: ATPShortage.Requireme.nt&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;AltInt2&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel 201017576Value=&quot;10/07/2007,,&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt;&lt;dfx:Shortage.Qty. ❿ Value=M180,,&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:GnTimeValue=&quot;TRUE&quot;&gt;&lt;/dfx:OnTiiiie&gt; ·. ... &lt;/dfx: ATPShortageRequirement&gt; * &lt;/dfx: ATP Shortage Optiοn&gt;&lt;dfx:ATPShortageOption&gt;&lt; D.fx: ATPShortage.Requireme.nt&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;AltInt2&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel 201017576

Value = &quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx: SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt; Dfx: SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;x/dfx: SellerLevel&gt; 參 &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;x/dfx: SellerLevel&gt; See &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 參 &lt;dfx: Short age QtyValue = &quot;10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATP Bucket> Participate in &lt;dfx: Short age Qty

Value=&quot; 180&quot;&gt;&lt;/dfx:ShortageQty&gt; * &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATP ShortageRe quire ment&gt; &lt;dfx: ATP Short ageRe quire ment&gt; &lt;dfx :Product&gt; &lt;dfx:Item Value = &quot;AltIntl &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; 62 201017576 &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller〉 &lt;dfx: SellerName Value = &quot; S 1 &quot;&gt;&lt;/dfx: SellerName&gt; &lt;dfx:SellerLevelValue=&quot;180&quot;&gt;&lt;/dfx:ShortageQty&gt; * &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATP ShortageRequirement&gt;&lt;dfx : ATP Short ageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;AltIntl &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;SKU&quot;&gt;&lt;/ Dfx:ProductLevel&gt; 62 201017576 &lt;dfx:ProductLocation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx: Seller〉 &lt;dfx: SellerName Value = &quot; S 1 &quot;&gt;&lt;/dfx: SellerName&gt;&lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx:Seller〉 參 &lt;dfx: ATPBucket&gt; &lt;dfx:StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx:Seller> See &lt;dfx: ATPBucket&gt;&lt;dfx:StartDate

Value = &quot; 1 0/06/2 007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 1 0/06/2 007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Va lue = &quot;1 0/07/2007 &quot;&gt;&lt;/dfx:EndD at e&gt; &lt;/dfx: ATPBucket〉 &lt;dfx: Short age Qty. ❿ Value = &quot; 1 80&quot;&gt;&lt;/dfx:.ShortageQty&gt; &lt;dfx:OnTime Value = &quot; TRUE&quot; &gt;&lt;/dfx: On Time &gt; • &lt;/dfx: ATP Short age Re quirement&gt; • &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;CaplFGl&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation 63 201017576Va lue = &quot;1 0/07/2007 &quot;&gt;&lt;/dfx:EndD at e&gt;&lt;/dfx: ATPBucket> &lt;dfx: Short age Qty. ❿ Value = &quot; 1 80&quot;&gt;&lt ;/dfx:.ShortageQty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx: On Time &gt; • &lt;/dfx: ATP Short age Requirement&gt; • &lt;dfx: ATPShortageRequirement&gt;&lt;Dfx:Product&gt;&lt;dfx:Item Value = &quot;CaplFGl&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation 63 201017576

Value = &quot;Locl&quot;x/dfx:ProductLocation&gt; &lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx:SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue = &quot;Locl&quot;x/dfx:ProductLocation&gt;&lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx: SellerName Value = &quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx:SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; 參 &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; See &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot; 1 0/06/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 1 0/06/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = ,'l 0/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; 參 &lt;dfx: Short age QtyValue = , 'l 0/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt; See &lt;dfx: Short age Qty

Value = &quot; 1 80 &quot;&gt;&lt;/dfx: Short age Qty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATPShortageRequirement&gt; &lt;/dfx: ATP Shortage Option〉. &lt;dfx: ATP Shortage Option〉 &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Comp4&quot;&gt;&lt;/dfx:Item&gt; 64 201017576Value = &quot; 1 80 &quot;&gt;&lt;/dfx: Short age Qty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATPShortageRequirement&gt;&lt;/ Dfx: ATP Shortage Option>. &lt;dfx: ATP Shortage Option> &lt;dfx: ATPShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;Comp4&quot;&gt;&lt;/dfx:Item&gt; 64 201017576

Value &lt;dfx:ProductLevel &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;Value &lt;dfx:ProductLevel &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;

Value &lt;dfx: Pro ductLo cation &quot;Loci ”&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller〉Value &lt;dfx: Pro ductLocation &quot;Loci ”&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx: Seller〉

&lt;dfx:SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx: SellerName&gt; &lt;dfx:SellerLevel Value: &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATP Bucket &gt; &lt;dfx:StartDate&lt;dfx:SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx: SellerName&gt;&lt;dfx:SellerLevel Value: &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt; Dfx: ATP Bucket &gt;&lt;dfx:StartDate

Value = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 10/0 1/2007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; ❿. &lt;/dfx: ATPBucket&gt; &lt;dfx: Shortage Qty Value = &quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;〉&lt;/dfx.:OnTime&gt;.· &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATP Short ageRe quire me nt&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;Comp3 &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel 65 201017576Value = &quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; ❿. &lt;/dfx: ATPBucket&gt;&lt;dfx: Shortage Qty Value = &quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;〉&lt;/dfx.:OnTime&gt;.· &lt;/dfx: ATPShortageRequirement&gt;&lt;dfx: ATP Short ageRe quire me nt&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;Comp3 &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel 65 201017576

Value = &quot; SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation'Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocation'

Value=&quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; &lt;dfx:SellerName Value=&quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx:SellerLevelValue=&quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerNameValue=&quot;S 1 &quot;&gt;&lt;/dfx:SellerName&gt ; &lt;dfx:SellerLevel

Value=&quot;Level2&quot;&gt;&lt;/dfx: SellerLevel&gt; ❹ &lt;/dfx: Seller〉. &lt;dfx: ATPBucket&gt; &lt;dfx:StartDateValue=&quot;Level2&quot;&gt;&lt;/dfx: SellerLevel&gt; ❹ &lt;/dfx: Seller〉. &lt;dfx: ATPBucket&gt;&lt;dfx:StartDate

Value=,'l 0/01/2007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=,'l 0/01/2007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = ,'10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATP Bucket〉 參 &lt;dfx: Short age QtyValue = , '10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx: ATP Bucket> References &lt;dfx: Short age Qty

Value=&quot;201 &quot;&gt;&lt;/dfx: ShortageQty&gt; ..... .... .... * &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; . .. * &lt;/dfx: ATP ShortageRequirement&gt; . . .. . -.. . . . .... .. . ·. . ·. . .............. &quot; &lt;dfx: ATPShortageRequirement&gt; &lt;dfx:Product&gt; .. . : -. .. . &lt;dfx:Item Value=&quot;Cap 1 Altlnt2&quot;&gt;&lt;/dfx:ltem&gt; &lt;dfx:ProductLevel Value = &quot;RES&quot; &gt;&lt;/dfx:ProductLevel&gt; 66 201017576 &lt;d fx: Pro ductLo cation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt; &lt;/dfx:Product&gt; &lt;dfx:Seller&gt; &lt;dfx: SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt; _ &lt;dfx:SellerLevel ❿Value=&quot;201 &quot;&gt;&lt;/dfx: ShortageQty&gt; ..... .... .... * &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; . . . * &lt;/dfx: ATP ShortageRequirement&gt; . . . . . -.. . . . . . . . . . . . . . . . . . . &quot;&lt;dfx:ATPShortageRequirement&gt;&lt;dfx:Product&gt; .. . : -. .. . &lt;dfx:Item Value=&quot;Cap 1 Altlnt2&quot;&gt;&lt;/dfx:ltem&gt;&lt;dfx:ProductLevel Value = &quot;RES&quot;&gt;&lt;/dfx:ProductLevel&gt; 66 201017576 &lt;d fx: Pro ductLo cation Value = &quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;dfx: WorkcenterName Value = &quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx: SellerName Value = &quot;Sl &quot;&gt;&lt;/dfx:SellerName&gt; _ &lt;dfx: SellerLevel ❿

Value = &quot;Level2&quot;x/dfx:SellerLevel&gt; &lt;/dfx:Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx:StartDateValue = &quot;Level2&quot;x/dfx:SellerLevel&gt;&lt;/dfx:Seller〉&lt;dfx:ATPBucket&gt;&lt;dfx:StartDate

Value=&quot;10/01/2007&quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue=&quot;10/01/2007&quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value = &quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; ❿ &lt;/dfx: ATPBucket&gt; &lt;dfx: Shortage Qty Value = &quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; &lt;/dfx: ATP ShortageRequirement&gt; &lt;dfx: ATP ShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot; Altlnt l &quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel 67 201017576Value = &quot;10/02/2007&quot;&gt;&lt;/dfx:EndDate&gt; ❿ &lt;/dfx: ATPBucket&gt;&lt;dfx: Shortage Qty Value = &quot;201&quot;&gt;&lt;/dfx:ShortageQty&gt;&lt; Dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt;&lt;/dfx: ATP ShortageRequirement&gt;&lt;dfx: ATP ShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot; Altlnt l &quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel 67 201017576

Value = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt; &lt;dfx:ProductLocation Value=&quot;Locl &quot;&gt;&lt;/dfx:ProductLocation&gt; &lt;/dfx:Product&gt; &lt;dfx: Seller&gt; &lt;dfx:SellerName Value=&quot;SI &quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot;SKU&quot;&gt;&lt;/dfx:ProductLevel&gt;&lt;dfx:ProductLocationValue=&quot;Locl&quot;&gt;&lt;/dfx:ProductLocation&gt;&lt;/dfx:Product&gt;&lt;dfx:Seller&gt;&lt;dfx:SellerNameValue=&quot;SI&quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx:StartDateValue = &quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx:StartDate

Value = &quot; 1 0/06/2 007 &quot;&gt;&lt;/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot; 1 0/06/2 007 &quot;&gt;&lt;/dfx:StartDate&gt;&lt;dfx:EndDate

Value=H10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; &lt;/dfx: ATPBucket&gt; ⑩ &lt;dfx: Short age QtyValue=H10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt;&lt;/dfx:ATPBucket&gt; 10 &lt;dfx: Short age Qty

Value = &quot; 1 80 &quot;&gt;&lt;/dfx: Short age Qty&gt; &lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATPShortageRequirement&gt; &lt;dfx: ATP ShortageRequirement&gt; &lt;dfx:Product&gt; &lt;dfx:Item Value = &quot;CaplFGl&quot;&gt;&lt;/dfx:Item&gt; &lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt; 68 201017576 &lt;dfx: Pro ductLo cation Value=&quot;Loc 1 &quot;x/dfxrProductLocatioj^ &lt;dfx: Work cent erName Value=&quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName^ &lt;/.dfx: Product〉 &lt;.dfx: Seller〉 &lt;dfx:SellerName Value=&quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt; &lt;dfx: SellerLevelValue = &quot; 1 80 &quot;&gt;&lt;/dfx: Short age Qty&gt;&lt;dfx:OnTime Value = &quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; - &lt;/dfx: ATPShortageRequirement&gt;&lt;dfx : ATP ShortageRequirement&gt;&lt;dfx:Product&gt;&lt;dfx:Item Value = &quot;CaplFGl&quot;&gt;&lt;/dfx:Item&gt;&lt;dfx:ProductLevel Value = &quot;RES &quot;&gt;&lt;/dfx:ProductLevel&gt ; 68 201017576 &lt;dfx: Pro ductLo cation Value=&quot;Loc 1 &quot;x/dfxrProductLocatioj^ &lt;dfx: Work cent erName Value=&quot; W1 &quot;&gt;&lt;/dfx: WorkcenterName^ &lt;/.dfx : Product〉 &lt;.dfx: Seller〉 &lt;dfx:SellerName Value=&quot;Sl&quot;&gt;&lt;/dfx:SellerName&gt;&lt;dfx: SellerLevel

Value=&quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt; &lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt; &lt;dfx: StartDateValue=&quot;Level2&quot;&gt;&lt;/dfx:SellerLevel&gt;&lt;/dfx: Seller〉 &lt;dfx: ATPBucket&gt;&lt;dfx: StartDate

Value = &quot;10/06/2007&quot;x/dfx:StartDate&gt; &lt;dfx:EndDateValue = &quot;10/06/2007&quot;x/dfx:StartDate&gt;&lt;dfx:EndDate

Value = M 10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; 參 &lt;/dfx: ATPBucket&gt; &lt;dfx:ShortageQty ....... ; : .-- . - .-.- . * Value=&quot; 1 80M&gt;&lt;/dfx:ShortageQty&gt; - &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; . . .. - ....... .... .. ... ..&lt;/dfx:ATPShortageRequiremen.t&gt;:......... &lt;/dfx: ATP Shortage Opt ion〉 &lt;/dfx: ATP Report〉 &lt;dfx: Strategy StepName&gt; &lt;dfx:Value&gt;REPORT ATP_SHORTAGE&lt;/dfx:Value&gt; 69 201017576 &lt;/dfx:StrategyStepName&gt; &lt;dfx:PromiseInformati〇n&gt; &lt;dfx: Promise Quant ityOnTime:Value = M 10/07/2007&quot;&gt;&lt;/dfx:EndDate&gt; Refer to &lt;/dfx: ATPBucket&gt;&lt;dfx:ShortageQty.......; : .-- . - .-.- . * Value=&quot; 1 80M&gt;&lt;/dfx:ShortageQty&gt; - &lt;dfx:OnTime Value=&quot;TRUE&quot;&gt;&lt;/dfx:OnTime&gt; . . .. - ....... .. .. .. ... ..&lt;/dfx:ATPShortageRequiremen.t&gt;:...... &lt;/dfx: ATP Shortage Opt ion〉 &lt;/dfx: ATP Report> &lt;dfx: Strategy StepName&gt;&lt;dfx:Value&gt;REPORTATP_SHORTAGE&lt;/dfx:Value&gt; 69 201017576 &lt;/dfx:StrategyStepName&gt;&lt;dfx:PromiseInformati〇n&gt;&lt;dfx: Promise QuantityOnTime:

Value=&quot; 1 70&quot; &gt;&lt;/dfx:PromiseQuantityOnTime&gt;Value=&quot; 1 70&quot;&gt;&lt;/dfx:PromiseQuantityOnTime&gt;

&lt;dfx: Promise Quantity Late Value=&quot;0,'&gt;&lt;/dfx:PromiseQuantityLate&gt; &lt;dfx:PromiseQuantity Short Value=&quot;0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt; &lt;dfx:LateDate Value=&quot;- —.......&quot;&gt;&lt;/dfx:LateDate&gt; &lt;/dfx:PromiseInformation&gt; &lt;/dfx :StrategyStepResult&gt; 如上所_示,報告ATP短缺步驟考慮‘marked_buffer’ 概念以減少CTP情形中之選擇數目。marke_d_buffer經設 定為‘真’的任何產品僅考慮為可用於採購更多供應。 在此實例中,所有產品為經標記緩衝區,且因此需求 參 實現引擎212提供所有可提供承諾之可能選擇。如上所 示,未展示涉及Inti之BOM的某些ATP選擇(例如,&lt;dfx: Promise Quantity Late Value=&quot;0,'&gt;&lt;/dfx:PromiseQuantityLate&gt;&lt;dfx:PromiseQuantity Short Value=&quot;0&quot;&gt;&lt;/dfx:PromiseQuantityShort&gt;&lt;dfx:LateDate Value =&quot;- —.......&quot;&gt;&lt;/dfx:LateDate&gt;&lt;/dfx:PromiseInformation&gt;&lt;/dfx:StrategyStepResult&gt; As indicated above, the report ATP shortage step considers 'marked_buffer' The concept is to reduce the number of choices in the CTP scenario. Any product whose marke_d_buffer is set to 'true' is only considered to be available for purchasing more supplies. In this example, all products are tagged buffers, and thus the requirements reference implementation engine 212 provides all possible options for providing a promise. As indicated above, certain ATP selections involving the Inti's BOM are not shown (for example,

帶有.C.ompl.、.C..o:mp2、.Cap.lIntl.,Int2'及 Cap.l.FGl …之 ATP . . . ...... .. .... - ........ .. .. 選擇),因為由於製造前置時間限制而無法提供按時承 : . : ' ' · ' ·' ,人' 諾。另外或作為對此實例之替代,自經標記鍰衝區之清 . .. . .... 單移除Altlntl、Int2及Altlnt2且執行報告ATP短缺步 驟。ATP選擇減少如下(上文所示之ATP選擇3、4、6、 . ...... . ..... . : ...... . . ' 7及8經消除)·· 結果:.On_time_qty 1 7.0」ate_q.ty .'0 late」date ........- 70 201017576 shortqty 0 ATP選擇數目_ 1ATP with .C.ompl., .C..o:mp2, .Cap.lIntl., Int2' and Cap.l.FGl ... . . . . . . . ....... .. .. Select), because due to manufacturing lead time constraints can not provide on time: . : ' ' · ' · ', people 'no. Additionally or as an alternative to this example, Altlntl, Int2, and Altlnt2 are removed from the marked buffer area and the ATP shortage step is reported. The ATP selection is reduced as follows (the ATP selections shown above are 3, 4, 6, . . . . . . . . : . . . . ' 7 and 8 are eliminated)·· Result: .On_time_qty 1 7.0"ate_q.ty .'0 late"date ........- 70 201017576 shortqty 0 ATP selection number _ 1

Atp Qty Needed 170 For Product FGl::SKU::Locl on ATP Bucket Start Date 07-10-08 Is_On_Time TRUE ATP選擇數目_2Atp Qty Needed 170 For Product FGl::SKU::Locl on ATP Bucket Start Date 07-10-08 Is_On_Time TRUE ATP Selection Number_2

Atp Qty Needed 170 For Product AltFGl ::SKU::Locl onAtp Qty Needed 170 For Product AltFGl ::SKU::Locl on

ATP Bucket Start Date 07-10-08 Is_On_Time TRUE _ ATP選擇數目_3ATP Bucket Start Date 07-10-08 Is_On_Time TRUE _ ATP selection number _3

WW

Atp Qty Needed 201 For Product Comp4::SKU::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUEAtp Qty Needed 201 For Product Comp4::SKU::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 201 For Product Comp3::SKU::Locl on ATP Bucket Start Date 07-10-01 Is On Time TRUEAtp Qty Needed 201 For Product Comp3::SKU::Locl on ATP Bucket Start Date 07-10-01 Is On Time TRUE

Atp Qty Needed 201 For Product CaplAltInt2:Wl::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUEAtp Qty Needed 201 For Product CaplAltInt2: Wl::RES::Locl on ATP Bucket Start Date 07-10-01 Is_On_Time TRUE

Atp Qty Needed 180 For Product Inti ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is On Time TRUEAtp Qty Needed 180 For Product Inti ::SKU::Locl on ATP Bucket Start Date 07-10-06 Is On Time TRUE

Atp ...::Qt.y: .Vv'N.eeded ' ......180 ' . For ProductAtp ...::Qt.y: .Vv'N.eeded ' ......180 ' . For Product

CaplFGl:Wl::RES::Locl on ATP Bucket Start Date . . -.. . . ......... .... ....CaplFGl:Wl::RES::Locl on ATP Bucket Start Date . . -.. . . ......... .... ....

07-10-06 Is On Time TRUE ._ . — 第5圖圖示決定限制及解析選擇來解決訂貨承諾異常 之示範性方法5〇〇&gt;方法開始於步驟502 ’其中訂貨承諾 系統110自一或多個企業l2〇a-l2〇n或一或多個顧客 13 0a-130n接收訂貨承諾。在步驟504,訂貨承諾系統110 . . _ .. . .. . . - . : . . . .. .... ... &quot; ... . ..... ... :. .. . 71 201017576 t皆或多個供應鏈限制^如上論述,需求實現引擎212 或訂貨承諾系統11G可取決於供㈣限制而縮短或延遲 訂貨。僅作為實例而非限制,供應鏈限制包括(但不限 ^小於可裝運之最小數量之訂貨數量並非裝運之批 量之倍數的訂貨數量、針對自特定位置之交付請求之訂 貨,及針對特定運輸模式請求之訂貨。07-10-06 Is On Time TRUE ._ . — Figure 5 illustrates an exemplary method of determining limits and resolving choices to resolve an order commitment exception. The method begins in step 502 'where the order commitment system 110 is from one Or the plurality of enterprises l2〇a-l2〇n or one or more customers 13 0a-130n receive the order commitment. At step 504, the order commitment system 110 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71 201017576 t All or more supply chain restrictions ^ As discussed above, the demand fulfillment engine 212 or the order fulfillment system 11G may shorten or delay the order depending on the (four) limit. By way of example and not limitation, supply chain restrictions include (but are not limited to, less than the minimum quantity that can be shipped, the number of orders that are not a multiple of the shipment quantity, the order for the delivery request from a particular location, and for a particular mode of transportation Requested order.

在步驟506處,訂貨承諾系統11〇決定上文界定之限 制中哪些為硬限制且可能不可協商,以及上文界定之限 制中哪些為彈性限制。在步驟5〇8處,訂貨承諾系統ιι〇 產生-或多個策略模型。如上論述,每一策略模型222 包括一或多個需求實現引擎212於一界定序列考慮之一 或多個策略改變。僅作為實例而非限制,訂貨承諾系統 110經由OIL文稿内容產生一或多個策略模型。此可經 由什劃文稿内容本身完成,因為在導入期間不要求策略 模型,而是僅在計劃或訂貨承諾時間斯間要求策略模 型。舉例而言,使用示範性〇IL文稿内容來產生策略模 ' .... ' . . 型及該策略模型中之相關聯策略改變階層: .. ...... . ... define(My Strategy, ... . . . strategies.find_or_create(&quot;TestStrategy&quot;));At step 506, the order fulfillment system 11 determines which of the above defined limits are hard limits and may not be negotiable, and which of the above defined limits are flexible limits. At step 5〇8, the order commitment system ιι〇 produces - or multiple policy models. As discussed above, each policy model 222 includes one or more requirements implementation engines 212 that consider one or more policy changes in a defined sequence. By way of example and not limitation, the order fulfillment system 110 generates one or more policy models via the OIL document content. This can be done by the content of the document itself, since the strategy model is not required during the import, but the strategy model is only required during the planning or order commitment time. For example, using exemplary 〇IL document content to generate a strategy model '..' . . type and associated policy change hierarchy in the strategy model: .. ...... . . define My Strategy, ... . . . strategies.find_or_create(&quot;TestStrategy&quot;));

MyStrategy.set_description(',Test Strategy&quot;); · . . ..MyStrategy.set_description(',Test Strategy&quot;); · . . ..

My Strategy, changes. ity&quot;);My Strategy, changes. ity&quot;);

My Strategy, changes. find_or_create(&quot;Relax一Quote_Mul tiple&quot;); 72 201017576My Strategy, changes. find_or_create(&quot;Relax-Quote_Mul tiple&quot;); 72 201017576

MyStrategy.changeS.find_or_create(-Report_Allocation —Shortage&quot;);MyStrategy.changeS.find_or_create(-Report_Allocation —Shortage&quot;);

MyStrategy.changes.find_〇r_create(-Report_Atp_Short age&quot;); 儘管展示及描述示範性策略模型,但根據特定需要, 實施例可涵蓋策略模型中之任何數目之策略改變(如上 論述)。 . 在步驟510,訂貨承諾系統11〇自步驟5〇8中產生之 策略模型中之界定序列選擇一策略改變。隨後在步驟 512 ’訂貨承諾系統11〇,且特定而言,需求實現引擎 執行選定策略模型且放寬及最佳化限制,如上文詳細論 述。在步驟514,訂貨承諾系統11〇決定是否放寬此限 制(最佳化限制)藉由提供較佳承諾而解決問題。若否, 則方法前進至步驟516,否則方法前進至步驟518。在步 驟516,需求實現引擎212遞增至下一策略改變,且隨 參後方法前進至步驟510以自步驟5〇8中產生之策略模型 中之界定序列選擇下一策略改變。 在步驟518 ’需求實現引擎212產生原因及解析報告 (下文更詳細論述)’且將報告資料226儲存於資料庫 220中’且方法結束。另外或作為替代與一或多個企 業l2〇a-120n及/或一或多個顧客13〇a l3〇n相關聯之― 或多個使用者可存取報告資料226。另外,儀管第5圖 圖示決定限制及解析選擇來解決訂貨承諾異常之方法的 一實施例,但在不背離本發明之實施例之範鳴的情況下 201017576 可對方法500做出各種改變。 第6圖圖示產生原因及解析報告之示範性方法6〇〇。 方法開始於步驟602,其中需求實現引擎212產生 Create0rder應用程式設計介面(API)。舉例而言,若訂 貨未按時完全經承諾’則CreateOrder API承諾、訂貨且 返回較晚及較短之原因.。另.外’ CreateOrder API包括控· 制需求實現引擎212是否計算原因的標籤 φ GiveReasonsReP〇rt,及指定用以計算原因及解析報告之 策略名稱的標籤 ReasonsReportStrategy。 在步驟604,需求實現引擎212產生GetReas〇nRepc&gt;rt API’其獲得針對已由需求實現引擎212承諾之訂貨的原 因及解析報告。GetReasonReport API假定訂貨不在資料 庫220之報告資料226 (記憶體)中。另外,MyStrategy.changes.find_〇r_create(-Report_Atp_Short age&quot;); Although an exemplary policy model is shown and described, embodiments may encompass any number of policy changes in the policy model (as discussed above), depending on the particular needs. At step 510, the order fulfillment system 11 selects a policy change from the defined sequence in the strategy model generated in step 5-8. The order commitment system 11 is then stepped at step 512 and, in particular, the demand implementation engine executes the selected strategy model and relaxes and optimizes the constraints, as discussed in detail above. At step 514, the order fulfillment system 11 determines whether to relax the limit (optimization limit) to solve the problem by providing a better commitment. If no, the method proceeds to step 516, otherwise the method proceeds to step 518. In step 516, the demand fulfillment engine 212 increments to the next policy change, and proceeds to step 510 with the subsequent method to select the next policy change from the defined sequence in the policy model generated in step 5-8. At step 518, the demand implementation engine 212 generates a cause and analysis report (discussed in more detail below) and stores the report data 226 in the repository 220 and the method ends. Additionally or alternatively, one or more users associated with one or more businesses 12a-120n and/or one or more customers 13a can be accessed to access the report material 226. In addition, FIG. 5 illustrates an embodiment of a method of determining a limit and parsing selection to resolve an order commitment exception, but 201017576 may make various changes to the method 500 without departing from the embodiment of the present invention. . Figure 6 illustrates an exemplary method for generating a cause and analyzing a report. The method begins in step 602 where the requirements implementation engine 212 generates a Create0rder application programming interface (API). For example, if the order is not fully committed on time, then the CreateOrder API promises, orders and returns later and shorter reasons. The external 'CreateOrder API' includes a label φ GiveReasonsReP〇rt that controls whether the demand implementation engine 212 calculates the cause, and a label ReasonsReportStrategy that specifies the name of the policy used to calculate the cause and resolve the report. At step 604, the requirements fulfillment engine 212 generates GetReas〇nRepc&gt; rt API' which obtains the reason and resolution report for the order that has been promised by the demand fulfillment engine 212. The GetReasonReport API assumes that the order is not in the report data 226 (memory) of the database 220. In addition,

GetReasonReport API建立一 UI工作流程,其中使用者 可改變某些供應及分配問題’且隨後再次調用原因及解 •析報告以查看影響。 在一實施例中,GetReasonReport API是准讀的,因此, . 舉例而言,此API為計算新的原因及解析報告而完成之 • 改變在需求實現引擎212中並不持久。另外或作為替 . . . . . ..... . ' _ 代’ GetReasonReport API採用策略之名稱、任何供應及 /或分配改變及完善5丁貨結構之清單(由於需求實現引擎 2U不具有報告資料226中之訂貨,因此此API需要完 . -. . . . . . ... .. . 善訂貨及其反查(pegging ))。另外,需求實現引擎212 . .. . ... ' ' . . · . 傳回在應用供應及/或分配改變之後訂貨可獲得之承 74 201017576 諾,及較短及較晚之原因(若存在)β此外,訂貨之承諾 是僅用於報告目的,且其在需求實現引擎212内不持久。 在步驟606 ’需求實現引擎212產生The GetReasonReport API creates a UI workflow where the user can change some of the provisioning and distribution issues' and then recalls the cause and resolves the report to see the impact. In one embodiment, the GetReasonReport API is read-ahead, so, for example, this API is done to calculate new causes and parse reports. • The changes are not persistent in the requirements implementation engine 212. In addition or as an alternative. . . . . . . . . ' _ Generation ' GetReasonReport API uses the name of the strategy, any supply and / or distribution changes and improve the list of 5 goods structure (due to the demand realization engine 2U does not have a report The order in the data 226, so this API needs to be completed. -. . . . . . . . . . . Good order and its pegging. In addition, the requirements implementation engine 212 . . . . . . ' . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . In addition, the commitment to order is for reporting purposes only, and it is not durable within the requirements implementation engine 212. At step 606' demand implementation engine 212 generates

GetBatchReasonReport ΑΡΙ,其服務與 GetReas〇nsR吓州 • AP【相同之功能’且在需求實現引擎212具有報告資料 226中之訂貨的情況下(在分配計劃或批次訂貨承諾情 形中)使用。另外’訂貨ID足以獲得報告而非完整訂貨 參 及其反查。 在步驟608’需求實現引擎212產生倍數Αρι,其就原 因及解析報告之情形下提交改變至需求實現引擎2丨2。 GetReaS〇nReport API提供評估選擇及承諾訂貨所需之供 應及分配改變。一旦改變為已知且改變是持久的則需 求實現引擎212使用倍數API來做出最終改變。舉例而 言,其具有多個輸入: 1. 移動分配資訊 • 2.更新供應資訊 3. 完善訂貨結構及承諾細節 ... ..... . ........ ..... : . . 此API之輸出含有新的承諾資訊,其中所有改變經提 交至需求實現弓丨擎212。 .: . : ... . . .... . . .... ... …. 在一實施例中’通用情形倍數API可包括由需求實現 ... ...... ... · . . ... . 引擎212支援之API之任何組合,如下文給定·· .. . ......... ' . .... . 1.產生訂貨管理報告_此採用此等輸入中之任一 V 者:': a.訂貨細節――所有此等訂貨之〇M報告 201017576 b·已消耗預報細節 貨的OM報告 已自此預報消耗之所有訂 ❹ c.已消耗Ατρ細節 貨的OM報告 2. 產生分配管理報告-期作為輸入。 3·產生供應管理報告、 期作為輸入。 已自此AT P消耗之所有訂 •產品、賣方及開始/結束日 •產品、賣方及開始_/結束日 4· 取消訂貨 •採用 5· 更新供應--產〇 太 座〇口、賣方、ATP桶及數量作為輸 請庄意供應疋在根本賣方處更新且將分配供給 在輸入中所提供之賣方。 6.·移動分配一—_•產品、备 座00、賣方、預報桶及増加/減少數 量作為輸入。... ,再承諾訂貨―一訂貨結構及承諾細節作為輪入。 8.產生新訂貨—一訂貨結構作為輸入。 2!2 BatchMultiple API ’其具有與倍數Αρι相同之功能,且在需求實現引擎 2 12具有報告資料226 1|7之訂貨的情況下使用。由於批 次需求實現引擎m自資料庫22〇讀取所有訂貨,因此 批次倍數API不在需求實現引擎212中產生新訂貨、 儘管第6圖圖示產生原因及解析報告之方法的—實施 例’但在不背離本發明之實施例之範疇的情況下可對方 法600倣出各種改變。 76 201017576 上述說明書中對「一個實施例」或「一實施例」之參 考意謂結合實施例描述之特定特徵、結構或特性被包含 於本發明之至少一實施例中。在說明書中各處之出現之 片語「在一實施例中」未必全部指代同一實施例。 雖然已展示及描述本發明之示範性實施例,但將瞭 解,在不背離本發明之實施例之精神及範疇的情況下熟 習此項技術者可明瞭對上述實施例之各種改變及修改。 0 因此’本發明不限於所揭示之實施例,而是在不背離本 發明之精神及範疇的情況下能夠具有許多再配置、修改 及替換。 【圖式簡單說明】 所附申請專科範圍中陳述本發明之新穎特徵可信賴特 性。然而,當結合圖式閱讀時藉由參考實施方式將最佳 地理解本發明本身以及較佳使用模式,及其進一步目的 • 及優點,其中: 第1圖根據較佳實施例圖示說明一示範性系統; 第2圖根據較佺實施例更詳細地圖示說明第1圖之訂 貨承諾系統; .. .... . ..., .... . . .. 第3圖根據實施例圖示說明一示範性系統,其包含用 於交付服務之兩個選擇’包括空中運輸模式及道路運輸 模式; .... ... ... 第4圖根據一實施例圖示說明一示範性位置; 77 201017576 第5圖圖示說明決定限制及解析選擇來解決訂貨承諸 異常之示範性方法;及 第6圖圖示說明產生原因及解析報告之示範性方法。GetBatchReasonReport ΑΡΙ, its service is used with GetReas〇nsR ST • AP [same function] and in case the demand fulfillment engine 212 has an order in the report data 226 (in the allocation plan or batch order commitment scenario). In addition, the 'order ID is sufficient for the report to be obtained instead of the full order. At step 608, the demand implementation engine 212 generates a multiple Αρι, which commits the change to the demand fulfillment engine 2丨2 for the reason and parsing report. The GetReaS〇nReport API provides the supply and allocation changes required to evaluate choices and commit orders. Once the change is known and the change is persistent, the demand implementation engine 212 uses the multiple API to make the final change. For example, it has multiple inputs: 1. Mobile allocation information • 2. Update supply information 3. Improve order structure and commitment details... ..... . . ....... . . . The output of this API contains new commitment information, all of which have been submitted to the requirements to achieve the goal. .: . . . . . . . . . . . . . . . . In an embodiment the 'general situation multiple API may include implementation by requirements......... . . . . . . Any combination of APIs supported by the engine 212, as given below.. . . . . . . . . . . . 1. Generate an order management report _ Use any of these inputs: ': a. Order details - all such orders 〇 M report 201017576 b · OM report that has consumed the forecast details has been forecasted from all orders for consumption c. OM report consuming τρ detail goods 2. Generate allocation management report - period as input. 3. Generate a supply management report and period as input. All orders, products, sellers, start/end dates, products, sellers, and start/end dates that have been consumed by this AT P. 4· Cancellation of orders • Use of 5· Update supply - 〇太〇口, Seller, ATP The barrel and the quantity are updated as a supply, and are updated at the base seller and will be distributed to the seller provided in the input. 6.·Mobile Allocation 1 —_• Product, Seat 00, Seller, Forecast Barrel, and Add/Drop Count as inputs. ..., and then promised to order - a order structure and commitment details as a turn. 8. Generate a new order - an order structure as an input. The 2!2 BatchMultiple API' has the same function as the multiple Αρι, and is used in the case where the demand realization engine 2 12 has an order of the report data 226 1|7. Since the batch demand implementation engine m reads all orders from the database 22, the batch multiple API does not generate a new order in the demand implementation engine 212, although Figure 6 illustrates the reason for the cause and the method of parsing the report - the embodiment ' However, various changes can be made to the method 600 without departing from the scope of the embodiments of the invention. References to "one embodiment" or "an embodiment" in the above description means that the specific features, structures or characteristics described in connection with the embodiments are included in at least one embodiment of the invention. The appearances of the phrase "a" While the invention has been shown and described with respect to the embodiments of the embodiments of the present invention, it is understood that various modifications and changes in the above described embodiments may be made without departing from the spirit and scope of the embodiments of the invention. The present invention is not limited to the disclosed embodiments, but can be modified, modified and replaced without departing from the spirit and scope of the invention. BRIEF DESCRIPTION OF THE DRAWINGS The novel features of the present invention are described in the appended claims. The present invention, as well as its preferred modes of use, as well as further objects and advantages thereof, are best understood by reference to the accompanying drawings, in which: FIG. Sexual system; Figure 2 illustrates the order commitment system of Figure 1 in more detail in accordance with a more detailed embodiment; . . . . . . . . . . . . . . . An exemplary system is illustrated that includes two options for delivering a service 'including an air transportation mode and a road transportation mode; .... Figure 4 illustrates an exemplary embodiment in accordance with an embodiment. Sexual position; 77 201017576 Figure 5 illustrates an exemplary method of determining limitations and analytical choices to resolve anomalies in ordering; and Figure 6 illustrates an exemplary method for generating causes and analyzing reports.

【主要元件符號說明】 100 系統 110 訂貨承諾系統 120a 企業 120b 企業 120η 企業 130a 顧客 130b 顧客 130n 顧客 140 網路 142 通信鍵路- 144a 通信鍵路 144b 通信鍵路 144n 通信鏈路 146a 通信鏈路 146b 通信鏈路 146n 通信鏈路 210 伺服器 212 需求實現引擎 78 201017576 220 資料庫 222 策略模型 224 改變資料 226 報告資料 300 系統 310 空中運輸模式 312a 位置1 312b o 位置2 312c 位置3 314a 分配中心1 314b 分配中心2 320 道路運輸模式 400 位置 402a 組件1 402b 組件2 ❹ 402c 組件3 402d 組件4 * 404a 緩衝區 • 404b 緩衝區 406a 中間容量1 406b 中間容量2 408a 交替中間組件 408b 中間組件1 408c 中間組件2 201017576 組件2 408d 交替中 410 緩衝區 4 12成品容量 414成品1 4 1 6交替成品[Main component symbol description] 100 System 110 Order Commitment System 120a Enterprise 120b Enterprise 120η Enterprise 130a Customer 130b Customer 130n Customer 140 Network 142 Communication Keyway - 144a Communication Keyway 144b Communication Keyway 144n Communication Link 146a Communication Link 146b Communication Link 146n Communication Link 210 Server 212 Requirements Implementation Engine 78 201017576 220 Database 222 Policy Model 224 Change Profile 226 Report Profile 300 System 310 Air Traffic Mode 312a Location 1 312b o Location 2 312c Location 3 314a Distribution Center 1 314b Distribution Center 2 320 Road transport mode 400 Location 402a Component 1 402b Component 2 ❹ 402c Component 3 402d Component 4 * 404a Buffer • 404b Buffer 406a Intermediate Capacity 1 406b Intermediate Capacity 2 408a Alternate Intermediate Component 408b Intermediate Component 1 408c Intermediate Component 2 201017576 Component 2 408d alternating 410 buffer 4 12 finished product capacity 414 finished product 1 4 1 6 alternate finished product

Claims (1)

201017576 七、申請專利範圍: ι_ 一種電腦可實施之訂貨承諾系統,其包含: 一資料庫,其儲存與一或多個企業相關聯之訂貨承諾 資料; 一電腦’其與該資料庫耦接,該電腦經組態以: 接收一來自該等一或多個企業之訂貨承諾; 界定一或多個限制; 產生包含一或多個策略改變之一或多個策略模型; 使用該等一或多個策略改變執行該等一或多個策略模 型以放寬該等一或多個限制;及 產生該訂貨承諾之較晚及較短之原因的一報告,且將 該產生之報告儲存於該資料庫中。 鲁 如申請專利範圍第1項所述之系統,其中該等1 =制係選自^下各項組成之群組:小於可装 針特疋位置交付而請求之訂貨,及針對特― 輪模式而請求之訂貨。 及針對特A . .. ' . .... . . · .... .... .... . 3·如申請專利範圍第\項所述之李絲 步經組態以決定該等一赤^ 糸、4,其中該電腦驾 限制。。限制中之任-者是否為 統’其中該電腦進 4.如申請專利範圍第1項所述之系 81 201017576 步經組態以決定該等一或多個限制中之任一者是否為彈 性限制。 5.如申請專利範圍第1項所述之系統’其中談等一或多 個策略改變係選自由以下各項組成之群組: 放寬最小數量; 放寬報價倍數; 放宽選包時間(pick pack time ); 放寬最大邊緣; 放宽許可交付區; 放寬許可交付源; 放寬許可交付服務; 放寬許可匹配產品; 報告分配短缺;及 報告可承諾(available_t〇_pr〇mise)短缺。 ❹ 6.如申凊專利範圍第1項所述之系統,其中該電腦進一 步經組態以針對一已由該訂貨承諾系統承諾之訂貨存取 該產生之報告。 . ' ' .... . ' . ... . ... ... .. 1 . . . . . . - . . . * . . . 申月專利氣圍第1項所述之系統,其中該電腦進-^㈣Μ該等—或多個策略改變提交至該訂貨承諾 82 201017576 8. —種電腦可實施用以提供一訂貨承諾系統的 包含以下步驟」 其 由一電腦接收一來自——或多個企業之訂貨承諾; 由該電腦界定一或多個限制; 由該電腦產生包含一或多個策略改變之一或多個策略 模型; ㈣電腦使用該等-或多個策略改變來執行該等一或 • 多個策略模型以放寬該等一或多個限制;及 一 由該電腦產生該訂貨承諾之較晚及較短之原因的一報 。’且儲存該產生之報告。 ’其中該等一或多 小於可裝運之最 之倍數的訂貨數 ’及針對特定運 9·如申請專利範圍第8項所述之方法 個限制係選自由以下各項組成之群組: J數量之tT貨數量、並非裝運之批量201017576 VII. Patent application scope: ι_ A computer-implementable order commitment system, comprising: a database for storing order commitment information associated with one or more enterprises; a computer coupled to the database, The computer is configured to: receive an order commitment from the one or more enterprises; define one or more restrictions; generate one or more policy models including one or more policy changes; use the one or more Policy changes to execute the one or more policy models to relax the one or more restrictions; and generate a report of the later and shorter reasons for the order commitment, and store the generated report in the database in. Lu Ru applied for the system described in the first item of the patent scope, wherein the 1 = system is selected from the group consisting of: the order that is less than the delivery position of the needle-loadable special position, and the special-wheel mode And the order for the request. And for special A . . . ' . . . . . . . . . . . . . . . . . . . Wait for a red ^ 糸, 4, which is limited by the computer. . Whether or not the restriction is in the case of the computer, where the computer enters 4. The system as described in claim 1 of the patent scope 81 201017576 is configured to determine whether one of the one or more restrictions is elastic limit. 5. The system of claim 1 wherein the one or more policy changes are selected from the group consisting of: relaxing the minimum number; relaxing the quote multiple; relaxing the pack pack time (pick pack time) ; relax the maximum margin; relax the license delivery area; relax the license delivery source; relax the license delivery service; relax the license matching product; report the allocation shortage; and report the promise (available_t〇_pr〇mise) shortage. 6. The system of claim 1, wherein the computer is further configured to access the generated report for an order that has been promised by the order fulfillment system. . ' ' .... . ' . ... . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Wherein the computer enters -^(4) Μ such as - or a plurality of policy changes are submitted to the order commitment 82 201017576 8. A computer can be implemented to provide an order commitment system comprising the following steps: "One computer receives one from - Or an order fulfillment of multiple companies; one or more restrictions defined by the computer; one or more policy models containing one or more policy changes generated by the computer; (4) the computer uses the - or more policy changes to perform The one or more policy models to relax the one or more restrictions; and a report from the computer that produces the later and shorter reasons for the order commitment. And store the report of the production. 'The number of orders in which one or more of them are smaller than the maximum number that can be shipped' and the method for a specific operation. The method described in item 8 of the patent application is selected from the group consisting of the following: The quantity of tT goods, not the quantity shipped ^針對自特定位置交付而請求之訂貨 模式而請求之訂貨。 . . . . .... .... · ^如申㈣_118顧述之錢,魏—步々 二步驟:決定該等W 83 201017576 12.如申請專利範圍第 個策略改變係選自由 放寬最小數量; 項所述之方法’其中該等一或多 以下各項組成之群組: 放寬報價倍數; 放寬選包時間; 放寬最大邊緣;^Orders requested for the order mode requested from a specific location delivery. . . . . . . . . . ^ ^如申(四)_118 Gu said the money, Wei-step two steps: decide the W 83 201017576 12. If the scope of the patent application is changed from the smallest Quantity; the method described in the item 'where the group consisting of one or more of the following: relaxing the quotation multiple; relaxing the selection time; relaxing the maximum edge; 放寬許可交付區; 放寬許可交付源; 放寬許可交付服務; 放寬許可匹配產品; 報告分配短缺;及 報告可承諾短缺_。 A如申請專利範圍第8項所述之方法 下步驟:針對―已由該訂貨承㈣統承^—步包 該產生之報告。 之訂貨’ 14.如t請專利範圍第8項之方法其 驟:將該等—或多個策略改變提交至步包含以下步 以叮貨承諾系統。 體的電觸可讀 體經组態以: J 5 .一種收錄有啟用一訂貨承諾系统之軟 媒體,在執行時使用一或多個電腦之卿 接收―來自一或多個企業之訂貨承 201017576 界定一或多個限制; 產生包含一或多個策略改變之一或多個策略模型; 使用該等一或多個策略改變,執行該等一或多個策略 模型以放寬該等一或多個限制;及 產生該訂貨承諾之較晚及較短之原因的一報告,且儲 存該產生之報告。 16.如申請專利範圍第丨5項所述之電腦可讀媒艘其中 該等一或多個限制係選自由以下各項組成之群組:小於 可裝運之最小數量之訂貨數量、並非裝運之批量之倍數 的訂貨數量、針對自特定位置交付而請求之訂貨,及針 對特定運輸模式而請求之訂貨。 17·如申請專利範圍第15項所述之電腦可讀媒體,其中 該軟體進一步經組態以決定該等一或多個限制中之任一 者是否為硬限制。 . . ..... ... ........ . . .... ' ' - . .... . . ..:...... . . . 18. 如申請專利範圍第15項所述之電腦可讀媒體其中 該軟體進一步經組態以決定該等一或多個限制中之任一 者是否為彈性限制。 . . ...... ..... . . . .... . . . . ' . · ... 19. 如申請專利範圍第15項之電腦可讀媒體其中該等 —或多個策略改變係選自由以下各項組成之鮮組 放寬最小數量; 201017576 放寬報價倍數; 放寬選包時間; 放寬最大邊緣; 放寬許可交付區; 放寬許可交付源; 放寬許可交付服務; 放寬許可匹配產品; ❻ 報告分_配短缺;及· 報告可承諾短缺。 20. 如申請專利範圍第15項所述之電腦可讀媒體,其中 該軟體進一步經組態以針對一已由該訂貨承諾系統承諾 之訂貨,存取該產生之報告β 21. 如申請專利範圍第15項所述之電腦可讀媒體,其中 _ 該軟體進一步經組態以將該等一或多個策.略.改變提交至 該訂貨承諾系統。Relaxing the license delivery area; relaxing the license delivery source; relaxing the license delivery service; relaxing the license matching product; reporting the allocation shortage; and reporting the promised shortage. A. For the method described in item 8 of the patent application. Next step: For the report that has been produced by the order (4). Orders' 14. For example, please refer to the method of item 8 of the patent scope. Steps: Submit the - or multiple policy changes to the step including the following steps to the stock commitment system. The body's electrical touch readable body is configured to: J 5 . A soft media containing a system that enables an order fulfillment, which is executed using one or more computers to receive the order from one or more companies 201017576 Defining one or more restrictions; generating one or more policy models including one or more policy changes; using the one or more policy changes, executing the one or more policy models to relax the one or more Restrictions; and a report that produces the reason for the later and shorter of the order commitment and stores the resulting report. 16. The computer readable medium medium of claim 5, wherein the one or more restrictions are selected from the group consisting of: a quantity less than a minimum quantity that can be shipped, not a shipment Order quantities in multiples of the batch, orders placed for delivery from a specific location, and orders requested for a specific shipping mode. The computer readable medium of claim 15, wherein the software is further configured to determine whether any one of the one or more restrictions is a hard limit. . . . .. ... ........ . . . . ' ' - . . . . . . . . . . . . . The computer readable medium of claim 15 wherein the software is further configured to determine whether any one of the one or more restrictions is a flexible limit. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . The strategy change is selected from the following: the minimum number of small groups is relaxed; 201017576 to relax the quotation multiple; to relax the selection time; to relax the maximum margin; to relax the license delivery area; to relax the license delivery source; to relax the license delivery service; ❻ The report is divided into shortages; and · The report can promise a shortage. 20. The computer readable medium of claim 15, wherein the software is further configured to access the generated report for an order that has been promised by the order fulfillment system. The computer readable medium of clause 15, wherein the software is further configured to submit the one or more policy changes to the order fulfillment system.
TW098133434A 2008-10-10 2009-10-01 System and method to determine root cause constraints and resolution options to solve order promising exceptions TW201017576A (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US10195408P 2008-10-10 2008-10-10
US12/569,813 US20100250306A1 (en) 2008-10-10 2009-09-29 System and method to determine root cause constraints and resolution options to solve order promising exceptions

Publications (1)

Publication Number Publication Date
TW201017576A true TW201017576A (en) 2010-05-01

Family

ID=41393682

Family Applications (1)

Application Number Title Priority Date Filing Date
TW098133434A TW201017576A (en) 2008-10-10 2009-10-01 System and method to determine root cause constraints and resolution options to solve order promising exceptions

Country Status (3)

Country Link
US (1) US20100250306A1 (en)
GB (1) GB2464187A (en)
TW (1) TW201017576A (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103246950B (en) * 2012-10-30 2016-08-03 中国科学院沈阳自动化研究所 Method promised to undertake by the order of a kind of semiconductor assembly and test enterprise
US20150066565A1 (en) * 2013-08-30 2015-03-05 Kimberly-Clark Worldwide, Inc. Systems and methods for managing an inventory of component parts
CN112215531B (en) * 2019-07-12 2023-09-26 北京京东振世信息技术有限公司 Method and device for solving logistics distribution problem
KR102357384B1 (en) * 2021-04-27 2022-02-08 쿠팡 주식회사 A method for managing item shortage and an apparatus for the same

Family Cites Families (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6047290A (en) * 1998-02-20 2000-04-04 I2 Technologies, Inc. Computer implemented planning system and process providing mechanism for grouping and prioritizing consumer objects based on multiple criteria
AU5670099A (en) * 1998-08-03 2000-02-28 Corporate Express, Inc. Customer management system for use with office products supplier
AU2001231157A1 (en) * 2000-01-25 2001-08-07 Bios Group Inc. A method and system for matching bids
US20030208392A1 (en) * 2000-10-27 2003-11-06 Manugistics, Inc. Optimizing resource plans
US6954218B2 (en) * 2000-10-30 2005-10-11 Microsoft Corporation Method and apparatus for high-performance rendering and hit-testing of a window tree
US7552057B2 (en) * 2001-03-02 2009-06-23 Mcgwin Jr James E Method and apparatus for using process exceptions to provide instant notifications for distributed processes
US7216086B1 (en) * 2001-04-30 2007-05-08 Cisco Technology, Inc. Method and apparatus providing a supply chain management system useful in outsourced manufacturing
US20050177435A1 (en) * 2001-11-28 2005-08-11 Derek Lidow Supply chain network
WO2003104990A1 (en) * 2002-06-05 2003-12-18 Sap Aktiengesellschaft Apparatus and method for integrating variable subsidiary information with main office information in an enterprise system
US7577589B2 (en) * 2002-09-25 2009-08-18 Combinenet, Inc. Method and apparatus for conducting a dynamic exchange
US20060155595A1 (en) * 2005-01-13 2006-07-13 Microsoft Corporation Method and apparatus of managing supply chain exceptions
US20070208832A1 (en) * 2006-01-31 2007-09-06 Bea Systems, Inc. RFID edge server allowing configuration updates without restart
US20070299748A1 (en) * 2006-06-26 2007-12-27 Bret Allen Shorter System and method for analyzing service loss within a rotable supply chain
US20080235597A1 (en) * 2007-03-19 2008-09-25 Mor Schlesinger Systems and methods of data integration for creating custom books

Also Published As

Publication number Publication date
GB2464187A (en) 2010-04-14
GB0917197D0 (en) 2009-11-18
US20100250306A1 (en) 2010-09-30

Similar Documents

Publication Publication Date Title
Hedenstierna et al. Economies of collaboration in build‐to‐model operations
US11023831B2 (en) Optimizing a business model of an enterprise
US10387821B2 (en) Quantitative metrics for assessing status of a platform architecture for cloud computing
US10372421B2 (en) Platform provider architecture creation utilizing platform architecture type unit definitions
GCR Cost analysis of inadequate interoperability in the US capital facilities industry
US7991631B2 (en) Managing a multi-supplier environment
Balasubramanian et al. Structural metrics for goal based business process design and evaluation
US8000987B2 (en) Quality model certification assessment cost estimation and optimization
Şen et al. An integrated decision support system dealing with qualitative and quantitative objectives for enterprise software selection
US20170061348A1 (en) Platform architecture planning process utilizing platform architecture type unit definitions
US20100082380A1 (en) Modeling and measuring value added networks
Kasi Systemic assessment of SCOR for modeling supply chains
US20080300946A1 (en) Methods, systems, and computer program products for implementing an end-to-end project management system
US8195504B2 (en) Linking service level expectations to performing entities
US20150120370A1 (en) Advanced planning in a rapidly changing high technology electronics and computer industry through massively parallel processing of data using a distributed computing environment
US20080228822A1 (en) System and method for country of origin compliance
WO2019118498A1 (en) Interactive system for optimizing logistics in moving items from a first location to second location
TW201017576A (en) System and method to determine root cause constraints and resolution options to solve order promising exceptions
WO2010077512A2 (en) Dynamic data processing applications with data phasing and work management
Martinez et al. Optimizing employee time in a purchasing department: a Six Sigma case study
Mahmood et al. RE-UML: A component-based system requirements analysis language
US11126941B1 (en) Workforce design: direct and indirect labor planning and utilization
Vorisek et al. SPSPR model-framework for ICT services management
Mahdavi Pajouh et al. A specialty steel bar company uses analytics to determine available-to-promise dates
Wohlers et al. A Domain-independent Model for KPI-based Process Management