Title of Invention

SUPPLY CHAIN MANAGEMENT SYSTEM DETERMINING WHETHER ORDERS RELATED TO A FAMILY OF PRODUCTS CAN BE PROMISED

Abstract

SUPPLY CHAIN MANAGEMENT SYSTEM DETERMINING WHETHER ORDERS RELATED TO A FAMILY OF PRODUCTS CAN BE PROMISED A SUPPLY CHAIN MANAGEMENT SYSTEM PROCESSING ORDERS RELATED TO A FAMILY OF PRODUCTS. AN USER MAY PROVIDE A PARAMETER REFERRED TO AS 'AGGREGATE TIME FENCE' (ATF) DURATION REPRESENTING AN AMOUNT OF ADVANCE TIME DURATION AFTERWHICH AGGREGATE SUPPLY OF ALL MEMBER ITEMS IS AVAILABLE TO SATISFY THE DEMAND FOR ANY MEMBER ITEM. FOR ILLUSTRATION, IF AN ORDERFOR A MEMBER ITEM IS RECEIVED WITH A REQUIRED DATE BEING AFTER THE ATF DURATION, THE ORDER CAN BE PROMISED EVEN IF THE REQUIRED QUANTITY OF THE FIRST MEMBER ITEM IS NOT SCHEDULED TO BE AVAILABLE AT OF THE REQUIRED DATE, PROVIDED SUFFICIENT NUMBER OF UNITS OF OTHER MEMBER ITEMS ARE SCHEDULED TO BE AVAILABLE AS OF THE REQUESTED DATE. THUS, ORDERS ARE PROMISED TAKING ADVANTAGE OF SIMILARITIES IN RESOURCE REQUIREMENTS OF MEMBER ITEMS.

Full Text

SUPPLY CHAIN MANAGEMENT SYSTEM DETERMINING WHETHDER ORBERS RELATED TO A FAMILY OF PRODUCTS CAN BE PROMISED Bftckgronnd of the Invention fidd of the Invmtion The preset invration relates to digital processing systems implmieiited to support supply dhain manag^nrat^ and more ^)ecificaUy to a method and q>paratus for detennining wfaetfier orders related to a &mify of products can be promised. ReUtedArt Siq>pl^ diain management (SCtA) systems g^iarally reiet to digital processing systems wfaidi enable one to plan/det^mine tiie availability of various products at the right time» in the right place, and in right conditioa SCM systems are oftei used in manufacturing plants to reduce invmtories at various levels, i.e., compon»ts used to build products; products shipped to the next party (e.g., retails) in &e supply diain, etc., as is well knovm in the relevant arts. One common application of SCM systems is to determine whether an order can be promised or not As an illustration, a purdias^ may wish to purchase 1000 units to be delivered on a ^>ecific future date, and the SCM system may need to indicate whether die quantity and deliv^ date requironents can be met based on tiie status of availability of various resources (e.g., componmts), and die time required at each stage to produce the product from the available resources. Manu&cturingopoations often produce a &mily of products. A &mily of products generally refers to a groiq> of products whidi share similarities in t^ms of resource requir^nmts. For example, an op^ation m^ manu&cture Pq>si, Mirinda, and Sprite (eadi product being refined to as a memba of die &mily), ^;^ch use similar compon^its sudi as botdes of same shape, caps of same physical makeup (but with difii^mt label/color towards the rad), liquid, etc. In geiaetal^ die components share similar features to some extrat, but could differ (e.g., in color, logo, etc.) depending on the specific membtf in which die It may be desirable that a SCM system take advantage of such commonalities in detomining vdiether orders can be promised or not Snmmaiy An aspect of the present invmtion cables orders for member items of a&mily of products to be promised by taking advantage of similarities in resource requirements of membtfitems. In an anbodim^t a computo-syston (digital processing syston) is operable to receive a time foice (TF) duration associated \vi& eadi member item in relation to a firrt member item. The TF duration represents an amount of advance time duration after v^di ftic sapply of tiie corresponding member item is available to satisfy tfie dooand for said first member item. In one implonentation, the TF duration is equal for all pairs of mraiba itons and is referred to as agg^ate time fetkcc (ATF). The ATF duration is tiien used to promise orda^ potaitially based on aggr^ate availability of all member itmis (family of manba itans) in Ae postrATF duration* For illustration, it is assumed Aat a first ord^ is received ^>ecifytng afirst quantity of Ac first member it«ti and a first required date, who'ein the first required date is after the ATF duration fi'om a time &e first ord^ is received, and v^^ein only Qavail units of the first member item arc sdieduled to be available as of the first required date, v^^ein Qavail is less than tiie first quantity. The computer systan determines whedia' at least tfie first quantity of all of the member items (including &e first manbar item) is sdieduled to be available as of die first required date. If such quantity is available, die computer syst«Q promises the first order. Furdio* features and advantages of the invention, as well as the structure and operation of various onbodimaits of the invoition, are desoibed in detail below with r^erence to the accompanying drawings. Iti tiic drawings, like reEercnce numbers generally indicate identical, functionally similar, and/or structurally similar elements. The drawing in which an element first appears is indicated by the leftmost digit(s) in the corresponding reference numb^. Brief Descrq>tion of the Drawings The preset invaition will be desoibed with referoice to tiie accompanying drawings briefly desmbed below. Figure (Fig.)l is a block diagram illustrating an example environmoit in wfaidi the present invention can be implemrated. Figure 2 is ablodc diagram illustrating an onbodiment of an order processing blodc in^lemented substantially in the form of a software controlled digital processing systm according to an a^>ect of tiie present inventioa Figure 3 is a flow-chart illustrating the manner in ^^^ect of pres^it invmtion. Figure 4A, 4B and 4C are portions of a flow-^iart v^ch togetfa^ illustrate the maimer in \\iu(^ orders rdated to a fainity of products can be processed in an onbodi^ of tiie pres»t invoitioa Figure 5 is shown contaiziing a table iUustniting &e status of differmt variables ^^ receiving afirst order assuming diere are onty two member items in a fanuly of products. Figure 6A is shown containing atable illustrating &e status of differait variables after a first ord^ for a first member iton is promised, wi& die first ordo^ having a required date before the ATF point Figure 6B is shown containing atable illustrating the status of difiTi^^it variables after a second ord^ for a second m^nb^ item is promised, with the second ord^ also having a required date before the ATF point Figure 7 is shown containing a ts^le illustrating &e status of differrat variables after athird ordo* for afirst m^nb^ item is accepted, with &e third order having a required date afte the ATF point, and vwth the required quan% not being sd^ required date. Figure 8 is shown containing a table illustrating the status of difiT^mt variables after a fourtti ordo^ for a second manbo-item is promised, with the fourth order lulling a date aft^ the ATF point, and witib the required quantity not being sdiediiled to be availa^ on tibe required date. Figure 9 is shown containing a table illustrating tiie status of difiermt variables after a fiftti order for a first member item is accq>ted, with &e fif& order having a require before the ATP point, and with the required quantity not being sdieduled to be available on tiie required date. Figure lOisshowncontainingatableillustratingfheprocessingof anorder, promised earlier using units (of a monber itmi) vMdk are sdieduled to be available within ATF duration, vAidti is now unsdieduled Figure 11 is shown containing a table illustrating die processing of an order, promised eadier using units (from £sanify availability) vAd^ are sdieduled to be available after ATF duration, vMdk is now unsdieduled. Detailed Descriptioii of The PrefiNTed Embodiments According to an aq)ect of tiie present invcaition, a digital processing system (herea&et ^SCM system"*) supporting supply diain managemrat (SCM) det^mines whether an order related to afamily of products can be promised. An user m^ provide a parameter referred to as 'aggr^ate time fence* (ATF) duration rqiresrating an amount of advance time duration afteru^di aggn^ate siq)pty of all mmiber items is available to satisfy the demand for any mmibtf itaxL In otiier words, wi&out sudi advance notice, it may not be possible to diange course so as to manufacture units of tiie anotiier membtf item using tiie units of the one membo- ttrai already in die process of being manufactured. Thus, whoi tiie desired quantity of a member item is not available as of a requested date (^^di is afto* tiie ATF duration) s^iecified in an otder^ tiie SCM ^stem examines the aggr^ate of sdieduled supplies of all membo- itcans on the requested date, and indicates that the order can be promised if the desired quantity of the member item can be supplied using sudi available supplies (of all the meoihcr items). As a result, an ospect of the pres»t invention takes advantage of die similarity of resource requirements/usage of tiie m^nbos of Ac &mily to efiGciently use all the available units of die members of die &mily to promise ord^s. Anodier zspcct of die pres»t invmtion pre-computes data representing the aggr^ate quantity available for all members of the family eadi day afitf die ATF point (i.e., the d^ after die ATF duration from a presnt day). Sudi pre-conq)uted data enables a SCM Systran toquid^detefmine^etherorderscanbeprocessed. The resulting features are particularly useful in oivinmments in v/bidk a large number of items are preset in a iamiy of interest Several a^>ects of die invention are desmbed below with reference to examples for illustration. K should be understood that numerous ^>ecific details, relationships, and me&ods are set forth to provide a full understandiiig of the invention. One skilled in die relevant art, howev^, wiU readily recognize that die invttition can be practiced v^thout or more of die S9>ecific details, or with other mediods, etc. In other instances, well-known structures or operations are not shown in detail to avoid obscuring the invoition. 2. EzAmpleEnviroiimeat Figure 1 is a blodc diagram illustrating die details of an exanqile eavironmcat in vAnck die presrat invmtion can be implemmted The blodc diagram is shown containing cUent syst«u( 110-A dirough 11 (>-l^ intmietlSO, order processing systrai 150, and data^^ servers 160-A dirough 160-K. Eadi blodc: is desmbed below in detail It should be und^^tood diat oiily r^resratative example components are shown in die diagram so as not to obscure various features of the presoit inventioiL Howevo", it will be ^paroit to one skilled in die relevant arts that mvironments may contains scvetdl odi^ (bodi in number and type) components, v^thout dqiarting from the scope and spirit of various aq)ects of &e presmt invention. Intonet 130 provides connectivity between cliait systems 110-A through 110-M and ord^processing system ISO. Jntcmdt ISO may contain several devices (e.g., bridges, routers, modmis, commimication links» etc.,) opiating according to protocols sudi as TCP/IP well known m the relevant arts. Ebwever, odier forms (e.g., point-to-point private network using proprietary protocols or ATM-based network) can also be used to provide connectivity between tiic client systems and the ord^ processing system. Client systems 110-A through 110-M enable usets to place an order for a desired quantity of amember item of afsonily by a desired date, and to receive reqK>nse indicating whedier a provider (e.g., a cotapaoy manufacturing the memba item) promises to fulfill the order by the desired date. Client systems may be implemmted using computer systems available from businesses sudi as Ddl, Compaq, Sun Microsystems, etc. Database servers 160-A through 160-Kprovidearq)ository for storing various pieces of information (or data) mdi as die member items in eadi £amily, the sdieduled sq>ply of member it^ns for eadi day, ordets promised, etc. Some of tiie pieces of information may^ be generated from otiber systems, and stored in database servers 160-A Arough 160-K. Database servers can int^rated with order processing system 1 SO as a single unit In addition, database servers 160-A tiirou^ 160-K may store various pieces of information goierated by order (»x>cessingsyst^n ISO \i^epn>mising orders received from clientsystonsl 10-A through 110-M. bigaiaal,thedatabaseserversallowdatatobestored and retrieved using structured qumes, and m^ be implemented in aknown w^ using one of several conmiacialty available database products from conq>anies sudi as Oracle, IBM, Mio'osof^ etc. Orda processing system ISO may implaaetA a supply duiin manag^nent (SCM) system vAidk determines v^etiier an ord^ for a desired quantity for a member of a product £aimly for a desiied date can be promised or not. In general, order processing syst^n ISO receives an order £rom one of tfie clirat systrais from Int^net 130, and graoates a response indicating wfaedno* tiie ord^ can be promised or not Themann^in v^di ordo*processing syst^n ISO may geneirate aresponse according to various aq>ects of the present invration is desoibed below in further (ktail with sev^al examples. First, Ike mann^ in \Aiich an onbodiment of order processing systrai ISO is in^lemented substantially in the form of a sofiware^drtven digital processing system is desmbed in below. 3. Software-driv^ Imidaneiitadoii Figure 2 is a blodc diagram illustrating the details of order processing system ISO inq)lemented substantial^ in tfie form of software in an oibodiment of tiie preset inventioa Order processing system ISO tx^ omtain one or more processors sudi as processing unit 210, random access memory (RAh^ 220, secondary memory 230, gr^hics controller 260, di^lay unit 270, network inter&ce 280, and ir^ut inter&ce 290. AU Ibe components except di^l^ unit 270 m^ communicate with each otiiCT over communication padi 2S0, vMdk may contain sev^al buses as is well known in the relevant arts. The con^nmts of Figure 2 are desmbed below in fiirdier detail. Processing unit 210 m^ esoccatc instructions stored in RAM 220 to provide several features of the jmsent inventioa Processing unit 210 m£^ contain multiple processors, with eadi processor potmtially being designed for a sped&c task. Aheraatively, processing imit 210 may contain only a single processor. RAM 220 m£^ receive instructions and data from secondary monory 230 and network intcdace 280 using communication path 2S0. Gn^hics controlltf 260 gmerates dispU^ signals (e.g., in RGB format) to Ssp\zy unit 270 based on dataAnstmctions received from Processing unit 210. Display unit 270 contains a di^l^screra to di^lay the images defined by the diq)l^ signals. Input int^fice 290 may correspond to a kev-board and/or mouse, and eenerallv oiables a us^ to nrovide various inputs (e.g., ATF duration). Network interface 280 enables some of the inputs (and outputs) to be provided on a network and also to intoface with database servers 160-A trough 160-K, DispkQT unit 270, input interface 290 and network interfece 280 nuqr be implemented i^ a known way. Secondary memory 230 may contain hard drive 235, flash m^nory 236 and ronovable storage drive 237. Secondary memory 230 may store the data (e.g., ATF duration, mmber items in a&mily, supply of eadi member tton in each 6ay^ etc.) and software instructions v^cesstng qrstem 1 SO to provide several features in accordance wi& &^ present inventioiL ScHue or all of the data and instructions nuiy be provided on removable storage unit 240, and &e data and instructions m^ be read and provided by removable storage drive 237 to processing unit 210. Floppy drive, magnetic ts^drive^ CD-ROM drive, DVD Drive, Flash memory, removable memory chip (PCMCIA Card, EPROM) are exan^les of sudi removable storage drive 237. Ronovable storage unit 240 may be implemoited using medium and storage format compatible witii removable storage drive 237 sudi tiiat removable storage drive 237 can read the data and instructions. Thus, ronovable storage unit 240 includes a computer readable storage medium having stored tisercin computer software and/or data An cmhoSmeat of the pres^it invmtion is implemented using software rurming (that is» executing in order processing syston ISO. LI this document, tiie term *^computCT program producf is used to goierally refer to removablestorageunit240orharddiskinstalledinhard drive 235. These compute program products are means for providing software to ord^ processing system 1 SO. Proces^ng unit 210 may retrieve &e software instructions, and execute the instmctions to provide various features of die preset invration as described below in detail. The desoiption is continued wi& re^>ect to examples illustrating a marmer in vAddk several aspects of the presoit invoition m^ be implraimted. 4* Promisiiig an Ordtr When the Expected Quantity Availability of a Member Item is Lett Than Desired Qnaatlty Figure 3 is a flow-diait illustrating &e mann^ in wdudb an order for a m^nber item can be promised according to an a^>ect of presoit invoition even if quantity expected to be available is less than die desired quantity indicated by an order. The flow-chart is described widi reftf^ce to Figures land 2 for illustration. Howev^» the method tjozy be implem^ted in oth^ environments as well. The mediod begins in step 301 in whidi control immediateiy passes to stq> 310. In 8tq> 310, order in-ocessing system ISO receives data indicating the monbers of a product &mily» die ATF duration, and the quantity of siq^ly on eadi d^ for each member itmt Merdy for simpUcity, it is assumed dutf the ATF duration with req>ect to any pair of member items is equal. Ifowever, the ATP duration can be difiTerent for difif^mt ordered pairs of member items, whidi could be the case if die d^ree of similarity (in resource usage) is d&ffereat for diffactA ordered pairs. The in^)lemaitation of order processing system 150 widi sudi di£ferent ATF durations will be £^parait to one skilled in the relevant arts by reading the disclosure provided herda In step 330, order processing system ISO receives an order indicating required quantity (Qreq) of a q>ecific memhct item and a required date P&eq), widi the required date being after ATF duration from the present time. Such a data nu^ be sent by a user using one of climt systems before promising a customer diat die required quantity can be supplied on a required date. Altemativety, the customer nu^ be provided the ability to send the order directly to order processing ^stem ISO. In stqp 3S0, order proces^ng system ISO det^mines\\4iedier sufiBdent quantities of otho- monber itons (of the £amity) are sdiedided to be available after the ATF duration but by the requested date (Xreq). Order processing system 1 SO g^ierates a signal indicating that &e order can be promised if sudi suffident quantities are determined to be available. Assuming that QSx rq>resCTts the quantity of die ^>ecific member it^ns expected to be / [ available as of the required date, at least (Qreq - Qbc) items need to available a&cr the ATF duration from otiber monbtf items, but by the requested date pCreq). The me&od ends in step 399. While &e approach of Figure 3 p^tains to orders with required date vAdch is aft^ the ATF duration and with the required quantity being more than the quantity available as of the requested date, sudi approadi needs to operate integral to gmeral order processing. Some features of sudi a goieral order proccssmg approach in one embodim«t are desoibed below in further detail. First, tiie terminology onployed in such an embodiment is briefly noted. 5* Tavittology The tenninology (v^di in turn illustrates the computations) en4>loyed in an embodiment is briefly desmbed below. The manner in vAddk eadi item of the taminology can be determined (or computed) is desoibed in expropriate portions of the below sections witii reference to Figures S du'ough 10. TF (Time Fence) Duration: As noted above, repres»ts an amount of advance time duration after vMch &e si^pty of one monber item is available to satisfy the demand for another member item. ATF Duration: Assuming the TF duration is equal for all pairs of m^nbo* items, the TF duration is referred to as ATF duration since die aggr^ate supply of all m^nber items is available to satisfy the demand for aiqr m^nber iton after tfie ATF duration. ATF Point: ATF duration counted from tiie presottt day (Ihe date in vHbich an order is received). In tilie illustrative eswaples desoibed below, the ATF point is shown between the 5^ and 6^ days corres^nding to ATF duration of 5 d^^s. Item simply: It is tiie total number units of an iton that are sdieduled to be available on tiie corre^nding day. In the illustrative example, it^n simply correi^nding to each of &e items A and B b assumed to be 10 units p« day, as depicted in row^ the ATF duration) in Figure 5, licm donand: It is tiie total numbw of units of an item that are required to be delivered on a q)ecified day in view of the committed orders, irres9>ective of whether sufficimt simply is available or not It^n draiand is updated in re^nse to each order as desmbed in sections below with exan^les. Item Budceted Allocation: The sum of tiie allocations on tiie given day in response to the demand for tiie sped&c item witfiin or after the ATF duratioiL It^n bucketed allocati Net item ayailable: Iton siq>pty less item budceted allocation on that day. Badcward consumption: Backward consumption for a ffvca day equals the number of units (quantity) of the item consumed from prior days to satisfy shortage of supply on the given d^ less the number of units made available to satisfy shortage of siq>ply in friture d^s. Forward consun^on: Forward consumption for a given day equals the number of units (quantity) of &e item consumed from future days to satisfy shortage of supply on the given day less the number of units made available to satisfy shortage of sq>ply in prior days. Pres^ ban availability: Rq)resents the number of units (quantity) of the item available for friture orders in view of all tiie committed orders, aiul equals the net item available plus (forward consun4>tion+badcward consumption). Present it^n availability is applicable only before ATF point Cumulative item availability: For agiven day before ATF point, equals aggregate of present item availability up to the given day. For agiveo day after ATF point, the cumulative item availability of the item at ATF point plus sum of presmt item availability of all the items in the femily after ATF point up to the given day. Family simply: Aggr^ate of iton si^plies in tiie product family in the corresponding (ky. For example, in Figure 5, the family siq>ply is equal to 20 on each day (10 units from tnembct'A an410 units from monber-B). Family budceted allocation: Rq>resmts the numbw of units allocated for &e ^>ecific date from the pool of units generated from all items of the fronily. Family bucketed allocation is f^^licable after ATF. Net family available: Family suppfy less funily budceted allocation on that day. Presoit Family availability: Rq>re8ents tiie number of units of the ratire family available for future orders in view of all the committed orders^ and equals net family acvailability plus (forward consunq>tion + badcward consumption). Preset Family acvailability is ^plicable only B&et ATF period. The manner in vAdak ordets can be promised using tiie concq>tual basis underlying sudi terminology is desoibed below witii several examples below. 6. Processmg Ordttv Figure 4A, 4B and 4C are portions of a flow-diart \Adch togetha* illustrate a manner in whidi eadi order related to a frunify of products can be processed in an onbodime^t of ^^ presoit invmtioa The flow-duut is ^lit into separate Figures 4A» 4B and 4C merely for clarity. The metfiodb^ins in stq)401inwfaidi the control immediately passes to step 410. MA refo-ence to Figure 4A, in stq> 405, ord» processing system 150 receives an order containisg required quantity (Qreq) and required date (Kreq) represrating an item demand coiresponding to a member ("ord«cd iten'*) of the product femily. The item demand for a member of tiie product &mily tnay be provided by an user (e.g., a sales pason/custom&t) to determine the availability of units corres^nding to a member item. In stq) 410, ordaprocessing ^stoi 1 SO receives dataindicating aggregate time fence (ATF) duration, siq>ply-danand up to ATF point for the requested it^n, and aggregate si^ply-demand after ATF point In step 420, order processing ^stem 150 determines cumulative item availability for the requested member on eadid£^beforeATF point using fM-esent item availability. Instep 425, order processing gystem 150 determines the cumulative item availability for the requested member on eadidf^ after ATF using presmtfunity availability. An availability diagram is buik using 8iq[>plies, present availabilities, cumulative availabilities etc. In stq) 435, order processing system 150 compare the ATF point widx &e required date to detemune ^e&er Xreq is within Ike ATF duration (from the present date). Control is transferred to step 437 (of Figure 4B) if the condition is true, otherwise to step 470 (of Figure 4Q. Thus, control is transferred to Figure 4B if the required date (Xfeq) is within the ATF duration and to Figure 4C odierwise. Wi^ reference to Figure 4B, in step 437, order processing system 150 determines the cumulative item availability of the ordered item on Xreq (QLc) using the computations performed in step 420. In step 440, order proces^ng system 150 detomines \^ether the required quantity (Qreq) is less tium or equal to cumulative item availability (QIx) on Xreq. Control is transferred to step 445 if the condition is true, otherwise to st^ 449. Jn step 445, ord^ processing system 150 allocate Qreq (required quantity) on Xreq (required date). As m£^ be appreciated, the allocation is based on availability of the requested quantity (Qreq) of the ord^ed item only, since tiie requested date (Xreq) is within the ATF duration Control is thai transfored to stq> 497 via coimectorF. In stq> 449, cumulative item availability (Qatf) at ATF point for the requested item is detennined. Jn stq> 450, order processing systmi ISO detennines whetha* the required quantity (Qreq) is less than or equal to cumulative item available on ATF (Qatf). Control passes to stq> 4S1 if the condition is true, o&owise to stqp 459. In stq> 451, ord^ processing system 150 detomines i^^iether an override flag is set associated witfi die order. The override flag associated widi an order indicates tiiat attempt should be made to process tiie order as of tiie requested date. J£Ae flag is not set, the day (Xatp) on vMA Qreq is available is determined. In general, the fulfillment of tiie order is delayed till Xalp if override flag is not set associated vnAx an order, compared to scenarios if tiie flag is set Example q>proaches on how to im>cess an order in Ihc case of different values for tiie override flag, are described below. Control passes to stq) 452, if tiie condition (override flag being set associated with the order) is tru^ otiierwise to stq> 453. In stqp 452> Qreq is allocated on Kteq and tiie control is transfored to step 483 via cormector G. As desoibed below widi reference to Figure AC, Hit ordo* is being accepted with potential^ tiie requested date pCreq) not being met (unless some of the ord^^ become unsdieduled lata-). In stq> 453, order processing system 150 detomines the day (Xatp) on v^ch Qreq is available. Jxk stq> 455, order processing systmi 150 determines v^^eth^Xa^ is within an accq>tablewindowfromtiierequesteddate]&eq. bi an embodiment, while placing an order, the user is provided tiie option of specifying a ruimber of d^s fix>m Xreq, whidi would be accqytabletotheuser. Thus, control passes to stq) 456 ifXa^ is witiiin such an acceptable window, and othowise to stq> 498 via connector E. In stqp 456, order processing system 150 allocates Qreq on Xa^. In stq> 459, ord^ processing system 150 detamines ^edi» a override flag is set associated with the otda. The ov^ride flag associated with an order indicates that attempt should be made to process the ordo" by allocating from family availability to meet the shortage in fulfilling Qreq. Control passes to step 463 if Ac condition is true (ov^de flag setX otiiov/iseto stq> 460. Stq) 460 is readied if suffici»t quantity is not available as of bo& the ATF point (as in stq> 450) and requested date (st^440X and ovenide flag is not set (step 4S9). In step 460, order processing system 1 SO determines tiie day pCatp) (available to promise) on v^ch Qreq of the ordered item is available^ and tiie corre^nding cumulative hem availability (Qa^) on that day. Jn 8tq> 461, ord^ processing system ISO determines vihtQiet Xatp is witiun an accqytableivindowfiomtherequesteddateXreq. In an embodiment, ^vhile placing an order, the user is jnovided the option of specifying a number of d^s from Xreq, vA^ch would be acceptable to tiie user. Thus, control passes to stq> 466 ifXa^ is within sudi an acceptable window, and otherwise to stq> 498 via connector E. In step 466, order processing system 1 SO det^mines Aether the C^req of the ordered item is available based on surplus cumulative item availability bctwera tixe ATP point (Xa^)and the ATF point by conq>aring Qreq with (Qa^-Qatf). Control passes to step 467 if Qreq is less than (Qaip - Qatf), otherwise to stq> 464. In stq> 464, order processing system ISO allocates (Qatp - QatQ on Xa^ and the remaining quantity ((^req - Qatp+QatO on tile last d^ of ATF duration and control pass^ to stq> 483 via connector G. In stq> 467, ordo* processing systm ISO allocates Qreq on Xatp and control passes to stqp 483 via connector G. Now continuing &e desmption wiA reference to Figure 4C, it is first noted that connector B passes control to stq> 470 in case tiie required date (Xreq) is after the ATF poin^ hi step 470, order processing syston ISO det^mines the cumulative itmi availability (Qbc) on the requested date p&eq) using present item awailab^^ presmt &mily availability aAct ATF. As noted above, &c cumulative item availability of the ordtfed iton on a d^ after &e ATF point equals the cumulative itmi availability of the item at ATF point plus sum of presesit item availability of all &e items in the family afler ATF point up to %^eq. In step 47S, order processing system ISO detomines i^ettier Qreq is less than or equaltoQbc Control is transferred to stq> 480 ifsudi a condition is true, oth^ivise to step 485. In stq> 480, a determination is made as to Aether Qreq is less tiian or equal to (QIx-Qatf). Control is transferred to stq) 481 if such a condition is tni^ otherwise control is transferred to stq> 482. ^ step 481, order processing system ISO allocates Qreq on ]&eq. In otiier words, the quantity is aUocated fix>m tilie units available fiom tfie entire fionity afbr t^^ By mch an allocation, the units available in tfie ATF duration can potratially be used to |m>mise orders with required dates witfiin ATF duratioa Control is then transferred to step 497. In stq> 482, order processing ^stem ISO allocates (QJx - Qatf) on Xreq and the ranainingrequiredquantity(Qreq-QIx+Qatf)(mtfielastdayoftfaeATFduration. Again, as in stq> 481, as maay units as possible are allocated first from die aggr^ate number of units available from the entire family, and onty the remaining units are allocated from the available quantities of &e sped&c ordered item. Control is then transferred to step 497. In stqp 48S, order processiog system ISO determines \^edier the item d^nand is ovoridden. Control is transferred to stq> 491 if the condition is true, otherwise to step 492. bi stq> 491, order processing system ISO allocates (Qreq - QatQ on Xreq, and Qatf on ATF, maintaining the allocation dates close to required date (Xreq) as desoibed above. Control is thai transfored to stq> 483 via connector G. Jn step 492, order processing system 150 detmnines ATP date (Xaip) and &e corre^nding cumulative item availability (i.e., Qatp), as desoibed above with reference to step 460. In stq> 493, ord^ processing system ISO detmnines vdiethw Xa^ is within an accq>table window from the requested date Xreq. In an embodiment^ while placing an order, the user is provided the option of specifying a number of days from Xreq, ^^ch would be accq)table to the usa. Thus, control passes to stq> 494 ifXa^ is within such an acceptable window, and otherwise to step 498 via connector E. In stq> 494, order processing system ISO determines whether Qreq is less than or equal to (Qa^ - Qatf). Control is transferred to stq> 49S if die condition is true, otherwise tostq>496. bi8tq>49S,wder processing system 1 SO aUocates quantity Qreq on ATP date Xa^, and die control is transferred to stq> 483 via connector G. Inst^496, ord^ processing system 1 SO allocates a quantity of (Qa4>-Qatf) on Xreq, and (Qreq-Qa^ -K^atf) on Xatf and control is then transferred to stq> 483 via connector G. In stqp 483, order processing system ISO mables the order to be accepted, possibly by indicating (corre^K>nding Xatp date) tiiat tiie ordo* is likefy to be dek^ed. In step 497, order processing systod ISO indicates that the order can be promised (or promises the order). In step 498, order iMX>cessing gystem ISO rejects (i.e., no promise, no accq>t) the order. The method »ds in stq> 499. Thus, die q>proad)ies of above can be used to process orders according to various as;>ects of die i^esent invention. Jn gmaal, order processing system ISO needs to perform several coniputations and keq> trade ofseveral variables v^e processing die ord«^. Some exan4)le8 are provided below widi reference to Figures S-10 illustrating sudi computations and variable values as successive orders are processed in an example embodimmt The start state in sudi an embodimoit is desoibed first widi referoice to Figure S. 7. Start State Figure S contains a table illustrating a start state assuming diat no prior orders are received merely for illustration. Table SOO contains numbos assuming that there are only two monber items (item-A and item-B), eadi with a corres^nding daify it^n-suppty of 10 units^ and \vith a ATF duration of S d£^s. Table SOO (as are tables of otho* Figures 6A, 6B, 7-11, but with different row numbers) is shown containing rows &mify siq>pty 570, ^mily budceted allocation 571, net &mily available 572, badcward consumption 573, net + badnvard con5unq>tion 574, forward congimption 575, and present Haanfy availability 578 for the oitire famify of products. Table 500 further contains item s^>ply-A 580, item demand 581, hem bucketed allocation 582, net item-a available 583, badcward consumption 584, net + backward consumption 585, f(»ward consun^on 586, pteseot item-A availability 588, and cumulative item-A available 589 for ttem-A. Similar rows 590-596 and 598-599 are shown for item-B. Only various rows of interest are described vAAk rrference to each table below merely for conciseness. As ATF duration is indicated to be 5 days, die ATF point is shown between days 5 and day 6 wi& a dark line. The entries correq>onding to budceted allocations (rows 582,592 and 571), badcward consumption (rows 573,584, and 594), forward consumption (rows 575, 586,596), item demands (rows 581 and 591) are shown with 0 value as no ord^^ have been processedyet Famify supply 570 is shown containing 20 units for each day^ rc^esmtixig 10 units of si4>ply for each member item shown in rows 580 and 590. Present tt^n availability (rows 588 and 598) is shown as 10 units in eadi day. Cumulative item availability (589 and 599) is shown witii ino-emmts of 10 (i.e., 10, 20, 30, 40 and 50 in the five days re^>ectivefy) in successive entries before ATF date. However, afte* ATF date, Ac cumulative it^i avaik^ility (589 and 599) is shown with values of 70, 90 and 110 req>ectively rq)res»ting the cumulative item availability at the ATF point plus tiie preset fiunily availability 578 in eadi entry. The maimer in v/fai 8« Procetting Orders When the Required JUdt is Within ATF Duration and the Requu^ Quantity of Ae Orda*ed Item is Scheduled to be Available For illustration^ it is assumed that an order for 30 units of item-A wi& arequired date of d^ 3 is received vvhen the status is rq>resented by Figure S. The manna^ in >^ch the order is processed is described widi combined refermce to Figures 1,4A, 4B» 4C and 5 for illustration. As may be readily ^ypreciated, order {vocessing gystem ISO determines that the required date p&eq) is \vithin the ATF duration (smce Xreq is less tiian Xatf) in step 43S. Control accordingly passes to stq> 437» in vvhidi wder processing system 150 examines cumulative item availability S89 on ds^ 3 (having a value of 30) to determine tiiat sufficient quantity of die ordered item is sdieduled to be available to promise tiie order. Accordingly, order processing system ISO may promise the order. tt m^ be £^predated that the order of above is promised based on a single look-up of the relevant table/data> aiul widiout requiring substantial computation once the order is recdved. Accordingly, order processing system ISO may be able to goia'ate a quick response v^en an order is received even if tfnere are many order items wi&in a family. To continue to provide sudi quidc res^nses, various ratries of table SOO m^ need to be modified after promising the above^oted order. Sudi modifications are illustrated with reference to Figure 6A. Figure 6A is shown containing table 600 rq>resenting the values of various entries once die above noted order (Qreq = 30 units, and Xreq - day 3) is processed in relation to table 500 of Figure S. Only the dififo^ccs of table 600 from table SOO, and required confutations are descnbed briefly in detail. The item demand and item budceted allocation rows on day (Xreq = day 3) are incremented by (Qrcq = 30), and the resulting value 30 is shown in rows 631 and 632. The net itcm-A available (of row633)on each d^^ up to d^ 3 is equal to item-A supply less item-A bucketed danand allocation correq>onding to each day (up to d£^3) and is equal to 10,10, and -20. The negative sign associated with 20 (on d£^ 3)indicates tiie shortage of 20 units on d£^ 3 to fulfil Qreq (as 10 units are already available on d^ 3). The badcward consumption (of row 634) value correq>onding to day lequals -10 (0-10), as 0 units are consumed from previous days (prior to day 1) ami 10 units (equal to net item availability of day 1) is made available to satisfy Qreq = 30 on day 3. Similarly, badcward consumption value for d£^s 2, and 3 are respectively equal to -10 (0-10), and +20 (20-0). The amative sign associated witii 10 on day 1 and 2 indicates that the net item-A available on day land d^ 2 is consumed to meet required quantity (Qreq = 30) on day 3. A value of+20 on day 3 indicates that a total of 20 unite is consumed from previous days net item availability. Net +bac]cward consumption (in row 635) is computed by adding the values of net item-A available and badcward consumption corresponding to eadi d^ and is equal to 0 on eadxdayupto(Xfeq=3). Asaggr^ateofnetiton-Aavailableoneadiday uptoday 3 is sufficiait to promise tiie ordered tt^n, forward consumption (in row 636) for each day is equal to 0. Badcward consumption and forward consumption correq>onding to each day is shown merely for und^standing. Howevo', tiie values of net iton-A availability, Net+badcward consumption m^^ be stored for fur&tf use. Pres^it item-A availability (of row 638) is det^mined by adding the values of Netfbaclcward consumption and forward consumption corre^nding to each d^ and is equal to 0 iq) to (Xreq = day 3). The cumulative item-A availability (of row 639) on each day is det^mined by adding the cumulative it^n-A availability of previous day with the preset it^n-A availability on that day and is equal to 0 up to day 3. The cumulative item~A availability on day 4 equals 10 (i.e.,O+10), and on day S equals 20 (10+10). The cumulative item availability on day 6 equals 40 (20 units available on d^Qr 5 plus 20 units of present &mily availability on day 6)^ and that of 7,and 8 equals 60 and 80. Once computations such as above are pofomied and die q>propiiate values for the entries are deteraiined^ the next otdet may be received and processed quickly. For illustration, it is assumed that an order for 20 units of item-B vntii a required date (Xreq ^ day 2) is received v^en tfie status is rq>resrated by Figure 6A. As may be readily ^preciated, order processing system 150 determines that the required date (Xreq) is within the ATF duration in step 435. Control accordingly passes to stqp 437, in \^di order processing syston 1 SO examines cumulative itcm-B availability 649 on day 2 (equal to 20) to determine that sufficient quantity of ordered item is available to promise the order. Accordingly, order processing system 150 may promise the orda* quickly as only values correq)onding to itrai-B needs to be examined, various oitries of table 600 may need to be modified afto* promising the above-noted ordo*. The status z&cr modification is reflected by the contents of table 650 Figure 6B. Only the diffd-ences of table 650 fi-om table 600, and the required computations are desoibed briefly in detail. The item demand and item budceted allocation rows on day (Xreq = day 2) are ino-emented by (Qreq = 20), and the resulting value 20 is shown in rows 691 and 692 of day 2. The net itrai-B available (of row 693)on day 1 and 2 is equal to 10, and -10. The negative sign associated with 10 (on day 2)indicates a shortage of 10 units on d£^ 2 to fiilfill Qreq (as only 10 units are available on day 2). Net iton-B available on eadi day is computed similar to conq)utation of net iicmrA available as desc^bed above. The backward consumption (of row 694) value corresponding to day 1 equals -10 (0-10), as 0 units are consumed from previous d£^s (to satisfy shortage on day 1) and 10 units (equal to net item availability of day 1) is made available to satisfy Qreq = 20 on day 2. Similarly, hanckwBtd consumption value for day 2 is equal to +10 (10-0). The negative sign associated witii 10 on da^ 1 indicates that the net item-B available on day 1 is consumed (by demand on d^ 2) to meet required quantity (Qreq = 20) on day 2. A value of+10 on day 2 indicates tiiat a total of 10 uruts is consumed from previous d£^s siq)plies. Net -(-backward consumption (in row 695) is computed by adding the values of net item-B available and backward consumption corresponding to eadi d^ and is equal to 0 on day 1 and 2 (i.e., iq> to Xreq = 2). As aggr^ate of net item-B available on day 1 and 2 is sufGcimt to promise tiie ordered item, forward consumption (in row 696) for day land 2 equals 0. The values of net iiemrB availability, NetH>adcward consumption tx\ay be stored forfiirtiieruse. Present itm-B availability (of row 698) is determined by adding tiie values of Netfbadcward consumption and forward consumption corres^nding to each day and is equal to 0 on day 1 and 2. The cumulative item-B availability (of row 699) on day land 2 is det^mined by adding the cumulative item-B availability of previous day with the present item-B availability on tiuit d^ and is equal to 0 up to ds^ 2. The cumulative item-B availability from day 3 to d2^ S is respectively equal to 10,20, and 30 and that of day 6, 7 and 8 (after ATF point) equals SO, 70, and 90 respectivety. The cumulative item-B availability is confuted similar to that of cumulative itaa-A availability as described above. The desoiption is continued with reference to processing an order v/hcn the required date is after ATF duration and reqiured quantity (Qreq) of item-A is available, but using the units sdieduled to be produced for oth^ membo^ of tiie frimity after ATF point. 9. Processing Orders When the Reqaired Date is Aftw ATF Daration and the Requi^ Quantity is Schedoied to be Available For illustration, it is assumed tiiat an order for 50 units of item-A with a required date (Xreq = day 7) is received vAien the status is rq>resented by Figure 6B. Order processing systmi ISO det^mines that tiie required date (Xreq) is after tiie ATF duration in step 435 Control accordingly passes to stq) 470, in ^^ch ordw processing syst«n 150 examines cumulative it&a-A availability 689 on day 7 (equal to 60) to det^mine that sufficient quantity of ordered itetn is available to promise the order. Accordingly, ordo- processing system ISO may promise tiie order quickly as only values correq>onding to it^n-A and fiEimily needs to be examined (as values in the family are pre-computed to represent tiie supplies available aft^ allocation of ordar it^ns belonging to a memb^ of tiie family). Various mtries of table 650 may need to be modified after promising tiie above-noted order. Table 700 of Figure 7 reflects the status after the modifications are performed. Figure 7 is shown containing table 700 rq>res»iting die values of various entries once the above noted ordo* (Qteq - 50 units, and 'Xieq - day 7) is processed in relation to table 650 of Figure 6B. Only the differmces of table 700 fix>m table 650, and required computations are desoibed briefly in detail. The item demand (of row 781) on day 7 is inctementdd by 50, family bucketed allocation (of row 771) on day (Xfeq = day 7) is inaemented by 40, and item bucketed allocation (of row 782) is ino-emmted by 10 on day 5. It m^ be appreciated that allocations are performed from only two buckets (one from the supply available for tiie corresponding member item and the odier fi^m the supply available for fht eatixc fsonily) irre^>ective of the number of items available from die frunily. As a result, die order can be promised quickly even in complex environmmts. The modifications correq>onding to family are described first, thtti the modifications correq>onding to mraibtf itrad-A are des^bed. The net family available (of row 772) on days 6 and 7 is re^>ectively equal to 20 and -20. The net frunily available on d^ 6 is equal to family supply (equal to 20) less family bucketed allocation (equal to 0) corresponding to day 6. Similarly, on day 7 net family available is equal to -20 (i.e., frimily supply of 20 less die fiimily bucketed allocation equal to 40). Badcward consumption (of row 773) for day 6 equals -20 (as the quantity consumed to satisfy tiie demand on d£^ 6 from previous d^s supplies (equal to 0) less the quantity made available (equal to 20 from supplies available on day 6) to satisfy required quantity on day 7). Similarly, badcward consumption value on day 7 m£^ be computed and is equal to +20. Net+backward consun4)tion (of row 774) on day 6 and 7 is equal to 0 (adding corres^nding values of row 772 and 773). Present fEunily availability (of row 778) corres^nding to d£^s 6 and 7 respectively equals 0 (as the sum of correq)onding values in row 774 and 775 equals 0). It msy be q>preciated that a quantity as much as possible is allocated from frunily pool (after ATF point) and die remaining quantity is allocated on a day (within ATF duration) close to the required d^ ()&eq) (as desmbed above wifli referoice to stq> 482). Item-Abuadcward consunq>tion (of row 785) is equal to 0 (sum of cofre^nding values in row 783 and 784). Presoit it»i-A availability (of row 788) is equal to 0 (sum of correqx>nding values in row 785 and 786). The cumulative item-A availability on d£^ 5 equals 10 (widiin ATF duration) and on day 6^ 7 and 8 is respectively equal to 10,10 and 30. The cumulative ttcm availability may be computed as described above widi referrace to row 689 of Figure 6B. The desoiption is continued with tektexicc to processing an order v^en the required date ()&eq)is afio* ATF duration and required quantity (Qreq) of itrai-A is not scheduled to be available. 10. Processing Orders When the Required Date is After ATF Duration and the Required Quantity is Not Scheduled to be Available For illustration, it is assumed that an ord^ for 65 units of item-B with a required date (Xreq = day 8) is received v4en the status is represented by Figure 7. Order processing syston ISO detomines dmt the required date pCreq) is aftar the ATF duration in step 43S Control accordingly passes to step 470, in v/hich ord^ processing system ISO examines cimiulative iton-B availability 799 on d^ 8 (equal to 50) to det^mine that sufficient quantity of ordered item is not sdieduled to be available. Control thm passes to step 485 In step 485, order processing syst^n 150 det^mines vdiettier item demand is overridden with re^>ect to item-B. If it is not overridden, control passes to step 492. For illustration, it is assumed tiiat tiie iteai donand is ov^ddoi for item-B. Accordingly, control passes to step 491. Various allocations are performed as noted in st^ 491, and the order is indicated to be accqrted Various ratries of table 700 may need to be modified after accepting the above-noted order. The modifications of table 800 from table 700 are briefly noted below. Figure 8 is shown containing table 800 representing the values of various entries once die above noted order (Qreq = 65 units, and Xreq = day 8) is processed in relation to table 700 of Figure 7. Only Iht diffidences from table 700, and required computations are desoibed briefly in detail. The item demand (of row 891) on d^ 8 is incremented by 65, frunily bucketed allocation (of row 871) on day (Xreq = d£^ 8) is inccemcatcd by 35, and it^n-B bucketed allocation (of row 892) is inaoiented by 30 on day 5. First die modifications corresponding to frunily are described th^i tiie modifications correq>onding to it»n-B is described. The net &mily available (of row 872) on day 8 is equal to -15 (family supply (equal to 20) less family bucketed allocation (equal to 35) corresponding to day 8). Backward consumption (of row 873) for day 8 equals 0 (as zero quantity is available to be consumed from d^ 6 and 7 to satisfy the d^nand on day 8). Neti4>ackward consumption (of row 874) on day 8 is equal to -15 (adding corre^nding values of row 872 and 873). Forward consumption (of row 875) on day 8 equals IS, indicates that a supply from a future day (not shown)is required to be consumed to satisfy &e &mily bucketed allocation quantity (of 35 units). Preset family availability (of row 878) corresponding to day 8 is equal to 0 (as the sum of corresponding values in row 874 and 875 equals 0). It may be £q>preciated tiiat unavailable quantity of 15 units (shown within brackets)is indicated in the £unily bucketed allocation (of row 871), and only scheduled quantity of units available is indicated corres^nding to member item-B within tiie ATF duration. Itan*B budceted allocation (of row 892) at ATF point (on d^ 5) equals 30 (as indicated in stq> 491). The net item-B available (of row 893) b equal to -20 (corresponding value of row 890 (equal to 10) less the value in row 892 (equal to 30)). Backward consumption (of row 894) is equal to -10 on day 3 indicating that 10 units available on day3 is consumed by tiie demand of 30 units on day5» similariy^ badcward consumption for day 4 is also shown equal to -10. Badcward consumption on day 5 is equal to 20, as 10 units from eadi of d^s 3 and 4 is consumed by tiie iton-B budgeted allocation on d£Qr 5. Netfbadcward consumption (of row 895) on days 3,4, and 5 are respectively equal to 0 (sum of corres^nding values in row 893 and 894). Present item-B availability (of row 898) on days 3,4, and 5 are re^)ectively equal to 0 (sum of correq)onding values in row 895 and 896). The cumulative item-B availability on days 3; 4, and 5 equals 0 (within ATF duration) and on days 6,7 and 8 is req>ectively equal to 0. The cumulative item availability may be computed as desoibed above with reference to row 799 of Figure 7. The desmption is continued with refo'cnce to processing an orda \dien the required date is within the ATF duration and required quantity ((^eq) of iton-A is not scheduled to be available as of die required date. 11* Processing Orders When the Required Date is Within ATF Duration and the Required Quantity is Not Schedaled to be Available For illustration, it is assumed ftat an ord^ for 20 units of item-A with a required date P&cq = day 1) is received vAiea Ac status is represmted by Figure 8, Order processing system ISO determines that the required date p&ecO is within the AT^ Control accordingly passes to step 437» in v^ch order processing system 150 examines cumulative item-A availability 889 on d^ 1 (equal to 0) to det^mine that sufficient quantity of ordtf ed item is not available to promise tiie order. Again assuming that the ovoride flag is set (stq> 459), control is eventually transferred to step 463 (via steps 437,440,449,450, and 459). In step 463, Qatf (equaling 10) is allocated on Xreq (day 1), and the rraiaining quantity (20-10=10) is allocated on ATF+1 day, vMdti equals day 6. The allocation on ATF+1 are indicated to be unavailable, as rq>reseQted by parenthesis around 10 in day 6, row 971. Various »tries of table 800 may need to be modified after promising tiie above-noted order. The modifications of table 900 fi-om table 800 is des^bed below. Figure 9 is shown containing table 900 rq>resenting the values of various entries once tiie above noted order (Qreq = 20 units, and Xreq - d^y 1) is processed in relation to table 800 of Figure 8. Only the differmces from table 800, and required computations are desoibed briefly in detail. The item demand (of row 981) on day 1 is incremented by 20, family bucketed allocation (of row 971) on day 6 is incremoited by 10 (shown within bradcets, indicating sufficient supplies are not available to meet the draoand), and item-A budgeted allocation (of row 982) is ino'emented by 10 on day 1. First tbe modifications correqK>nding to family are desoibed then die modifications corre^nding to item-A is desoibed. The net family available (of row 972) on d^ 6 is equal to 10 (family supply (equal to 20) less frunily bucketed allocation (equal to 10) corresponding to d^y 6). Netfbackward consumption (of row 974) on day 6 is equal to 0 (adding corresponding values of row 972 and 973) as backward consumption (of row 973) for d^y 6 equals -10 (as only 10 units (out of 20 available on day 6) may be made available to meet the shortage on day 7). Similarly, Nrt+4>adbvard consumption on day 7 equab -10 (-20+10), as b^ equals 10 (as only 10 units available on day 6 are consumed to meet the shortage on day?). Forward consumption (of row 975) on d£^ 7 equals 10, indicating tiiat a supply (of 10 units) from a future day (not shown)is required to be consumed to satisfy the family budceted allocation quantity (of 40 units). It may be q)preciated tiiat unavailable quantity of 10 units (shown within parmdiesis/bradcets)is indicated in the family bucketed allocation (of row 971X resulting in only available quantity of units (i.e., 10 units available within the ATF duration is indicated on Xreq = 1) to be indicated corresponding to member item-A widiin dxe ATF duration. Item-A bucketed allocation (of row 982) on d2^ 1 (witiiin Ike ATF point) equals 10. The net item-A available (of row 983) is equal to 0 (correq>onding value of row 980 (equal to 10) less the value in row 982 (equal to 10)). Netfbadcward consumption (of row 985) on day lis equal to 0 (sum of corre^nding values in row 983 and 984) as backward consumption (of row 984) is equal to 0 on day 1 indicating that 0 units are consumed from supplies available prior to d^ 1 and 0 units are supplied to meet the shortage on a future date. NetfBadcward consumption on d^^ 3 is equal to -10 as badcward consumption is equal to 10 (as only 10 units available on d^ 2 is consumed to meet demiand on d^3). Forward consun^on (of row 986) on d£^ 1 equals 0 (indicating that a supply of 0 units is consumed from a future day (i.e., d^ 4) to meettiiie shortage on day 1 and 0 units are made available to meet tfie shortage on a previous d£^s prior to day 1) and timt of day 4 equals -10, as 10 units are made available to meet tiie shortage on a previous day (i.e., day 3). Forward consun^ition on day 3 is equals 10 (indicating that 10 units are consumed from supplies avaikJ>le on a future day (day 4)). Preset iton-A availability (of row 988) on day 4 is equal to 0 (sum of corre^nding values in row 985 and 986). The cumulative item-A availability on eadi of the days 4-8 (before and aft» ATF) equals 0. The cumulative item availabihty m^ be computed as described above with refi^mce to row 889 of Figure 8. Thus, orders may be accepted with tiie e3q>ectation that the required date is not being committed to, but tiiat an attempt will be made to commit to the required date. Order processing syst«n 150 m^ commit to the required date, for example, if previously promised ordo^ are unscheduled, as desoibed below witii an example. 12. Unschedulmg Order Which Wu AUocated Qaanthy Only Within ATF duration It m^ be s^preciated that quantity of a m^nba iiaa v^ch is scheduled to be available within tiie ATF duration, m^ be optimally used to produce items of the same memhct iUm only. Thus, die freed itons are used to satisfy demand related to orders requiring the q>ecific same member item only. For illustration, it is assumed diat an order widi a required quantity of 30 units of member-A and a requested day of day 3 is un-sdieduled v/btn the status is as depicted in Figure 9. From Figure 6A, it may be q>preciated tiuit all die 30 units were allocated based on quantities sdieduled to be available widiin ATF duration. Theunmetdofiandof lOunits in day 6 is caused due to order for membo* iton-A as desoibed above with reference to Figure 9. Tbm, die un-sdieduled quantity of member item-A may be utilized to satisfy the unmctdemandforallocationsofl0unitsindicatedwithinbradcetsinrow971 ond^6. The remaining freed 20 units are shown to be available for friture orders, as may be observed in row 1089 of Figure 10. The table of Figure 10 contains the status of die table after meeting such demand. Onfy the differences of table 1000 (of Figure 10) from table 900 are described for concisMcss. First the modifications corres^nding to family are described then the modifications correq)onding to item-A is desoibed. The famify bucketed allocation (of row 1071) on d£^ 6 is deo-emmted by 10 resulting in 0 allocation on day6, and item-A budceted allocation (of row 1082) on day lis iiu^einetited by 10 resulting in item-A bucketed demand equaling 20. The net f ami ly available (of row 1072) on day 6 is equal to 20 (family supply (equal to 20) less family bucketed allocation (equal to 0) corres^nding to day 6). Nctfbackward consumption (of row 1074) on day 6 is equal to 0 (adding correq>onding values of row 1072 and 1073) as backward consumption (of row 1073) for day 6 ronains unchanged (equals -20). Forward consumption (of row 1075) on day 6 equals 0, indicates that no supply from a future day is consumed as tibe &mily bucketed allocation quantity is equal to 0. The net itemrA available (of row 1083) is equal to -10 (correq>onding value of row 1080 (equal to 10) less the value in row 1082 (equal to 20)). Badcward consumption (of row 1084) on d£^ 1 is now equal to 0 (as 0 units are consumed from previous days supply to satisfy the demand on day 1 and 0 units are made available to satisfy demand on a future d£^X similarly, badcward consumption on d£^s 2 to S equals 0. Netfbadcward consumption (of row 108S) on d£^ 2 and 3 is equal to 10 (sum of corres^nding values in row 1083 and 1084). Forward consun^tion (of row 1086) on day 1 equals 10 (indicating that a supply of 10 units is consumed from afiiture day (i.e., day 2) to meet the shortage on day 1 and 0 units are made available to meet the shortage on a previous days prior to day 1) and that of day 2equals -10, as 10 units are made available to meet the shortage on a previous day (i.e., day 1). Presoit item-A availability (of row 1088) on day 3 and 4 is equal to 10 (sum of correq>onding values in row 108S and 1086). The cumulative iton-A availability on days 3,4, and 5 (within ATF duration) is respectively equal to 10,20, and 20,and on days 6,7 and 8 (after ATF duration) is respectively equal to 20. An unscheduled quantity within the ATF duration m^ be utilized to satisfy an accepted order corresponding to a matnb^ item (e.g., memba item A) as described above. Order processing system ISO may commit to the required date, for example, if previously promised orders afte ATF duration arc unscheduled, and is described below with an example. 12. Unschednling Order Which Was Afflocated Qaantity both Within and After ATF Doration As may be appreciated, v.^en the freed quantity is scheduled to be available in the post-ATF duration, the freed quantity can be used for satisfying the dmiands of orders related to any membtf item. On the otho* hand, as illustrated above with ref^ence to Figure 10, if the freed quantity is sdieduled to be available widiin the ATF duration, the freed quantity can be used for satisfying ord^s related to the same member it^n (as the member itraa of flie unsdieduled ord^). When an unsdieduled order is based on quantities in both pre and post ATF point, the two different portions of quantities are treated diff^mtly. That is, tiie portion scheduled to be available within tiie ATF duration is first used to satisfy the dmiands related to the orders of the same mraiber item, and fbea the portion scheduled to be available after the ATF duration is used to satisfy the d^nands related to die ord^^ of any monber item. For illustration, it is assumed that an ordo* with a required quantity of SO units of monber-A and a requested day of d£Qr 7 (i.e., afto* ATF duration) is un-sdieduled when the status is as in Figure 10. Of the SO units, 40 units are allocated from frunily availability and 10 units are allocated from membff-A itoi availability as desoibed above with reference to Figure 8. The table of Figure 11 contains die status of the table afto* un-scheduling the request. Only the differences of table 1100 (of Figure 11) from table 1000 is described for concisraess. First the modifications corresponding to fanuiy are described then the modifications corresponding to item-A is described. Thus, the 10 units are first processed and indicated to be available, as depicted in row 1189. The 40 units are used to satisfy the unmet draiand of 15 units indicated within brackets in row 1071 on d^ 8. The remaining 25 units are indicated as being available. If the unmet demand exceeds Ae available units, some priority ord«- (e.g., based on the committed date) may be used to allocate the available units. The feniity bucketed allocation (of row 1171) on day 7 is decrraiented by 40 resulting in 0 allocation on day 7, and item-A bucketed allocation (of row 1182) on day 5 is deo-emmted by 10 resulting in iton-A budceted detnand equaling 0. The net family available (of row 1172) on day 7 is equal to 20 (&mily siq)ply (equal to 20) less family budceted allocation (equal to 0) corresponding to day 7). Net+backward consun^on (of row 1174) on day 6 is equal to 20 (adding correq)onding values of row 1172 and 1173) as badcward consumption (of row 1173) for day 6 equals 0 (as the allocated 40 units on d£iy 7 is now equal to z»x> due to 50 units of member iton-A unsdieduled on d^ 7). Similarly, Netfbadcward consumption for day 7 and 8 res9)ectively equals 5 and 0 as badcward consunqrtion (of row 1173) for day 7 equals +15 (as 15 units available on day 7 are consumed by unmet demand of 15 on day 8) and that of day 8 equals +15 (as 15 units are consumed from day 7). Forward consumption (of row 1175) on day 8 equals 0, indicates Aat no supply from a friture d^ is consumed. Presmt family availability (of row 1180) on day 6 equals 20 (by adding correq>onding values in row 1175 and 1178 on day 6). Similarly, present family availability on day 7 and 8 equals 5 and 0. Item-A demand (of row 1181) on day 7 is decr^nrated by 50 units due to an-sdieduling as noted above. It»n-A bucketed allocation (of row 1182) on day 5 is deonding values in row 1183 and 1184). Present item-A availability (of row 1188) on day 5 is equal to 10 (sum ot cone^Mnding values in row 1185 and 1186). TTie cumulative itan-A availability (of row 1189) on dfi^ 5 (wilhin ATF duration) is 30,and on days 6,7 and 8 (after ATF duration) is req)ectively equal to 50,55, and 55 and cumulative it«n-B availability (of row 1199) on days 6,7 and 8 (aStia ATF duration) is respectively equal to 20,25, and 25. * It should be mid^stood the ordo* processing system 1 SO m^ need to main data structures or use structured storage techniques (e.g., databases) to provide various features described above. Sud^ implai^itations will be apparrat to one skilled in the relevant arts by reading tiie disclosure provided h^ein. Thus, an ord^ processing syston ISO impl^nenting a siq>ply chain management gystrai processes orders to det^mine i^edier an order related to members of the family can be im>mised according to sevoal aspect of the present invention. 14. Condasion While various embodiments of the presoit invration have heca described above, it should be und^stood diat they have been presented by way of example only, and not limitation. Thus, die breadth and scope of the present invmtion should not be limited by any of tfie above desoibed csxanplary onbodimaits, but should be defined only in accordance witii tfie following claims and their equival^its. 1. A method of processing orders related to a fiimily of products in a supply chain management system, said £unily of products containing a plurality of m«nber items, said method comprising: receiving a time fmce (TF) duration asisociated with each of said plurality of member items m relation to a first memb^ it^n, vs^aein said first member item is also contained in said pluraUty of mmiba- items^ said TF duration rq)resenting an amount of advance time duration after vMch Iht supply of the correq>onding memhet item is available to satisfy the demand for said first membo' item; receiving a fij^ ordo* £f>ecifying afirst quantity of said first membor item and a first required date» \s4erein said first required date is afl» said TF duration firom a time said first order is received, and v^^ein only Qavail imits of said first member item are scheduled to be available as of said first required date, v^erein Qavail is less than said first quantity; determining vAkdOxer at least said first quantity of all of said plurality of member items is sdieduled to be available as of said first required date; and promising said first ordo* if said detomining det^mines that at least said first quantity of all of said plurality of monber it^ns is sdieduled to be available as of said first required date. 2. The method of claim 1, who-ein said TF duration is equal for all pairs of member items contained in said plurality of member itraos, and v^erein said TF duration equals aggregate TF (ATP) duration. 3. The metfiod of claim 2, if said determining determines that at least said first quantity of all of said plurality of memb^ items is not sdieduled to be available as of said first required date, fiuth^ comprising: computing an ATP date in ^^ch said first quantity of said first memb^ item will be available based on availability of number of units of said member item available as of the end of said ATP duration and number of units of all of said plurality of mraibar items after said ATF duration; and accq>tmg said first ord^ with a promise date equaling said ATP date. 4. The method of claim 3, vHb«'ein a user is provided an option to indicate whether said ATP date is acceptable, vdierem said accq)ting is perfomied only if said user indicates that said ATP date is acceptable. 5. The method ofclaim3»furditf comprising: if said first requested quantity is greater than (Qatp-Qatf), allocating (QaQ>-Qatf) on said first requested date fi-om all of said plurality of monbtf items and (Qreq - Qa^ + Qatf) at an end day of said ATP duration from said first mmib» iton, if said firstrequested quantity is less than or equal to (Qa4>-QatQ» allocating said first requested quantity on said ATP date» \^erein Qa^ rq>resmts die aggregate available units as of said ATP date fi'om all of said plurality of member items» Qatf rq)resents &e aggregate available units of said first monber item at tiie end of said ATP duration, and Qreq equals said first requested quantity. 6. The method ofclaimS^fiirdio* comprising: cheddng whethcs* an override flag is associated witii said first order, and accq>ting said first order if said override flag is associated witii said first order even if said determining detomines that at least said first quantity of all of said plurality of monbtf items is not sdieduled to be available as of said first required date, ^o'cin said confuting and accq>ting with said promise date are p^ormed only if said ovoride flag is not associated widi said first ord^. 7. The method of claim 6, fiirth^ comprising rejecting said otdet if said override flag is not associated with said first ord^ and if said ATP date is not acceptable to a user placing said first ord^. 8. The method of claim 6, if said override flag is associated with said first order, fiirther comprising: allocating (Qreq-Qatf) on said first requested date and Qatf on the last day of said ATF duration, wherein Qatf represents the aggregate availaWe units of said first member item at the »d of said ATF duration, and Qreq equals said first requested quantity. 9. The method ofclaim 2, fiirtho* comprising: con^>uting a present £amily availability indicating an aggregate quantity of said plurality of m^nber items available on said first required date; and allocating a first portion firom said preset fiunily availability and a second portion from quantity scheduled to be available for said first monbtf item as of ^id of said ATF duration. 10. The method of claim 9, fiirtfa^conq>rising: confuting a cumulative item availability for said first member item in each d^^ in said ATF duration, and maintaining said present family availability associated with each day after said ATF duration, vdi^ein said detemiining comprises examining said cumulative item availability and said present fiimily availability such that said det»tnining can be performed quiddy. 11. The mediod of claim 9, herein said det^mining comprises: performing a first con^>arison of said first quantity and (said present family availability as of said required date - said cumulative item availability at die end of said ATF duration), vdierein'-' indicates a subtraction op^ation; if said first comparison provides a less than result, said second portion equaling 0, and said first portion being allocated fi^om said preset &mily availability on said first required date; and if said first comparison provides a greater than or equal to result, said first portion equaling (said preset family availability as of said required date - said cumulative item availability at die ^id of said ATF duration), and said second portion equaling said required quantity less said first portion. 12. The me&odofclaim 2, further comprising: receiving in said compute system atiurd ordo" specifying athird quantity of said first m^nber item and a third required date» v^^ein said tfiird required date is within said ATF duration, wh^ein said third quantity is less than or equal to said cumulative item availability on said third required date; and promising tiiat said tiurd ord^ can be promised. 13. The method ofclaim 2, fi^o* comprising: receiving a fourA ord^ q)ecifying a fourtfi quantity of said first member item and a fourtfi required date, vdi^ein said fourth required date is within said ATF duration, wherein said fourtib quantity is greater &an said cumulative iton availability on said fourth required date; determining said cumulative item availability (Qatf)at the md of said ATF duration; dieddng if said fourdi quantity is less tium or equal to said Qatf, and if said fourdi quantity is less than or equal to said Qat^ c^eddng i^ether a first ovmide flag is associated witii said fourth order, and allocating said fourth quantity on said fourdi required date if said first ovoride flag is associated with said fourtfi order. 14. The method of claim 13, if said fourtib quantity is less than or equal to said Qatf and if said ovoride flag is not associated witii said fourth ordo", fiirdiCT comprising: detomining a date Xatp on vAdch said fourdi quantity is available; and accepting said fourth ordo* only if a promise date of said Xa^ is acceptable to a user placing said fourdi ord^. 15. The method of claim 14, furth^ comprising rejecting said fourth order if said override flag is not associated with said fourdi ord^ and if said Xa^ is not acceptable as said promise date to said us^. 16. The mediod of claim 13, if said fourth quantity is greats dian said Qatf, further comprising: checking v^eth^ an override flag is associated with said fourth order, if said ovmide flag is associated with said fourth ordtf »allocating Qatf on said fourth required date and (fourth required quantity less said Qatf) on a day following said ATF duration. 17. The method of claim 16, if said fourth quantity is greato-than said Qatf and if said ovoride flag is not associated with said fourth order, said method comprising: computing a date (Xa^) d&cr said fourth required date and a corresponding Qatp on vMch said fourfli quantity is available; * cheddng in the said con^uto* systom vAidihef said Xatp is acceptable as a promise date; and rejecting said fourdi ord» is said Xa^ is not accq>table as a promise date. 18. The method of claim 17, if said Xa^ is accq>table as a promise date, further comprising: p^ormingafourth comparison to detomine^editf said fourth quantity is less than or equal to (Qa^^Qatf); if said fourth quantity is less tiian (Qa4>-Qatf), allocating said fourth quantity on said ATP date; if said fourtfi quantity is greats than (QaQ>-Qatf), allocating said (Qatp-Qatf) on said ATP date and (said fourth quantity- Qa^tpH^atf) on last day of said ATF duration. 19. The mediodofclaim 2, further conq)rising: receiving a request to un-sdiedule one of a previously promised ordo^; detemiining ^etih^ said previously promised ord^ is based on a tenth quantity scheduled to be available widiin said ATF duration; using said trath quantity to meet unmet demands related to die same member item as the memba item for ^^ch said previously promised order relates to. 20. The method of claim 19, furtho- comprising: determining whe&er said previously promised order is based on an elevratfi quantity sdieduled to be available afi^ said ATF duration; using said tenth quantity to meet unmet demands related to any of said plurality of membtf itotns. 21. A compute readable medium carrying one or more sequences of instructions for causii^ a con:^)ut^ sy ston to process otdess related to a family of products in a supply chain manag»imt system, said &mily of products containing aplurality of m^nbtf items, I^CTein execution of said one or more sequences of instructions by one or more processors contained in said conq)uter qrstrai causes said one or more processors to perform tfie actions of: receiving in a compute system a time fence (TF) duration associated witii eadi of said plurality of member items in relation to a first monber item, v^erdn said first member item is also contained in said plurality of memb« itemSy said TF duration rq)resaiting an amount of advance time duration aft^ vAAch tibe siq>ply of the correq>onding member item is available to satisfy the demand for said first member item; receiving a first order s^>ecifying a first quantity of said first membff item and a first required date, v^erein said first required date is aft^ said ATF duration from atime said first order is received, and v^erein only Qavail units of said first mmiber itrai are sdieduled to be available as of said first required date, wherein Qavail is less than said first quantity; determining whettier at least said first quantity of all of said plurality of member itemis is sdieduled to be available as of said first required date; and proinisirig said first ordo" if said detmniiiiiig detorniines dutf at least said first quanti^ of all of said plurality of motib^ items is sdieduled to be available as of said first required date. 22. The compute readable medium of claim 21, v^^ein said TF duration is equal for all pairs of mmb^ items contained in said plurality of m^nbtf itrais, and vAkaein said TF duration equals aggregate TF (ATF) duration. 23. The computer readable medium of claim 22, if said det^mining determines that at least said first quantity of all of said plurality of membo* items is not sdieduled to be available as of said first required date, furthv comprising: computing an ATP date in vdiich said first quantity of said first monbtf item will be available based on availability of number of units of said membff it^n available as of &e end of said ATF duration and numba of units of all of said plurality of member items after said ATF duration; and accepting said first ord^ with a promise date equaling said ATP date. 24. The computer readable medium of claim 23, ^^o-ein a user is provided an option to indicate wheth^ said ATP date is acceptable, v^erein said accq>ting is performed only if said us^ indicates that said ATP date is acceptable. 25. The con^uter readable medium of claim 23, fiirtho' comprising: if said first requested quantity is greats than (QaQ>-Qatf), allocating (QaQ)-Qatf) on said first requested date firom all of said plurality of member items and (Qreq - Qatp + Qatf) at an end day of said ATF duration from said first mmiber itrao, if said first requested quantity is less than or equal to (Qa4>-Qatf), allocating said first requested quantity on said ATP date, who'cin Qatp rq)resents die aggregate available units as of said ATP date from all of said plurality of member itraos, Qatf rq>resents the aggregate available units of said first member item at tiie end of said ATF duration, and Qreq equals said first requested quantity. 26. The conq>ut^ readable medium ofclaim 23, fiirtha* comprising: diecking v^etti^ an ovoride flag is associated witii said first order, and accq>ting said first otda if said ovoride flag is associated with said first orda even if said determining determines that at least said first quantity of all of said plurality of mraibCT items is not sdbeduled to be available as of said first required date, v^^ein said computing and accepting with said promise date are performed only if said override flag is not associated with said first order. 27. The con^ut^ readable medium of claim 26, fiirtho* comprising rejecting said order if said override flag is not associated witiii said first order and if said ATP date is not acceptable to a usa* placing said first order. 28. The compute readable medium of claim 26, if said ov^de flag is associated with said first ord^, further comprising: allocating (Qreq-Qatf) on said first requested date and Qatf on tiie last d£^ of said ATP duration, wh^ein Qstf rq>resrats the aggregate availably units of said first mraiba it^n at tfie end of said ATF duration, and Qreq equals said first requested quantity. 29. The con^uter readable medium ofclaim 22, further comprising: computing in said compute* syston a presoit fsunily availability indicating an aggr^ate quantity of said plurality of manb^ items available on said first required date; and allocating in said compute systrai a first portion from said present funily availability and a second portion from quantity scheduled to be available for said first m^nber item as of »id of said ATF duration. 30. The computer readable medium of claim 29, fiirtfa^ comprising: confuting in said con^ut^ syst^n a cumulative item availability for said first mqnber item in eadi day in said ATF duration, and maintaining in said conyutg system said present frimily availability associated widi each day aftet said ATF duration, v^erein said determining comprises examining said cumulative item availability and said pres^it family availability such that said detomining can be p^ormed quiddy. 31. The computer readable medium of claim 29, wii^ein said detemuniog comprises: paforming a first conq)arison of said first quantity and (said present family availability as of said required date - said cumulative it^n availability at the cad of said ATF duration), ^^ein '-' indicates a subtraction operation; if said first comparison provides a less than result, said second portion equaling 0, and said first portion being allocated from said present &mily availability on said first required date; and if said first comparison provides a greata- than or equal to result, said first portion equaling (said preset family availability as of said required date - said cumulative item availability at the end of said ATF duration), and said second portion equaling said required quantity less said first portion. 32. The computer readable medium of claim 22, fiirther comprising: receiving in said compute* systrai athird ord^ specifying athird quantity of said first monb^ item and a third required date, wh^ein said tiurd required date is witiiin said ATF duration, v^erein said tiiird quantity is less than or equal to said cumulative it^n availability on said third required date; and promising in said compute syston tiiat said tiiird ordo* can be promised. 33. The computer readable medium ofclaim 22, fiirtho-comprising: receiving in said compute system a fourth otdet q>ecifying a fourdi quantity of said first mmber item and a fourtti required date, ^^^ein said fourtib required date is witiiin said ATF duration, herein said fourdi quantity is greats tiian said cumulative item availability on said fourth required date; determining said cumulative itotn availability (Qatf)at &e end of said ATF duration; dieddng if said fourth quantity is less than or equal to said Qatf, and if said fourtfi quantity is less Ihan or equal to said Qat^ dieddng in said compufa^ system v/hedie^ a first ov^de flag is associated with said fourth ordw, and allocating said fourth quantity on said fourth required date if said first override flag is associated widi said fourth order. 34. The conqputer readable medium of claim 33, if said fourth quantity is less dian or equal to said Qatf and if said ov^de flag is not associated widi said fourth ordo", further comprising: det^mining a date Xa^ on ^diich said fourth quantity is available; and accepting said fourth order only if a promise date of said Xatp is acceptable to a user placing said fourth ord^. 35. The computer readable medium of claim 34, furth^ comprising rejecting said fourA otda if said ov^de flag is not associated with said fourdi order and if said Xa^ is not acceptable as said promise date to said user. 36. The compute readable medium of claim 33» if said fourtti quantity is greater duin said Qat^ furdier comprising: dieddng whether an ov^de flag is associated with said fourth order, if said override flag is associated witii said fourth order, allocating Qatf on said fourth required date and (fourth required quantity less said Qatf) on a d£^ following said ATF duration. 37. The computo* readable medium of claim 36, if said fourth quantity is greats than said Qatf and if said ov^de flag is not associated witii said fourth ord», fiirdier comprising: confuting in said computer system a date pCaQ>) afbet said fourth required date and a corres^nding Qa^ on whidi said fourdi quantity is available; dieddng in the said computer system whetti^ said Xa^ is acceptahle as a promise date; and rejecting said fourth ord» is said Xa^ is not accq>table as a promise date. 38. The computa* readable medium of claim 37, if said Xa^ is accq>table as a promise date, furtibLcr comprising: poforming a fourtti comparison in said computer sfyst^n to detomine \^ether said fourth quantity is less than or equal to (Qa4>-Qatf); if said four& quantity is less &an (Qa^p-Qatf), allocating said fourth quantity on said ATP date; if said fowih quantity is greats than (Qa^vQatQ, allocating said (QaQ>-Qatf) on said ATP date and (said fourdi quantity- Qa^)4Qatf) on last day of said ATF duration. 39. The compute readable medium of claim 22, further comprising: receiving a request to un-sdiedule one of a previousty promised ord^*s; determining whether said previously promised order is based on a taoth quantity scheduled to be available within said ATF duration; using said trath quantity to meet unmet d^nands related to die same member item as the member itmi for vAdck said previously promised ord^ relates to. 40. The compute readable medium ofclaim 39, further comprising: detatnining Aether said previously promised order is based on an eleven^ quantity scheduled to be available after said ATP duration; using said tenth quantity to meet unmet d^nands related to any of said plurality of mmnher it^ns.

Documents:

890-che-2003-abstract.pdf

890-che-2003-assignment.pdf

890-che-2003-claims duplicate.pdf

890-che-2003-claims original.pdf

890-che-2003-correspondence others.pdf

890-che-2003-correspondence po.pdf

890-che-2003-description complete duplicate.pdf

890-che-2003-description complete original.pdf

890-che-2003-drawings.pdf

890-che-2003-form 1.pdf

890-che-2003-form 26.pdf

890-che-2003-form 3.pdf

890-che-2003-other documents.pdf