US5764543A - Extensible model network representation system for process planning - Google Patents

Extensible model network representation system for process planning Download PDF

Info

Publication number
US5764543A
US5764543A US08/491,153 US49115395A US5764543A US 5764543 A US5764543 A US 5764543A US 49115395 A US49115395 A US 49115395A US 5764543 A US5764543 A US 5764543A
Authority
US
United States
Prior art keywords
models
model
resource
plan
buffer
Prior art date
Legal status (The legal status 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 status listed.)
Expired - Lifetime
Application number
US08/491,153
Inventor
Brian M. Kennedy
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Blue Yonder Group Inc
Original Assignee
I2 Technologies 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
Family has litigation
US case filed in Texas Eastern District Court litigation Critical https://portal.unifiedpatents.com/litigation/Texas%20Eastern%20District%20Court/case/6%3A10-cv-00284 Source: District Court Jurisdiction: Texas Eastern District Court "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
First worldwide family litigation filed litigation https://patents.darts-ip.com/?family=23951009&utm_source=google_patent&utm_medium=platform_link&utm_campaign=public_patent_search&patent=US5764543(A) "Global patent litigation dataset” by Darts-ip is licensed under a Creative Commons Attribution 4.0 International License.
US case filed in Texas Eastern District Court litigation https://portal.unifiedpatents.com/litigation/Texas%20Eastern%20District%20Court/case/2%3A06-cv-00352 Source: District Court Jurisdiction: Texas Eastern District Court "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
US case filed in Texas Eastern District Court litigation https://portal.unifiedpatents.com/litigation/Texas%20Eastern%20District%20Court/case/6%3A09-cv-00194 Source: District Court Jurisdiction: Texas Eastern District Court "Unified Patents Litigation Data" by Unified Patents is licensed under a Creative Commons Attribution 4.0 International License.
Application filed by I2 Technologies Inc filed Critical I2 Technologies Inc
Priority to US08/491,153 priority Critical patent/US5764543A/en
Assigned to I2 TECHNOLOGIES, INC. reassignment I2 TECHNOLOGIES, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: KENNEDY, BRIAN M.
Priority to CA002176531A priority patent/CA2176531A1/en
Priority to TW085105988A priority patent/TW371338B/en
Priority to MYPI96001959A priority patent/MY132176A/en
Priority to GB9611769A priority patent/GB2302426A/en
Priority to EP96918429A priority patent/EP0776507B1/en
Priority to DE69601152T priority patent/DE69601152T2/en
Priority to DK96918429T priority patent/DK0776507T3/en
Priority to PCT/US1996/009909 priority patent/WO1997000488A1/en
Priority to ES96918429T priority patent/ES2128172T3/en
Priority to BR9608596A priority patent/BR9608596A/en
Priority to AT96918429T priority patent/ATE174705T1/en
Priority to MXPA97010223A priority patent/MXPA97010223A/en
Priority to AU55989/96A priority patent/AU712238B2/en
Priority to JP17542096A priority patent/JPH0916686A/en
Priority to US09/057,036 priority patent/US5930156A/en
Publication of US5764543A publication Critical patent/US5764543A/en
Application granted granted Critical
Assigned to I2 TECHNOLOGIES US, INC. reassignment I2 TECHNOLOGIES US, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: I2 TECHNOLOGIES, INC.
Assigned to WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT reassignment WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT PATENT SECURITY AGREEMENT Assignors: JDA TECHNOLOGIES US, INC.
Assigned to JDA TECHNOLOGIES US, INC reassignment JDA TECHNOLOGIES US, INC ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: I2 TECHNOLOGIES US, INC
Assigned to JDA SOFTWARE GROUP, INC. reassignment JDA SOFTWARE GROUP, INC. ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: JDA TECHNOLOGIES US, INC.
Assigned to JDA TECHNOLOGIES US, INC. reassignment JDA TECHNOLOGIES US, INC. RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL Assignors: WELLS FARGO CAPITAL FINANCE, LLC
Assigned to CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH reassignment CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH FIRST LIEN PATENT SECURITY AGREEMENT Assignors: JDA SOFTWARE GROUP, INC.
Assigned to CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH reassignment CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH FIRST LIEN PATENT SECURITY AGREEMENT Assignors: JDA SOFTWARE GROUP, INC.
Anticipated expiration legal-status Critical
Assigned to JDA SOFTWARE GROUP, INC. reassignment JDA SOFTWARE GROUP, INC. RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0697 Assignors: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Assigned to JDA SOFTWARE GROUP, INC. reassignment JDA SOFTWARE GROUP, INC. RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0809 Assignors: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH
Assigned to JDA TECHNOLOGIES US, INC. reassignment JDA TECHNOLOGIES US, INC. CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF THE CONVEYING AND RECEIVING PARTIES TO INCLUDE A PERIOD AFTER THE TERM INC PREVIOUSLY RECORDED ON REEL 026468 FRAME 0199. ASSIGNOR(S) HEREBY CONFIRMS THE CHANGE OF NAME FROM I2 TECHNOLOGIES US, INC. TO JDA TECHNOLOGIES US, INC.. Assignors: I2 TECHNOLOGIES US, INC.
Assigned to JDA SOFTWARE GROUP, INC. reassignment JDA SOFTWARE GROUP, INC. CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF THE CONVEYING AND RECEIVING PARTIES TO INCLUDE A PERIOD AFTER THE TERM INC PREVIOUSLY RECORDED AT REEL: 026740 FRAME: 0676. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Assignors: JDA TECHNOLOGIES US, INC.
Assigned to JDA TECHNOLOGIES US, INC. reassignment JDA TECHNOLOGIES US, INC. CORRECTIVE ASSIGNMENT TO CORRECT THE REEL 026468 FRAME NUMBER FROM 0199 TO 0119 PREVIOUSLY RECORDED ON REEL 055136 FRAME 0623. ASSIGNOR(S) HEREBY CONFIRMS THE CORRECTION ASSIGNMENT. Assignors: I2 TECHNOLOGIES US, INC.
Expired - Lifetime legal-status Critical Current

Links

Images

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/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02PCLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/02Total factory control, e.g. smart factories, flexible manufacturing systems [FMS] or integrated manufacturing systems [IMS]

Definitions

  • This invention relates in general to the field of process planning. More particularly, the invention relates to an extensible model system architecture for integrated material and capacity planning, and integrated factory and distribution planning.
  • the present invention provides an extensible model architecture for process planning that eliminates or reduces problems with prior systems.
  • the present invention provides a computer software system for modeling a process capability on a computer.
  • the computer software system comprises an operation model type for defining a plurality of operation models. Each operation model represents an activity that can be performed by a process.
  • a resource model type is for defining a plurality of resource models. Each resource model represents capacity available for use in performing an activity and rules for allocating capacity to the activity.
  • a buffer model type is for defining a plurality of buffer models. Each buffer model represents rules for controlling a flow of material between activities.
  • the operation model type, buffer model type, and resource model type each comprise a plurality of fields defining attributes.
  • the plurality of fields includes a plurality of extension selector fields that each allow a user to specify one of a plurality of extensions that augment a model with additional fields and semantics.
  • the model type specifies a base set of fields and semantics which includes fields that select extensions that specify additional fields and semantics that can be added to a particular model. The presence of a field in a model is dependent upon a value of another field in the model.
  • defined operation models, buffer models, and resource models are stored as nodes in an interrelated process network model.
  • the process network model is formed by a plurality of operation models each specifying buffer models from which material is consumed and buffer models to which material is supplied and specifying resource models having capacity used in performing the activity specified by the operation model. In this manner, both material and capacity usage are simultaneously represented along with timing constraints between activities.
  • a plan network model is constructed upon the process network model.
  • An operation-plan model type is used to define a plurality of operation-plan models.
  • Each operation-plan model represents a plan for performing an activity represented by an operation model.
  • a resource-plan model type is used to define a plurality of resource-plan models.
  • Each resource-plan model represents a planned usage of capacity represented by a resource model.
  • a buffer-plan model type is used to define a plurality of buffer-plan models.
  • Each buffer-plan model represents a planned flow of material represented by a buffer model.
  • a plan network model is formed by a plurality of operation-plan models each specifying resource-plan models planned to be used in performing the activity specified by the operation-plan.
  • the nodes of the plan network model are built upon and refer to the nodes of the process network model.
  • the process network model represents possibilities of what can be done, and the plan network model represents that which is planned to be done.
  • each model type has one or more extension points that may be used to extend the basic model type in order to support the information needed to create the user defined models.
  • extension points may be used to extend the basic model type in order to support the information needed to create the user defined models.
  • For each extension point a user may select an appropriate extension to model a particular aspect of the user's system.
  • the software system of the present invention can be, but not necessarily, implemented using object oriented programming.
  • object oriented programming supports simultaneous use of multiple types of models for the different elements of the planning problem.
  • FIG. 1 is a graphical representation of a portion of a process network model implementing an extensible model architecture for use in planning a process according to the teachings of the present invention
  • FIG. 2 is a graphical representation of a plan network model implementing an extensible model architecture for use in planning a process according to the teachings of the present invention.
  • FIG. 3 is a graphical representation of a family of resource models in a process network model implementing inheritance
  • FIG. 4 is a graphical representation of a family of resource models in a process network model implementing date effectivity.
  • the present invention provides a software system for modeling various processes.
  • the software system may model a manufacturing process used to produce a particular item or product.
  • the software system may also be used to model a product distribution channel, a supply chain, or an order fulfillment process.
  • a process is modeled using three primary model types: an operation model type, a buffer model type, and a resource model type.
  • a plan for that process is similarly modeled with three associated primary model types: the operation-plan, buffer-plan, and resource-plan.
  • a user uses a model type as a template to create a model.
  • a buffer model type is used to create a model of a buffer.
  • Each of these user defined models is stored as a node in a process network model of a user's process.
  • each model type may have one or more extension points that allow a user to customize the model to represent the user's process. For each extension point, a user may choose from numerous extensions the one that is best suited to define a particular aspect of the user's system or process. Each model type has a list of predefined extensions from which the user may choose. Each extension defines fields that extend the data and meaning associated with a model type. These extensions and fields define the way in which the model types interact.
  • Each user defined model is defined by a model type, one extension for each extension point of the model type, and data for each field of the model type and extensions. Possible features of each of the model types are discussed in detail below.
  • the operation model type may be used to create operation models which represent activities that can be performed.
  • operation model type means a general model for activities that may be modeled by the software.
  • Operaation node and “operation model” are used interchangeably to represent a specific operation defined by a user using the operation model type. This convention is also used with respect to buffers and resources.
  • An operation model type models a process, activity, or action that transforms or moves items resulting in a flow into, out of or between buffers.
  • Operations may require resources with specific skills. Those resources model the capacity to perform operations. Buffers model the flow of items that result from operations. Operations model the activity.
  • Activities may include transportation, storage, picking, receiving, testing, assembling, packaging, manufacturing, designing, setup, maintenance, and other actions.
  • An operation can use any number of resources, with different run times, and with staggered start and end dates.
  • a single activity or a whole series of activities can be modeled with a single operation. This is important for having sufficient flexibility to model diverse activities in different manufacturers, even within a single supply chain.
  • the operation model can be extended via a ⁇ process ⁇ extension.
  • Different extensions each can add different fields to the operation model.
  • a simple process extension may add a single field such as a fixed amount of time that the operation runs
  • a more complex process extension may add a fixed time and a per-unit time that is computed proportional to the number of units that operation performed.
  • a much more complex process extension may add a field that is a list of other operations which are performed in sequence in order to perform this operation.
  • the present invention allows a routing to be modeled as simply a particular kind of operation--an operation that consists of other operations that are run in sequence.
  • the relationships between those sub-operations can be different depending upon the chosen extension. So, an operation can model a simple routing (a sequence of operations allowed to spread), a flow routing (a sequence of operations which must flow into one another), a set of operations that can be run at the same time, alternates (a set of alternate operations), and other combinations.
  • routings are modeled as operations, they can be put in other operations.
  • a simple routing operation may consist of five operations.
  • One of those five may be an alternates operation, which consists of three possible operations.
  • One of those possibilities may itself by a simple routing operation consisting of three operations.
  • An operation can also model simply the bill-of-materials for an item (operations that just model the transform of items, but do not model the capacity required to do that). Similarly, an operation can model simply the bill-of-distribution for an item (operations that just model the movement of items between buffers, but do not model the capacity required to do so). Other operations can then combine the bill-of-materials or bill-of-distribution operations with operations that properly consume capacity. Such separation is common in older manufacturing databases.
  • Some operation specifications can define multiple operations. For example, some manufacturing software defines operations such that resources can be loaded just during portions of operation time. For ease of interfacing such packages or databases, process extensions can be provided with the identical specification. That process generates a routing-like operation containing auto-generated sub-operations that contain the different phased resource loadings.
  • An advantage of the operations model type design is simplicity and consistency. By providing a simple building block that is extensible and can be flexibly combined with others, a great deal of modeling capability is provided without complicating the common simple cases. In this way, the critical operations and resources can be modeled in adequate detail while the non-critical models remain suitably inexpensive.
  • a user may select an extension from the operation model type to, for example, define a transportation operation model. Alternately, a user may choose an extension from the operation model type that creates a smelting operation model for smelting iron ore to produce steel in a smelter. In essence, every act that needs to be performed by a process is modeled using the operation model type.
  • An example of an extension for an operation model is a run extension.
  • a simple run extension may consist of one field: the fixed amount of time that the operation model is to run. For example, a particular operation that runs for 2 hours may be modeled by that extension.
  • a more complicated run extension may have three fields: such as a load-run-unload.
  • This extension may define a predetermined, constant time for loading material, followed by a run time which is a factor that is multiplied by the quantity of material that is being processed, followed by an unload run time which is constant.
  • the load, run, and unload phases may each require use of different resources.
  • Operation models represent activities that consume items, produce items, and/or utilize capacity. Such operation models define the activities and precedence (timing) constraints in a process.
  • a routing is represented as an Operation model with a routing extension which defines the behavior of that operation to be a sequence of other operations.
  • the specification of alternate resources, alternate operations, and alternate routings can be done with an operation model and an alternates extension which defines the behavior of that operation to be "perform one of these other operations".
  • an operation model may maintain constraints between successive operation models such as perish times (i.e. the maximum time between operations).
  • An operation-plan model type may be used to create operation-plan models which represent the plans to perform activities that are represented by operation models.
  • the operation-plan model refers to an operation model that defines the allowed behavior.
  • the operation-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan).
  • the operation-plan model would include the dates during which the operation will be performed. If different resources may be chosen to perform the activity, the operation model represents those options, whereas the operation-plan model represents a choice of the resource planned to be used.
  • Extensions selected for the operation model can cause corresponding extensions to be selected for a operation-plan model that refers to the operation model.
  • Those extensions add fields and semantics that correspond with the semantics of the operation model. For example, an extension may add minimum and maximum limits for a value in fields of the operation model, and a corresponding extension may add the planned value as a field of the operation-plan model.
  • a resource model type may be used to create resource models which represent aspects of a process that have a predetermined capacity.
  • a resource model may represent laborers used in a manufacturing process.
  • a resource model may represent a physical object such as a truck, a forklift, an oven, or any other object used in implementing the process that has a predetermined capacity limitation (such as space, electricity, or money).
  • the resource model type may provide various extensions from which a user may choose to define an actual capacity constraint on its process.
  • a simple extension may only have a single field setting a maximum capacity constraint.
  • Such a resource model may, for example, represent a truck which has a maximum carrying capacity of 10 tons.
  • a more complex extension may be chosen.
  • the extension may have fields relating to both a maximum capacity and a minimum capacity.
  • Extensions for the resource model type may also have fields for constraints such as the number of set up times allowed in a particular time period or the number of hours that may be devoted to setting up the particular resource.
  • a resource model may have an efficiency extension that defines in one of a number of different ways how the efficiency of that resource varies over time.
  • the efficiency may be defined as a fixed value, as a value that ramps up over time (a learning curve), or as a value that changes seasonally as specified in a calendar.
  • a resource model may have a variability extension that defines how the plan should be padded to compensate for the variability of that resource.
  • a resource model may also have a maintenance extension that defines when maintenance is required.
  • One extension may compute based on time since the last maintenance, the load-time during it, a weighted sum of load-times, the number of setups or the setup time, and other such times. It may also determine separately both major and minor maintenance needs.
  • a resource model may have a size extension that defines the size of the resource and defines how the size is consumed by the various operations. For example, a truck trailer may have a size of up to ten tons and up to twelve feet high, eight feet wide, and 26 feet long. The resource would also know how to compute the weight and the physical dimensions of the operations that use the resource.
  • a resource model may also have a load policy extension that defines the rules for loading that resource (e.g. no overlapping operations, and no operations longer than three hours on Mondays).
  • Operation models may reserve capacity of predetermined resource models.
  • a user may define a transportation operation model for transporting an item.
  • the transportation operation may reserve a truck resource model to carry out the act of transporting the item.
  • An operation model may require more than one resource at a time.
  • a particular operation model may specify that it requires a milling machine resource model and a labor resource model.
  • an operation may reserve alternate resource models.
  • a resource model may specify inter-operation constraints such as sequence-dependent set up times or combination constraints. For example, a resource model for an oven may specify that all operations that use the same temperature and are less in size than available space can use a particular oven at the same time.
  • the resource model type can be used to model and manage a storage space.
  • a storage space may represent, for example, a warehouse, a store room, a refrigerator, or floor space in a factory.
  • a resource-plan model type may be used to create resource-plan models which represent the planned availability and usage of the capacity represented by resource models.
  • the resource-plan model refers to a resource model which defines the allowed behavior.
  • the resource-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan).
  • the resource-plan model would include the dates during which the resource will run overtime.
  • the resource model represents the options for performing overtime, whereas the operation-plan model represents a choice of the overtime being planned.
  • Extensions selected for the resource model can cause corresponding extensions to be selected for any resource-plan model that refers to the resource model.
  • Those extensions add fields and semantics that correspond with the semantics of the resource model. For example, an extension may add minimum and maximum limits for a value in fields of the resource model, and a corresponding extension may add the planned value as a field of the resource-plan model.
  • the buffer model type is used to create buffer models which manage items consumed and/or produced in the modeled process.
  • a buffer model represents the management of a particular item.
  • the buffer model type may have extensions that represent constraints such as minimum and maximum inventory levels. Additionally, the buffer model type may have an extension that defines ordering policies such as lot-for-lot, or fixed size batches.
  • a buffer model type extension may also require a "safety stock" that must be on hand at all times in case of emergency.
  • a buffer model manages the flow of materials to and from an operation model.
  • a buffer model may provide sheet metal to a press for stamping the sheet metal into a particular shape.
  • an operation model will point to the buffer models that it consumes items from and to the buffer models that it supplies items to.
  • a defined buffer model may not have an actual inventory associated with it. Rather, the defined buffer model may simply represent an item flow control point. Alternatively, a buffer model may maintain an inventory of items sitting between operations.
  • a buffer-plan model type may be used to create buffer-plan models which represent the planned availability and usage of the capacity represented by buffer models.
  • the buffer-plan model refers to a buffer model which defines the allowed behavior.
  • the buffer-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan).
  • the buffer-plan model would include the dates during which the buffer will run overtime.
  • the buffer model represents the options for performing overtime, whereas the operation-plan model represents a choice of the overtime being planned.
  • Extensions selected for the buffer model can cause corresponding extensions to be selected for any buffer-plan model that refers to buffer model.
  • Those extensions add fields and semantics that correspond with the semantics of the buffer model. For example, an extension may and minimum and maximum limits for a value in fields of the buffer model, and a corresponding extension may add the planned value as a field of the buffer-plan model.
  • FIG. 1 is a graphical representation of a portion of a process network model indicated generally at 10 according to the teachings of the present invention.
  • a process network model is a set of user defined models which may be stored in a computer memory. The stored nodes define, for example, the user's factory which is to be used to manage a particular manufacturing process.
  • a user defines the process network model 10 of FIG. 1 by selecting model types and the appropriate extensions of these model types, as described above, to form models of the elements of the users' process.
  • the nodes in process network model 10 may be connected together in many different ways to achieve different results.
  • Process network model 10 represents all of the possible interconnections between the user defined models. For example, process network model 10 of FIG. 1, in part, consists of four operation models, 11, 12, 13, 14 and 15, and four buffer models, 16, 18, 20 and 22. Material may flow through various paths in process network model 10.
  • Operation model 11 of FIG. 1 may represent the act of stamping a piece of sheet metal into one of many different predetermined shapes as modeled by operation models 12, 13, 14 and 15. Additionally, buffer models 16 and 18 may supply two different types of sheet metal.
  • the portion of process network model 10 shown in FIG. 1 shows several alternative material flow paths.
  • sheet metal may be provided by buffer 16 to operation 13 and then to buffer 20.
  • sheet metal may be provided by buffer 16 to operation 14 and then buffer 22.
  • Sheet metal may be provided by buffer 18 to operation 14 and then to buffer 20.
  • sheet metal may be provided by buffer 18 to operation 15 and then buffer 22.
  • Process network model 10 represents the possible routes that material may flow in a process to be modeled.
  • the software system of the present invention uses the information in a process network model to create plans for implementing a particular material flow path to model a process.
  • the interconnected nodes of the process network model used to represent a particular plan may be referred to as a plan network model or plan.
  • the software system of the present invention may create a plan network model as a result of several different events.
  • a plan network model provides definitions as to quantities and timing for elements of the model. For example, the inventory level for an item managed by a particular buffer model may drop below an allowable level.
  • the process network model may create a plan network model for replenishing the inventory of that buffer model.
  • a plan may be created using the process network model in response to customer orders.
  • the software system of the present invention may create a plan network model as follows. For each activity in a user's process, the software system creates an operation plan model from an operation-plan model type using extensions from the corresponding operation model. The system provides the operation plan model with the start and end dates, alternate selections, and other information needed to form a plan for a particular execution of that operation.
  • the software system For each resource model that is used by an operation plan, the software system creates a resource plan model from a resource-plan model type and the extensions corresponding to the resource model. The system provides the resource plan model with all of the capacity reservations placed on it by the operation plan models.
  • the software system For each buffer model from which items are consumed or to which items are supplied by an operation plan, the software system creates a buffer plan model from a buffer-plan model type and the extensions of a corresponding buffer model.
  • the system provides the buffer plan model with inventory levels, ordering policies and any other information needed to plan the management of the flow of items in the process.
  • the various plan models interact to create a schedule of events to implement the modeled process to produce a selected quantity of output.
  • FIG. 2 is a graphical representation of a plan network model for producing, for example, bicycle fenders in a predetermined process.
  • a user has previously defined a site network having all of the operation-plan, buffer-plan, and resource-plan models necessary to model the user's physical facilities and process requirements.
  • each operation-plan, buffer-plan, and resource-plan model required for use in the plan creates plan models.
  • the flow of material through the manufacturing process for creating bicycle tires as modeled by the software system of the present invention is described in detail below.
  • the storage space holding sheet metal for creating bicycle fenders is represented by resource-plan model 32.
  • sheet metal from resource-plan model 32 is made available in buffer-plan model 34.
  • Buffer-plan model 34 manages the flow of sheet: metal.
  • the sheet metal is stamped into a predetermined shape for the fender.
  • Stamp operation-plan model 36 requires two resource-plan models.
  • resource-plan model 38 comprises an industrial press with a die selected to press the sheet metal into a predetermined shape. It is noted that the die may be modeled as a separate resource.
  • a second resource-plan model 40 for operation-plan model 36 may be a laborer that operates press resource-plan model 38.
  • Buffer-plan model 42 manages the flow of pressed sheet metal from operation-plan model 36 to operation-plan model 44.
  • operation-plan model 44 the pressed sheet metal is painted.
  • Painting operation-plan model 44 may use resource-plan models 46 and 48 such as a vat of paint and a laborer.
  • Buffer-plan model 50 manages the flow of material from painting operation-plan model 44 to drying operation-plan model 52.
  • Operation-plan model 52 utilizes a resource-plan model 54 that may comprise an oven or other appropriate heating element to dry the paint.
  • Heating resource-plan model 54 is operated by resource-plan model 56 which may represent a laborer.
  • the dried fenders are pulled from buffer-plan model 60 and stored in a storage space modeled by resource-plan model 58 by operation-plan model 57.
  • Nodes in the process and plan network models may be interrelated with common elements in a hierarchical order referred to as families. Each node can have only one family. In a family relationship, the children nodes inherit all the extension and field values of their family nodes unless they are specifically overridden by the child. Any changes to fields of a parent model are effective for the child models that do not override those fields.
  • FIG. 3 shows an example of the use of families for a resource model.
  • Resource models 70, 72 and 74 are all ovens.
  • Resource model 70 is the family.
  • Resource models 72 and 74 are the children. Both resource model 72 and resource model 74 have all of the same extensions as resource model 70.
  • Model 72 inherits all values from model 70.
  • Model 74 inherits all values except it has a larger size and higher efficiency.
  • the information stored at the node for resource model 70 may be used to perform aggregate planning. Whereas the information stored at the nodes for resource models 72 and 74 may be used to perform more detailed plans as to what particular ovens are to be used for particular operations.
  • Families may be used to provide an efficient manner in which to update changes to a model. Date effective changes to a model generally affect only a small number of the total fields. It would be tedious and error-prone to have to maintain, for example, many independent copies of the same information in date effective variations. The principle of inheritance in families may be used to efficiently implement date effective changes to a model. As shown in FIG. 3, gas oven resource model 78 is only valid until a specified day, DATE. Beginning on DATE, electric oven resource 80 must be implemented. A date effective field of resource 78 dictates that it may only be used prior to the DATE. After the DATE, only resource model 80 may be used.

Abstract

A computer software system for modeling a process capability on a computer is provided. The computer software system comprises an operation model type for defining a plurality of operation models (33, 36, 44, 52 and 57). Each operation model represents an activity that can be performed by a process. A resource model type is for defining a plurality of resource models (32, 38, 40, 46, 48, 54, 56 and 58). Each resource model represents capacity available for use in performing an activity and rules for allocating capacity to the activity. A buffer model type is for defining a plurality of buffer models (34, 42, 50, and 60). Each buffer model represents rules for controlling a flow of material between activities. The operation model type, buffer model type, and resource model type each comprise a plurality of fields defining attributes that include a plurality of extension selector fields. Defined operation models, buffer models, and resource models are stored as nodes in an interrelated process network model.

Description

CROSS REFERENCE TO RELATED APPLICATIONS
This application is related to the following applications which are incorporated herein by reference:
U.S. application Ser. No. 08/491,167, filed Jun. 16, 1995, and entitled SYSTEM AND METHOD FOR MANAGING ATP.
U.S. application Ser. No. 08/491,121, filed Jun. 16, 1995, and entitled INTERACTIVE REPORT GENERATION SYSTEM AND METHOD OF OPERATION.
U.S. application Ser. No. 08/491,168, filed Jun. 16, 1995, and entitled STRATEGY DRIVEN PLANNING SYSTEM AND METHOD OF OPERATION.
1. Technical Field of the Invention
This invention relates in general to the field of process planning. More particularly, the invention relates to an extensible model system architecture for integrated material and capacity planning, and integrated factory and distribution planning.
2. Background of the Invention
Manufacturers and distributors commit to time critical production and delivery of goods as a regular part of their business. Often, the manufacturing and distribution process is complex, having many different material and capacity constraints that simultaneously affect the implementation of the process. Due to the complexity of the processes, many different software tools have been developed to help manufacturers and distributors plan. Most such tools only address narrow parts of the overall planning process. Several unrelated tools may be required to fully plan a process.
SUMMARY OF THE INVENTION
The present invention provides an extensible model architecture for process planning that eliminates or reduces problems with prior systems.
More particularly, in one embodiment, the present invention provides a computer software system for modeling a process capability on a computer. The computer software system comprises an operation model type for defining a plurality of operation models. Each operation model represents an activity that can be performed by a process. A resource model type is for defining a plurality of resource models. Each resource model represents capacity available for use in performing an activity and rules for allocating capacity to the activity. A buffer model type is for defining a plurality of buffer models. Each buffer model represents rules for controlling a flow of material between activities. The operation model type, buffer model type, and resource model type each comprise a plurality of fields defining attributes. The plurality of fields includes a plurality of extension selector fields that each allow a user to specify one of a plurality of extensions that augment a model with additional fields and semantics. The model type specifies a base set of fields and semantics which includes fields that select extensions that specify additional fields and semantics that can be added to a particular model. The presence of a field in a model is dependent upon a value of another field in the model. Defined operation models, buffer models, and resource models are stored as nodes in an interrelated process network model. The process network model is formed by a plurality of operation models each specifying buffer models from which material is consumed and buffer models to which material is supplied and specifying resource models having capacity used in performing the activity specified by the operation model. In this manner, both material and capacity usage are simultaneously represented along with timing constraints between activities.
According to the present invention, to model a plan for a process, a plan network model is constructed upon the process network model. An operation-plan model type is used to define a plurality of operation-plan models. Each operation-plan model represents a plan for performing an activity represented by an operation model. A resource-plan model type is used to define a plurality of resource-plan models. Each resource-plan model represents a planned usage of capacity represented by a resource model. A buffer-plan model type is used to define a plurality of buffer-plan models. Each buffer-plan model represents a planned flow of material represented by a buffer model. A plan network model is formed by a plurality of operation-plan models each specifying resource-plan models planned to be used in performing the activity specified by the operation-plan. The nodes of the plan network model are built upon and refer to the nodes of the process network model. According to the present invention, the process network model represents possibilities of what can be done, and the plan network model represents that which is planned to be done.
According to one aspect of the present invention, each model type has one or more extension points that may be used to extend the basic model type in order to support the information needed to create the user defined models. For each extension point, a user may select an appropriate extension to model a particular aspect of the user's system.
According to another aspect of the present invention, several elements of a user's process model may share data in a hierarchical fashion referred to as families. A child model inherits all of the data of the parent model unless it is specifically overridden by a designation in the child model. A software system implementing the teachings of the present invention may provide for date effectivity of models using the families feature.
It is a technical advantage of the present invention to use extensions to define the elements of the process or system being modeled because it reduces the amount of data that needs to be stored in a memory device without reducing modeling power. According to the teachings of the present invention, data for each element of the modeled process is stored at a node of a user model or process network model. The data stored at a node comprises only the data for the fields corresponding to the extensions that are selected by the user. The system does not store a zero quantity for each field not chosen by the user. Therefore, the use of extensions reduces the size requirement for a memory device in a system implementing the present invention.
The software system of the present invention can be, but not necessarily, implemented using object oriented programming. Use of object oriented programming supports simultaneous use of multiple types of models for the different elements of the planning problem.
BRIEF DESCRIPTION OF THE DRAWINGS
For a more complete understanding of the present invention and advantages thereof, reference is now trade to the following description taken in conjunction with the accompanying drawings in which like reference numbers indicate like features and wherein:
FIG. 1 is a graphical representation of a portion of a process network model implementing an extensible model architecture for use in planning a process according to the teachings of the present invention;
FIG. 2 is a graphical representation of a plan network model implementing an extensible model architecture for use in planning a process according to the teachings of the present invention; and
FIG. 3 is a graphical representation of a family of resource models in a process network model implementing inheritance;
FIG. 4 is a graphical representation of a family of resource models in a process network model implementing date effectivity.
DETAILED DESCRIPTION OF THE INVENTION
In one embodiment, the present invention provides a software system for modeling various processes. For example, the software system may model a manufacturing process used to produce a particular item or product. The software system may also be used to model a product distribution channel, a supply chain, or an order fulfillment process.
According to the present invention, a process is modeled using three primary model types: an operation model type, a buffer model type, and a resource model type. A plan for that process is similarly modeled with three associated primary model types: the operation-plan, buffer-plan, and resource-plan. A user uses a model type as a template to create a model. For example, a buffer model type is used to create a model of a buffer. Each of these user defined models is stored as a node in a process network model of a user's process.
The model types used by the system are extensible in that each model type may have one or more extension points that allow a user to customize the model to represent the user's process. For each extension point, a user may choose from numerous extensions the one that is best suited to define a particular aspect of the user's system or process. Each model type has a list of predefined extensions from which the user may choose. Each extension defines fields that extend the data and meaning associated with a model type. These extensions and fields define the way in which the model types interact. Each user defined model is defined by a model type, one extension for each extension point of the model type, and data for each field of the model type and extensions. Possible features of each of the model types are discussed in detail below.
The Operation Model Type
The operation model type may be used to create operation models which represent activities that can be performed. As used herein, "operation model type" means a general model for activities that may be modeled by the software. "Operation node" and "operation model" are used interchangeably to represent a specific operation defined by a user using the operation model type. This convention is also used with respect to buffers and resources.
An operation model type models a process, activity, or action that transforms or moves items resulting in a flow into, out of or between buffers. Operations may require resources with specific skills. Those resources model the capacity to perform operations. Buffers model the flow of items that result from operations. Operations model the activity.
Activities may include transportation, storage, picking, receiving, testing, assembling, packaging, manufacturing, designing, setup, maintenance, and other actions. An operation can use any number of resources, with different run times, and with staggered start and end dates. Thus, a single activity or a whole series of activities can be modeled with a single operation. This is important for having sufficient flexibility to model diverse activities in different manufacturers, even within a single supply chain.
The modeling needs of these varied activities can be very different. To support those variations, the operation model can be extended via a `process` extension. Different extensions each can add different fields to the operation model. A simple process extension may add a single field such as a fixed amount of time that the operation runs A more complex process extension may add a fixed time and a per-unit time that is computed proportional to the number of units that operation performed. A much more complex process extension may add a field that is a list of other operations which are performed in sequence in order to perform this operation.
Thus, unlike traditional manufacturing software that separate routings and operations, the present invention allows a routing to be modeled as simply a particular kind of operation--an operation that consists of other operations that are run in sequence. The relationships between those sub-operations can be different depending upon the chosen extension. So, an operation can model a simple routing (a sequence of operations allowed to spread), a flow routing (a sequence of operations which must flow into one another), a set of operations that can be run at the same time, alternates (a set of alternate operations), and other combinations.
Further, since routings are modeled as operations, they can be put in other operations. For example, a simple routing operation may consist of five operations. One of those five may be an alternates operation, which consists of three possible operations. One of those possibilities may itself by a simple routing operation consisting of three operations. Thus, depending upon which alternate is chosen, there may be five or seven operations to perform.
An operation can also model simply the bill-of-materials for an item (operations that just model the transform of items, but do not model the capacity required to do that). Similarly, an operation can model simply the bill-of-distribution for an item (operations that just model the movement of items between buffers, but do not model the capacity required to do so). Other operations can then combine the bill-of-materials or bill-of-distribution operations with operations that properly consume capacity. Such separation is common in older manufacturing databases.
Some operation specifications can define multiple operations. For example, some manufacturing software defines operations such that resources can be loaded just during portions of operation time. For ease of interfacing such packages or databases, process extensions can be provided with the identical specification. That process generates a routing-like operation containing auto-generated sub-operations that contain the different phased resource loadings.
An advantage of the operations model type design is simplicity and consistency. By providing a simple building block that is extensible and can be flexibly combined with others, a great deal of modeling capability is provided without complicating the common simple cases. In this way, the critical operations and resources can be modeled in adequate detail while the non-critical models remain suitably inexpensive.
A user may select an extension from the operation model type to, for example, define a transportation operation model. Alternately, a user may choose an extension from the operation model type that creates a smelting operation model for smelting iron ore to produce steel in a smelter. In essence, every act that needs to be performed by a process is modeled using the operation model type.
An example of an extension for an operation model is a run extension. A simple run extension may consist of one field: the fixed amount of time that the operation model is to run. For example, a particular operation that runs for 2 hours may be modeled by that extension. Alternatively, a more complicated run extension may have three fields: such as a load-run-unload. This extension may define a predetermined, constant time for loading material, followed by a run time which is a factor that is multiplied by the quantity of material that is being processed, followed by an unload run time which is constant. The load, run, and unload phases may each require use of different resources.
Operation models represent activities that consume items, produce items, and/or utilize capacity. Such operation models define the activities and precedence (timing) constraints in a process.
In manufacturing, a sequence of operations is referred to as a routing. A routing is represented as an Operation model with a routing extension which defines the behavior of that operation to be a sequence of other operations. Similarly, the specification of alternate resources, alternate operations, and alternate routings can be done with an operation model and an alternates extension which defines the behavior of that operation to be "perform one of these other operations". Additionally, an operation model may maintain constraints between successive operation models such as perish times (i.e. the maximum time between operations).
The Operation-Plan Model Type
An operation-plan model type may be used to create operation-plan models which represent the plans to perform activities that are represented by operation models. The operation-plan model refers to an operation model that defines the allowed behavior. The operation-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan). For example, the operation-plan model would include the dates during which the operation will be performed. If different resources may be chosen to perform the activity, the operation model represents those options, whereas the operation-plan model represents a choice of the resource planned to be used.
Extensions selected for the operation model can cause corresponding extensions to be selected for a operation-plan model that refers to the operation model. Those extensions add fields and semantics that correspond with the semantics of the operation model. For example, an extension may add minimum and maximum limits for a value in fields of the operation model, and a corresponding extension may add the planned value as a field of the operation-plan model.
The Resource Model Type
A resource model type may be used to create resource models which represent aspects of a process that have a predetermined capacity. For example, a resource model may represent laborers used in a manufacturing process. A resource model may represent a physical object such as a truck, a forklift, an oven, or any other object used in implementing the process that has a predetermined capacity limitation (such as space, electricity, or money).
The resource model type may provide various extensions from which a user may choose to define an actual capacity constraint on its process. For example, a simple extension may only have a single field setting a maximum capacity constraint. Such a resource model may, for example, represent a truck which has a maximum carrying capacity of 10 tons. Alternatively, a more complex extension may be chosen. For example, the extension may have fields relating to both a maximum capacity and a minimum capacity. Extensions for the resource model type may also have fields for constraints such as the number of set up times allowed in a particular time period or the number of hours that may be devoted to setting up the particular resource.
A resource model may have an efficiency extension that defines in one of a number of different ways how the efficiency of that resource varies over time. The efficiency may be defined as a fixed value, as a value that ramps up over time (a learning curve), or as a value that changes seasonally as specified in a calendar.
A resource model may have a variability extension that defines how the plan should be padded to compensate for the variability of that resource. A resource model may also have a maintenance extension that defines when maintenance is required. One extension may compute based on time since the last maintenance, the load-time during it, a weighted sum of load-times, the number of setups or the setup time, and other such times. It may also determine separately both major and minor maintenance needs.
A resource model may have a size extension that defines the size of the resource and defines how the size is consumed by the various operations. For example, a truck trailer may have a size of up to ten tons and up to twelve feet high, eight feet wide, and 26 feet long. The resource would also know how to compute the weight and the physical dimensions of the operations that use the resource. A resource model may also have a load policy extension that defines the rules for loading that resource (e.g. no overlapping operations, and no operations longer than three hours on Mondays).
Operation models may reserve capacity of predetermined resource models. For example, a user may define a transportation operation model for transporting an item. The transportation operation may reserve a truck resource model to carry out the act of transporting the item.
An operation model may require more than one resource at a time. For example, in a milling process, a particular operation model may specify that it requires a milling machine resource model and a labor resource model. Additionally, an operation may reserve alternate resource models. Finally, a resource model may specify inter-operation constraints such as sequence-dependent set up times or combination constraints. For example, a resource model for an oven may specify that all operations that use the same temperature and are less in size than available space can use a particular oven at the same time.
The resource model type can be used to model and manage a storage space. A storage space may represent, for example, a warehouse, a store room, a refrigerator, or floor space in a factory.
The Resource-Plan Model Type
A resource-plan model type may be used to create resource-plan models which represent the planned availability and usage of the capacity represented by resource models. The resource-plan model refers to a resource model which defines the allowed behavior. The resource-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan). For example, the resource-plan model would include the dates during which the resource will run overtime. The resource model represents the options for performing overtime, whereas the operation-plan model represents a choice of the overtime being planned.
Extensions selected for the resource model can cause corresponding extensions to be selected for any resource-plan model that refers to the resource model. Those extensions add fields and semantics that correspond with the semantics of the resource model. For example, an extension may add minimum and maximum limits for a value in fields of the resource model, and a corresponding extension may add the planned value as a field of the resource-plan model.
The Buffer Model Type
The buffer model type is used to create buffer models which manage items consumed and/or produced in the modeled process. In other words, a buffer model represents the management of a particular item. The buffer model type may have extensions that represent constraints such as minimum and maximum inventory levels. Additionally, the buffer model type may have an extension that defines ordering policies such as lot-for-lot, or fixed size batches. A buffer model type extension may also require a "safety stock" that must be on hand at all times in case of emergency.
A buffer model manages the flow of materials to and from an operation model. A buffer model may provide sheet metal to a press for stamping the sheet metal into a particular shape. As part of its definition, an operation model will point to the buffer models that it consumes items from and to the buffer models that it supplies items to. It is noted that a defined buffer model may not have an actual inventory associated with it. Rather, the defined buffer model may simply represent an item flow control point. Alternatively, a buffer model may maintain an inventory of items sitting between operations.
The Buffer-Plan Model Type
A buffer-plan model type may be used to create buffer-plan models which represent the planned availability and usage of the capacity represented by buffer models. The buffer-plan model refers to a buffer model which defines the allowed behavior. The buffer-plan model represents a choice among the allowable behaviors, or even a choice of a disallowed behavior (an infeasible plan). For example, the buffer-plan model would include the dates during which the buffer will run overtime. The buffer model represents the options for performing overtime, whereas the operation-plan model represents a choice of the overtime being planned.
Extensions selected for the buffer model can cause corresponding extensions to be selected for any buffer-plan model that refers to buffer model. Those extensions add fields and semantics that correspond with the semantics of the buffer model. For example, an extension may and minimum and maximum limits for a value in fields of the buffer model, and a corresponding extension may add the planned value as a field of the buffer-plan model.
Process Network Model
FIG. 1 is a graphical representation of a portion of a process network model indicated generally at 10 according to the teachings of the present invention. A process network model is a set of user defined models which may be stored in a computer memory. The stored nodes define, for example, the user's factory which is to be used to manage a particular manufacturing process. A user defines the process network model 10 of FIG. 1 by selecting model types and the appropriate extensions of these model types, as described above, to form models of the elements of the users' process. The nodes in process network model 10 may be connected together in many different ways to achieve different results. Process network model 10 represents all of the possible interconnections between the user defined models. For example, process network model 10 of FIG. 1, in part, consists of four operation models, 11, 12, 13, 14 and 15, and four buffer models, 16, 18, 20 and 22. Material may flow through various paths in process network model 10.
Operation model 11 of FIG. 1 may represent the act of stamping a piece of sheet metal into one of many different predetermined shapes as modeled by operation models 12, 13, 14 and 15. Additionally, buffer models 16 and 18 may supply two different types of sheet metal. The portion of process network model 10 shown in FIG. 1 shows several alternative material flow paths.
For example, sheet metal may be provided by buffer 16 to operation 13 and then to buffer 20. Alternatively, sheet metal may be provided by buffer 16 to operation 14 and then buffer 22. Sheet metal may be provided by buffer 18 to operation 14 and then to buffer 20. Alternatively, sheet metal may be provided by buffer 18 to operation 15 and then buffer 22.
Process network model 10 represents the possible routes that material may flow in a process to be modeled. The software system of the present invention uses the information in a process network model to create plans for implementing a particular material flow path to model a process. The interconnected nodes of the process network model used to represent a particular plan may be referred to as a plan network model or plan.
The software system of the present invention may create a plan network model as a result of several different events. In general, a plan network model provides definitions as to quantities and timing for elements of the model. For example, the inventory level for an item managed by a particular buffer model may drop below an allowable level. In response, the process network model may create a plan network model for replenishing the inventory of that buffer model. Alternatively, a plan may be created using the process network model in response to customer orders.
The software system of the present invention may create a plan network model as follows. For each activity in a user's process, the software system creates an operation plan model from an operation-plan model type using extensions from the corresponding operation model. The system provides the operation plan model with the start and end dates, alternate selections, and other information needed to form a plan for a particular execution of that operation.
For each resource model that is used by an operation plan, the software system creates a resource plan model from a resource-plan model type and the extensions corresponding to the resource model. The system provides the resource plan model with all of the capacity reservations placed on it by the operation plan models.
For each buffer model from which items are consumed or to which items are supplied by an operation plan, the software system creates a buffer plan model from a buffer-plan model type and the extensions of a corresponding buffer model. The system provides the buffer plan model with inventory levels, ordering policies and any other information needed to plan the management of the flow of items in the process. The various plan models interact to create a schedule of events to implement the modeled process to produce a selected quantity of output.
Plan Network Model
FIG. 2 is a graphical representation of a plan network model for producing, for example, bicycle fenders in a predetermined process. For purposes of FIG. 2, it is assumed that a user has previously defined a site network having all of the operation-plan, buffer-plan, and resource-plan models necessary to model the user's physical facilities and process requirements. In response to a condition for creating a plan as identified above, each operation-plan, buffer-plan, and resource-plan model required for use in the plan creates plan models. The flow of material through the manufacturing process for creating bicycle tires as modeled by the software system of the present invention is described in detail below.
The storage space holding sheet metal for creating bicycle fenders is represented by resource-plan model 32. At operation-plan model 33, sheet metal from resource-plan model 32 is made available in buffer-plan model 34. Buffer-plan model 34 manages the flow of sheet: metal. At operation-plan model 36, the sheet metal is stamped into a predetermined shape for the fender. Stamp operation-plan model 36 requires two resource-plan models. First, resource-plan model 38 comprises an industrial press with a die selected to press the sheet metal into a predetermined shape. It is noted that the die may be modeled as a separate resource. A second resource-plan model 40 for operation-plan model 36 may be a laborer that operates press resource-plan model 38.
Buffer-plan model 42 manages the flow of pressed sheet metal from operation-plan model 36 to operation-plan model 44. At operation-plan model 44, the pressed sheet metal is painted. Painting operation-plan model 44 may use resource- plan models 46 and 48 such as a vat of paint and a laborer.
The final step in preparing the fender is to dry the paint. Buffer-plan model 50 manages the flow of material from painting operation-plan model 44 to drying operation-plan model 52. Operation-plan model 52 utilizes a resource-plan model 54 that may comprise an oven or other appropriate heating element to dry the paint. Heating resource-plan model 54 is operated by resource-plan model 56 which may represent a laborer. The dried fenders are pulled from buffer-plan model 60 and stored in a storage space modeled by resource-plan model 58 by operation-plan model 57.
Families
Nodes in the process and plan network models may be interrelated with common elements in a hierarchical order referred to as families. Each node can have only one family. In a family relationship, the children nodes inherit all the extension and field values of their family nodes unless they are specifically overridden by the child. Any changes to fields of a parent model are effective for the child models that do not override those fields.
FIG. 3 shows an example of the use of families for a resource model. Resource models 70, 72 and 74 are all ovens. Resource model 70 is the family. Resource models 72 and 74 are the children. Both resource model 72 and resource model 74 have all of the same extensions as resource model 70. Model 72 inherits all values from model 70. Model 74 inherits all values except it has a larger size and higher efficiency.
Use of families allows planning at different levels. In this example, the information stored at the node for resource model 70 may be used to perform aggregate planning. Whereas the information stored at the nodes for resource models 72 and 74 may be used to perform more detailed plans as to what particular ovens are to be used for particular operations.
Date Effectivity
Families may be used to provide an efficient manner in which to update changes to a model. Date effective changes to a model generally affect only a small number of the total fields. It would be tedious and error-prone to have to maintain, for example, many independent copies of the same information in date effective variations. The principle of inheritance in families may be used to efficiently implement date effective changes to a model. As shown in FIG. 3, gas oven resource model 78 is only valid until a specified day, DATE. Beginning on DATE, electric oven resource 80 must be implemented. A date effective field of resource 78 dictates that it may only be used prior to the DATE. After the DATE, only resource model 80 may be used.
Although the present invention has been described in detail, it should be understood that various changes, substitutions and alternations can be made hereto without departing from the spirit and scope of the invention as defined by the appended claims.

Claims (40)

What is claimed is:
1. A computer system for modeling a process capability for use in process planning on the computer system, the computer system comprising:
a plurality of operation models defined from an operation model type and stored by the computer system, each operation model representing an activity that can be performed by a process;
a plurality of resource models defined from a resource model type and stored by the computer system, each resource model representing capacity available for use in performing an activity and rules for allocating capacity to the activity, the activity represented by an operation model; and
a plurality of buffer models defined from a buffer model type and stored by the computer system, each buffer model representing rules for controlling a flow of material between activities, the activities represented operation models;
the operation model type, buffer model type, and resource model type each having a plurality of fields defining attributes, the plurality of fields including a plurality of extension selector fields that allow a user to specify one of a plurality of optional extensions incorporating additional fields and semantics in addition to fields specified by the model type into each model selecting the optional extension; and
a process network model, stored by the computer system, interrelating the operation models, the buffer models, and the resource models as nodes;
the process network model formed by the plurality of operation models each specifying buffer models from which material is consumed and buffer models to which material is supplied and specifying resource models having capacity used in performing the activity specified by the operation model;
such that both material and capacity usage are simultaneously represented by the process network model along with timing constraints between activities.
2. The computer system of claim 1, wherein the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as a sequence of other operations, with varying rules on how the sequence may be ordered or may spread out in time.
3. The computer system of claim 1, wherein the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as one of several other operation models, with varying rules on how a single one of those operation models is chosen to be performed.
4. The computer system of claim 1, wherein the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as a set of other operations each having individual precedence constraints, with varying rules on how the set of operations is planned.
5. The computer system of claim 1, wherein the operation model type includes a plurality of extensions that define behavior as a sequence of other operations, as one of several other operation models, and as a set of other operations each having individual precedence constraints, such that a complex hierarchy of operation models can be formed in order to represent complex processes with alternatives, sequences, and precedence constraints.
6. The computer system of claim 1, wherein the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe how an efficiency of the resource model changes over time.
7. The computer system of claim 1, wherein the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe a maximum size of operation models that simultaneously use a resource model.
8. The computer system of claim 1 wherein the resource model type has associated with one of the extension selectors a plurality of extensions that define fields and semantics that each describe when maintenance operations should be planned.
9. The computer system of claim 1, wherein the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe how operation plans should be padded to compensate for variability of a resource model.
10. The computer system of claim 1, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe how an efficiency of the resource model changes over time, describe a maximum size of operation models that simultaneously use a resource model, describe when maintenance operations should be planned, and describe how operation plans should be padded to compensate for variability of a resource model;
such that a wide variety of resource models can be represented in one network without greatly increasing complexity of each resource model requiring only a small subset of the overall software system modeling capabilities.
11. The computer system of claim 1, wherein the buffer model type has an operation that defines how material managed by a buffer is stored, and the specified operation model can be extended to specify different scrap factors.
12. The computer system of claim 1, wherein the buffer model type has an operation that defines how material is received into a buffer and how the material is picked from the buffer.
13. The computer system of claim 1, further comprising:
a plurality of operation-plan models defined from an operation-plan model type and stored by the computer system, each operation-plan model representing a planned activity to be performed during a particular period in order to achieve a particular purpose;
a plurality of resource-plan models defined from a resource-plan model type and stored by the computer system, each resource-plan model representing an amount of available capacity and planned usage of the available capacity by operation-plan models; and
a plurality of buffer-plan models defined from a buffer-plan model type and stored by the computer system, each buffer-plan model representing planned flow of material that controlled by the buffer-plan model as a result of planned operation-plan models;
the operation-plan model types, buffer-plan model types, and resource-plan model types each having a plurality of fields that define attributes, including a plurality of extension selector fields corresponding to operation, buffer, and resource model type fields and specifying corresponding extension of a plurality of optional extensions which incorporate additional fields and semantics into each model selecting the optional extension in addition to those specified by the model type; and
a process-plan network model, stored by the computer system, interrelating the defined operation models, the buffer models, and the resource models as nodes;
the process-plan network model formed by operation-plan models specifying buffer-plan models from which material is consumed and buffer-plan models to which material is supplied and specifying resource-plan models having capacity planned to be used in order to perform the activity specified by the operation-plan model;
such that both material and capacity usage are simultaneously represented and addressed along with operation timing constraints in creating and managing a plan for the process.
14. The computer system of claim 13, wherein:
the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as a sequence of other operations, with varying rules on how the sequence may be ordered or may spread out in time; and
the operation-plan model type has a plurality of extensions each corresponding to each of the extensions of the operation model type, which represent extension-specific choices for a particular plan for the process.
15. The computer system of claim 13, wherein:
the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as one of several other operation models, with varying rules on how a single one of those operation models is chosen to be performed; and
the operation-plan model type has a plurality of extensions each corresponding to each of the extensions of the operation model type, which represent extension-specific choices for a particular plan for the process.
16. The computer system of claim 13, wherein:
the operation model type has associated with one of the extension selectors a plurality of extensions that define behavior as a set of other operations each having individual precedence constraints, with varying rules on how the set of operations is planned; and
the operation-plan model type has a plurality of extensions each corresponding to each of the extensions of the operation model type, which represent extension-specific choices for a particular plan for the process.
17. The computer system of claim 13, wherein:
the operation model type includes a plurality of extensions that define behavior as a sequence of other operations, as one of several other operation models, and as a set of other operations each having individual precedence constraints, such that a complex hierarchy of operation models can be formed in order to represent complex processes with alternatives, sequences, and precedence constraints;
the operation-plan model type has a plurality of extensions each corresponding to each of the extensions of the operation model type, which represent extension-specific choices for a particular plan for the process; and
a plan for a complex process can be represented with all decisions to be made in order to define a particular plan.
18. The computer system of claim 13, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantic that each describe how an efficiency of the resource model changes over time; and
the resource-plan model type has a plurality of extensions each corresponding to each of the extensions of the resource model type, which represent extension-specific choices for a particular plan for the process.
19. The computer system of claim 13, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe a maximum size of operation models that simultaneously use a resource model; and
the resource-plan model type has a plurality of extensions corresponding to each of the extensions of the resource model type, which represent extension-specific choices for a particular plan for the process.
20. The computer system of claim 13, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions that define fields and semantics that each describe when maintenance operations should be planned; and
the resource-plan model type has a plurality of extensions corresponding to each of the extensions of the resource model type, which represent extension-specific choices for a particular plan for the process.
21. The computer system of claim 13, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe how operation plans should be padded to compensate for variability of a resource model; and
the resource-plan model type has a plurality of extensions corresponding to each of the extensions of the resource model type, which represent extension-specific choices for a particular plan for the process.
22. The computer system of claim 13, wherein:
the resource model type has associated with one of the extension selectors a plurality of extensions defining fields and semantics that each describe how an efficiency of the resource model changes over time, describe a maximum size of operation models that simultaneously use a resource model, describe when maintenance operations should be planned, and describe how operation plans should be padded to compensate for variability of a resource model; and
the resource-plan model type has a plurality of extensions each corresponding to each of the extensions of the resource model type, which represent extension-specific choices for a particular plan for the process;
such that a wide variety of resource models and a plan for each of the resource models containing all decisions regarding capacity can be represented in one network without greatly increasing complexity of each resource model requiring only a small subset of the overall software system modeling capabilities.
23. The computer system of claim 13, wherein the buffer model type has an operation that defines how material managed by a buffer is stored, and the buffer-plan models create operation-plan models to store the material managed by the buffer.
24. The computer system of claim 13, wherein:
the buffer model type has an operation that defines how material is received into a buffer and how material is picked from the buffer; and
the buffer-plan models create operation-plan models to receive each lot of material and pick each lot consumed.
25. The computer system of claim 13, wherein:
the buffer model type has an operation that defines how material managed by a buffer is stored, and the specified operation model can be extended to specify different scrap factors and has an operation that defines how material is received into a buffer and how the material is picked from the buffer; and
the buffer-plan models create operation-plan models to receive each lot of material and pick each lot consumed and to store the material that is managed by the buffer at all times;
such that a wide variety of resource models and a plan for each of those resource models containing all decisions regarding capacity can be represented in one network without greatly increasing complexity of each resource model requiring only a small subset of the overall software system modeling capabilities; and
such that a complex hierarchy of operation models can be formed to represent complex processes with many alternatives, sequences, precedence constraints, and a plan for such a complex process can be represented with all the decisions to be made in order to define a particular plan.
26. The computer system of claim 25, used to model and plan a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers, or inventories; and
operation-plans, resource-plans and buffer-plans are used to represent corresponding plans for those entities.
27. The computer system of claim 25, used to model a distribution network wherein:
operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; and buffer models represent SKUS, bins, and inventories; and
operation-plans, resource-plans, and buffer-plans are used to represent corresponding plans for those entities.
28. The computer system of claim 25, used to model and plan a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers, or inventories;
operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; and buffer models represent SKUS, bins, and inventories; and
operation-plans, resource-plans and buffer-plans are used to represent corresponding plans for those entities;
such that a full supply chain can be modeled and planned.
29. The computer system of claim 25 used to model project plans wherein:
operation models are used to represent requirements gathering, design, testing, prototyping, tooling, and production; resource models are used to represent the labor, machines, tools, and testers; and buffer models represent various milestones to be achieved in order to move from one activity to another; and
operation-plans, resource-plans, and buffer-plans are used to represent corresponding plans for those entities.
30. The computer system of claim 25, used to model and plan a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers, or inventories;
operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; and buffer models represent SKUS, bins, and inventories; and
operation models are used to represent requirements gathering, design, testing, prototyping, tooling, and production; resource models are used to represent the labor, machines, tools, and testers; and buffer models represent various milestones to be achieved in order to move from one activity to another; and
operation-plans, resource-plans, and buffer-plans are used to represent corresponding plans for those entities;
such that a full supply chain can be modeled and planned and such that a supply chain and design activities involved in introducing new products and phasing out old products together with on-going production and delivery of existing products can be represented and planned.
31. The computer system of claim 1, wherein:
the buffer model type has an operation that defines how material managed by a buffer is stored, and the specified operation model can be extended to specify different scrap factors and has an operation that defines how material is received into a buffer and how the material is picked from the buffer;
such that a wide variety of resource models can be represented in one network without greatly increasing complexity of each resource model requiring only a small subset of the overall software system modeling capabilities; and
such that a complex hierarchy of operation models can be formed to represent complex processes with many alternatives, sequences, precedence constraints.
32. The computer system of claim 31, used to model a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers; or inventories.
33. The computer system of claim 31, used to model a distribution network wherein: operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; buffer models represent SKUS, bins, and inventories.
34. The computer system of claim 31, used to model a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers, or inventories; and
operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; buffer models represent SKUS, bins, and inventories;
such that a full supply chain can be modeled.
35. The computer system of claim 31 used to model project plans wherein: operation models are used to represent requirements gathering, design, testing, prototyping, tooling, and production; resource models are used to represent the labor, machines, tools, and testers; and buffer models represent various milestones to be achieved in order to move from one activity to another.
36. The computer system of claim 31, used to model a manufacturing process wherein:
operation models are used to represent traditional manufacturing operations, routings, bills-of-material, and storage; resource models are used to represent machines, tools, fixtures, and labor; and buffer models are used to represent SKUS, bins, buffers, or inventories;
operation models are used to represent transport, loading, unloading, storage, receiving, picking, palletizing, and packaging activities and traditional bills-of-distribution; resource models represent docks, trucks, pallets, forklifts, labor, and storage facilities; buffer models represent SKUS, bins, and inventories; and
operation models are used to represent requirements gathering, design, testing, prototyping, tooling, and production; resource models are used to represent the labor, machines, tools, and testers; and buffer models represent various milestones to be achieved in order to move from one activity to another;
such that a full supply chain can be modeled and a supply chain and design activities involved in introducing new products and phasing out old products together with on-going production and delivery of existing products can be represented.
37. The computer system of claim 1, wherein each operation model may specify another operation, each resource model may specify another resource, and each buffer model may specify another buffer as its family and may specify a number of fields as inherited from that family, thereby allowing the fields to be changed in the family by a user, and result in changes to all models that inherit that field.
38. The computer system of claim 37, wherein each operation model, resource model, and buffer model that specifies a family can also specify a range of dates during which the model is effective such that outside of the range the model is modeled as if the model does not exist.
39. A computer system for executing computer software for modeling a process capability, the computer system comprising:
a data storage device operable to store data relating to a model of process capability;
an execution memory operable to store data representing computer software; and
a processor coupled to the data storage device and to the execution memory, the processor operable to execute the computer software, wherein the computer software system comprises;
a plurality of operation models defined from an operation model type, each operation model representing an activity that can be performed by a process;
a plurality of resource models defined from a resource model type, each resource model representing capacity available for use in performing an activity and rules for allocating capacity to the activity; and
a plurality of buffer models defined from a buffer model type, each buffer model representing rules for controlling a flow of material between activities;
the operation model type, buffer model type, and resource model type each having a plurality of fields defining attributes, the plurality of fields including a plurality of extension selector fields that allow a user to specify one of a plurality of optional extensions incorporating additional fields and semantics in addition to fields specified by the model type into each model selecting the optional extension; and
a process network model, interrelating the operation models, the buffer models, and the resource models as nodes;
the process network model formed by a plurality of operation models each specifying buffer models from which material is consumed and buffer models to which material is supplied and specifying resource models having capacity used in performing the activity specified by the operation model;
such that both material and capacity usage are simultaneously represented by the process network model along with timing constraints between activities.
40. The computer system of claim 39, wherein the computer software further comprises:
a plurality of operation-plan models defined from an operation-plan model type, each operation-plan model representing a planned activity to be performed during a particular period in order to achieve a particular purpose;
a plurality of resource-plan models defined from a resource-plan model type, each resource-plan model representing an amount of available capacity and planned usage of the available capacity by operation-plan models; and
a plurality of buffer-plan models defined from a buffer-plan model type, each buffer-plan model representing planned flow of material that controlled by the buffer-plan model as a result of planned operation-plan models;
the operation-plan model types, buffer-plan model types, and resource-plan model types each having a plurality of fields that define attributes, including a plurality of extension selector fields corresponding to operation, buffer, and resource model type fields and specifying corresponding extension of a plurality of optional extensions which incorporate additional fields and semantics into each model selecting the optional extension in addition to those specified by the model type; and
a process-plan network model interrelating the operation models, the buffer models, and the resource models as nodes , the process-plan network model formed by operation-plan models specifying buffer-plan models from which material is consumed and buffer-plan models to which material is supplied and specifying resource-plan models having capacity planned to be used in order to perform the activity specified by the operation-plan model;
such that both material and capacity usage are simultaneously represented by the process-plan network model and addressed along with operation timing constraints in creating and managing a plan for the process.
US08/491,153 1995-06-16 1995-06-16 Extensible model network representation system for process planning Expired - Lifetime US5764543A (en)

Priority Applications (16)

Application Number Priority Date Filing Date Title
US08/491,153 US5764543A (en) 1995-06-16 1995-06-16 Extensible model network representation system for process planning
CA002176531A CA2176531A1 (en) 1995-06-16 1996-05-14 Extensible model network representation system for process planning
TW085105988A TW371338B (en) 1995-06-16 1996-05-21 Extensible model network representation system for process planning
MYPI96001959A MY132176A (en) 1995-06-16 1996-05-24 Extensible model network representation system for process planning
GB9611769A GB2302426A (en) 1995-06-16 1996-06-05 Extensible model architecture for process planning
MXPA97010223A MXPA97010223A (en) 1995-06-16 1996-06-10 Extensible model network representation system for process planning.
AT96918429T ATE174705T1 (en) 1995-06-16 1996-06-10 SYSTEM FOR REPRESENTING AN EXTENDABLE MODEL NETWORK FOR PROCESS PLANNING
BR9608596A BR9608596A (en) 1995-06-16 1996-06-10 Network representation system in an extensible model for process planning
EP96918429A EP0776507B1 (en) 1995-06-16 1996-06-10 Extensible model network representation system for process planning
ES96918429T ES2128172T3 (en) 1995-06-16 1996-06-10 NETWORK REPRESENTATION SYSTEM OF EXPANDABLE MODEL FOR THE PLANNING OF A PROCESS.
DE69601152T DE69601152T2 (en) 1995-06-16 1996-06-10 SYSTEM FOR PRESENTING AN EXTENDABLE MODEL NETWORK FOR PROCESS PLANNING
DK96918429T DK0776507T3 (en) 1995-06-16 1996-06-10 System to represent expandable model network for process planning
PCT/US1996/009909 WO1997000488A1 (en) 1995-06-16 1996-06-10 Extensible model network representation system for process planning
AU55989/96A AU712238B2 (en) 1995-06-16 1996-06-14 Extensible model network representation system for process planning
JP17542096A JPH0916686A (en) 1995-06-16 1996-06-17 Open-ended model network representation system for process plan
US09/057,036 US5930156A (en) 1995-06-16 1998-04-08 Extensible model network representation system for process planning

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US08/491,153 US5764543A (en) 1995-06-16 1995-06-16 Extensible model network representation system for process planning

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US09/057,036 Continuation US5930156A (en) 1995-06-16 1998-04-08 Extensible model network representation system for process planning

Publications (1)

Publication Number Publication Date
US5764543A true US5764543A (en) 1998-06-09

Family

ID=23951009

Family Applications (2)

Application Number Title Priority Date Filing Date
US08/491,153 Expired - Lifetime US5764543A (en) 1995-06-16 1995-06-16 Extensible model network representation system for process planning
US09/057,036 Expired - Lifetime US5930156A (en) 1995-06-16 1998-04-08 Extensible model network representation system for process planning

Family Applications After (1)

Application Number Title Priority Date Filing Date
US09/057,036 Expired - Lifetime US5930156A (en) 1995-06-16 1998-04-08 Extensible model network representation system for process planning

Country Status (15)

Country Link
US (2) US5764543A (en)
EP (1) EP0776507B1 (en)
JP (1) JPH0916686A (en)
AT (1) ATE174705T1 (en)
AU (1) AU712238B2 (en)
BR (1) BR9608596A (en)
CA (1) CA2176531A1 (en)
DE (1) DE69601152T2 (en)
DK (1) DK0776507T3 (en)
ES (1) ES2128172T3 (en)
GB (1) GB2302426A (en)
MX (1) MXPA97010223A (en)
MY (1) MY132176A (en)
TW (1) TW371338B (en)
WO (1) WO1997000488A1 (en)

Cited By (84)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5923552A (en) * 1996-12-31 1999-07-13 Buildnet, Inc. Systems and methods for facilitating the exchange of information between separate business entities
US5931900A (en) * 1997-08-25 1999-08-03 I2 Technologies, Inc. System and process for inter-domain interaction across an inter-domain connectivity plane
WO1999046689A1 (en) * 1998-03-12 1999-09-16 Crossworlds Software, Inc. Execution of extended activity diagrams by code generation
US5995945A (en) * 1997-08-25 1999-11-30 I2 Technologies, Inc. System and process for inter-domain planning analysis and optimization using model agents as partial replicas of remote domains
US5993041A (en) * 1996-11-29 1999-11-30 Nec Corporation Production controller for facility group work start
US6029097A (en) * 1996-02-02 2000-02-22 Siemens Ag Process and system for time control of a basic industry plant
US6222533B1 (en) 1997-08-25 2001-04-24 I2 Technologies, Inc. System and process having a universal adapter framework and providing a global user interface and global messaging bus
US20010049632A1 (en) * 1999-12-30 2001-12-06 Rod Rigole Systems and methods for online selection of service providers and management of service accounts
WO2002005143A1 (en) * 2000-07-11 2002-01-17 Pirelli Pneumatici S.P.A. Method for designing a tyre
US6341240B1 (en) * 1997-07-28 2002-01-22 International Business Machines Corporation Method of allocating work in capacity planning
WO2002031746A1 (en) * 2000-10-12 2002-04-18 Manugistics, Inc. System and methods for scheduling manufacturing resources
US20020062238A1 (en) * 1999-02-24 2002-05-23 Brilando Joseph Frank Method for managing the level and reducing the volatility of a company's share price
US20020082893A1 (en) * 2000-02-29 2002-06-27 Dennis Barts Delivery system and method for vehicles and the like
US6415193B1 (en) * 1999-07-08 2002-07-02 Fabcentric, Inc. Recipe editor for editing and creating process recipes with parameter-level semiconductor-manufacturing equipment
US20020095307A1 (en) * 2000-10-27 2002-07-18 Manugistics, Inc. System and method for inventory and capacity availability management
US20020138358A1 (en) * 2001-01-22 2002-09-26 Scheer Robert H. Method for selecting a fulfillment plan for moving an item within an integrated supply chain
US20020143598A1 (en) * 2001-01-22 2002-10-03 Scheer Robert H. System for providing integrated supply chain management
US6470324B1 (en) * 1999-02-19 2002-10-22 Daimlerchrysler Corporation Dealer inventory management system
US20020161674A1 (en) * 2001-01-22 2002-10-31 Scheer Robert H. Method for fulfilling an order in an integrated supply chain management system
US20020188499A1 (en) * 2000-10-27 2002-12-12 Manugistics, Inc. System and method for ensuring order fulfillment
US20020193899A1 (en) * 2001-06-19 2002-12-19 Applied Materials, Inc. Dynamic metrology schemes and sampling schemes for advanced process control in semiconductor processing
US20020194059A1 (en) * 2001-06-19 2002-12-19 International Business Machines Corporation Business process control point template and method
US6594535B1 (en) * 1999-01-11 2003-07-15 Demand Flow Institute, Llc Material and inventory control system for a demand flow process
US6606744B1 (en) 1999-11-22 2003-08-12 Accenture, Llp Providing collaborative installation management in a network-based supply chain environment
US20030182149A1 (en) * 2000-09-05 2003-09-25 Yoshiyuki Matsui Commodity presenting method and system therefor
US6640151B1 (en) 1999-12-22 2003-10-28 Applied Materials, Inc. Multi-tool control system, method and medium
US6671818B1 (en) 1999-11-22 2003-12-30 Accenture Llp Problem isolation through translating and filtering events into a standard object format in a network based supply chain
US20040015333A1 (en) * 2000-07-11 2004-01-22 Renato Caretta Method for designing a tyre
US20040034607A1 (en) * 2002-08-13 2004-02-19 Giacomo Piccinelli Validating communication between participants in an electronic interaction
US6708074B1 (en) 2000-08-11 2004-03-16 Applied Materials, Inc. Generic interface builder
US20040064351A1 (en) * 1999-11-22 2004-04-01 Mikurak Michael G. Increased visibility during order management in a network-based supply chain environment
US20040063224A1 (en) * 2002-09-18 2004-04-01 Applied Materials, Inc. Feedback control of a chemical mechanical polishing process for multi-layered films
US20040068430A1 (en) * 1999-01-04 2004-04-08 Peachey-Kountz Penny Jeanette Single level bill of material available to promise
US20040075692A1 (en) * 2000-10-03 2004-04-22 Bruce Matichuk Application integration system and method using intelligent agents for integrating information access over extended networks
US20040143357A1 (en) * 2002-08-01 2004-07-22 Schwarm Alexander T. Method, system, and medium for handling misrepresentative metrology data within an advanced process control system
US20040225377A1 (en) * 2002-11-15 2004-11-11 Yuri Kokotov Method, system and medium for controlling manufacture process having multivariate input parameters
US6859927B2 (en) 1999-12-21 2005-02-22 Lockheed Martin Corporation Apparatus and method for controlling allocation of resources and task execution
US6910947B2 (en) 2001-06-19 2005-06-28 Applied Materials, Inc. Control of chemical mechanical polishing pad conditioner directional velocity to improve pad life
US6913938B2 (en) 2001-06-19 2005-07-05 Applied Materials, Inc. Feedback control of plasma-enhanced chemical vapor deposition processes
US6922600B1 (en) 2004-04-28 2005-07-26 International Business Machines Corporation System and method for optimizing manufacturing processes using real time partitioned process capability analysis
US6937992B1 (en) 2000-12-29 2005-08-30 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US6961626B1 (en) 2004-05-28 2005-11-01 Applied Materials, Inc Dynamic offset and feedback threshold
US20060009129A1 (en) * 2001-06-19 2006-01-12 Applied Materials, Inc. Feedforward and feedback control for conditioning of chemical mechanical polishing pad
US7069101B1 (en) 1999-07-29 2006-06-27 Applied Materials, Inc. Computer integrated manufacturing techniques
US7082345B2 (en) 2001-06-19 2006-07-25 Applied Materials, Inc. Method, system and medium for process control for the matching of tools, chambers and/or other semiconductor-related entities
US7096085B2 (en) 2004-05-28 2006-08-22 Applied Materials Process control by distinguishing a white noise component of a process variance
US7124101B1 (en) 1999-11-22 2006-10-17 Accenture Llp Asset tracking in a network-based supply chain environment
US7130807B1 (en) 1999-11-22 2006-10-31 Accenture Llp Technology sharing during demand and supply planning in a network-based supply chain environment
US20060271446A1 (en) * 2003-03-24 2006-11-30 Siebel Systems, Inc. Product common object
US7151973B1 (en) * 2002-07-18 2006-12-19 Oracle International Corporation Methods and systems for scheduling and buffer balancing
US7160739B2 (en) 2001-06-19 2007-01-09 Applied Materials, Inc. Feedback control of a chemical mechanical polishing device providing manipulation of removal rate profiles
US7188142B2 (en) 2000-11-30 2007-03-06 Applied Materials, Inc. Dynamic subject information generation in message services of distributed object systems in a semiconductor assembly line facility
US7201936B2 (en) 2001-06-19 2007-04-10 Applied Materials, Inc. Method of feedback control of sub-atmospheric chemical vapor deposition processes
US7205228B2 (en) 2003-06-03 2007-04-17 Applied Materials, Inc. Selective metal encapsulation schemes
US20070208577A1 (en) * 2003-03-24 2007-09-06 Leon Maria T B Position common object
US20070214065A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory transaction common object
US20070214063A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory balance common object
US20070214064A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory location common object
US20070219656A1 (en) * 2006-03-14 2007-09-20 Mario Rothenburg Modeling manufacturing processes to include defined markers
US20070219929A1 (en) * 2006-03-14 2007-09-20 Jochen Steinbach Planning granularity in manufacturing computing systems
US20070226093A1 (en) * 2002-12-20 2007-09-27 Chan Cynthia M Financial services data model
US20070226037A1 (en) * 2003-03-25 2007-09-27 Shailendra Garg Modeling of opportunity data
US7333871B2 (en) 2003-01-21 2008-02-19 Applied Materials, Inc. Automated design and execution of experiments with integrated model creation for semiconductor manufacturing tools
US7337019B2 (en) 2001-07-16 2008-02-26 Applied Materials, Inc. Integration of fault detection with run-to-run control
US7349863B1 (en) 2001-06-14 2008-03-25 Massachusetts Institute Of Technology Dynamic planning method and system
US7356377B2 (en) 2004-01-29 2008-04-08 Applied Materials, Inc. System, method, and medium for monitoring performance of an advanced process control system
US7354332B2 (en) 2003-08-04 2008-04-08 Applied Materials, Inc. Technique for process-qualifying a semiconductor manufacturing tool using metrology data
US20080154660A1 (en) * 2006-12-21 2008-06-26 Jochen Steinbach Generating Planning-Level Time and Capacity Requirement Formulas for Manufacturing Processes
US20080154412A1 (en) * 2006-12-21 2008-06-26 Jochen Steinbach Structural transformation of execution-level manufacturing process routings into planning-level routings
US7415393B1 (en) 2001-06-14 2008-08-19 Massachusetts Institute Of Technology Reliability buffering technique applied to a project planning model
US20090172691A1 (en) * 2007-12-28 2009-07-02 Sap Ag Streaming operations for workflow process models
US7716077B1 (en) 1999-11-22 2010-05-11 Accenture Global Services Gmbh Scheduling and planning maintenance and service in a network-based supply chain environment
US20110022538A1 (en) * 2007-12-28 2011-01-27 Japan Marine Science Inc. Process management support system and simulation method
US7912932B2 (en) 2003-03-24 2011-03-22 Siebel Systems, Inc. Service request common object
US7970722B1 (en) 1999-11-08 2011-06-28 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US8005634B2 (en) 2002-03-22 2011-08-23 Applied Materials, Inc. Copper wiring module control
US8027857B2 (en) 2006-03-14 2011-09-27 Sap Ag Rough-cut manufacturing operations for use in planning
US8032409B1 (en) 1999-11-22 2011-10-04 Accenture Global Services Limited Enhanced visibility during installation management in a network-based supply chain environment
RU2451318C2 (en) * 2004-09-03 2012-05-20 КЛААС Зельбстфаренде Эрнтемашинен ГмбХ Electronic data exchange system
US8392298B2 (en) 2003-03-04 2013-03-05 Siebel Systems, Inc. Invoice adjustment data object for a common data object format
US8473399B2 (en) 2003-03-04 2013-06-25 Siebel Systems, Inc. Invoice data object for a common data object format
US8799186B2 (en) 2010-11-02 2014-08-05 Survey Engine Pty Ltd. Choice modelling system and method
US20140236651A1 (en) * 2013-02-15 2014-08-21 The Boeing Company Display of Process-Plan Execution
CN105590034A (en) * 2016-03-15 2016-05-18 上海市水务规划设计研究院 Flood prevention and disaster reduction capability evaluation model

Families Citing this family (39)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6243613B1 (en) * 1997-12-31 2001-06-05 Philips Electronics North America Corporation N-dimensional material planning method and system with corresponding program therefor
US6477660B1 (en) * 1998-03-03 2002-11-05 Sap Aktiengesellschaft Data model for supply chain planning
US6078912A (en) * 1998-04-15 2000-06-20 Travelhost, Inc. Computer-based system and method for resource determination and management
DE19841165A1 (en) * 1998-09-09 2000-03-16 Abb Research Ltd Process data validation model determination in technical plant, involves controlling model fine tuning remotely by model selection- and optimization module connected over proxy-/adapter module with validation tool
DE19850324C2 (en) * 1998-11-02 2003-11-13 Abb Patent Gmbh Process for the automated mapping of target system-neutral control engineering planning results to target system-specific control technology structures
DE10001668A1 (en) * 2000-01-17 2001-09-27 Reinhard Boltin Computer implemented information administration method for processing research and development projects, involves retrieving resonance profile corresponding to selected project type, based on an allocation rule
US7739096B2 (en) 2000-03-09 2010-06-15 Smartsignal Corporation System for extraction of representative data for training of adaptive process monitoring equipment
US6957172B2 (en) 2000-03-09 2005-10-18 Smartsignal Corporation Complex signal decomposition and modeling
AU2001269886A1 (en) * 2000-06-15 2002-01-14 Xis Incorporated Method and system for product lifecycle management
TW577003B (en) * 2000-09-29 2004-02-21 Manugistics Inc System, network, storage device, and method for supply chain management, including collaboration
US7177827B1 (en) * 2000-10-06 2007-02-13 I2 Technologies Us, Inc. Generating an order plan for a supply chain network
JP2004523028A (en) * 2000-12-13 2004-07-29 ジョンソンディバーシー・インコーポレーテッド Method and apparatus for monitoring operation of a mechanical cleaning device
JP2002203042A (en) * 2000-12-28 2002-07-19 Oriental Yeast Co Ltd Preclinical test support system
US7233886B2 (en) * 2001-01-19 2007-06-19 Smartsignal Corporation Adaptive modeling of changed states in predictive condition monitoring
US7539597B2 (en) 2001-04-10 2009-05-26 Smartsignal Corporation Diagnostic systems and methods for predictive condition monitoring
US6975962B2 (en) * 2001-06-11 2005-12-13 Smartsignal Corporation Residual signal alert generation for condition monitoring using approximated SPRT distribution
US7248937B1 (en) * 2001-06-29 2007-07-24 I2 Technologies Us, Inc. Demand breakout for a supply chain
JP2003091661A (en) * 2001-09-17 2003-03-28 Hitachi Ltd Production control system
US7035930B2 (en) * 2001-10-26 2006-04-25 Hewlett-Packard Development Company, L.P. Method and framework for generating an optimized deployment of software applications in a distributed computing environment using layered model descriptions of services and servers
US7039705B2 (en) * 2001-10-26 2006-05-02 Hewlett-Packard Development Company, L.P. Representing capacities and demands in a layered computing environment using normalized values
US7054934B2 (en) * 2001-10-26 2006-05-30 Hewlett-Packard Development Company, L.P. Tailorable optimization using model descriptions of services and servers in a computing environment
US7313549B2 (en) * 2002-01-09 2007-12-25 Hudson Frederick J Remote materials management system
US20030144896A1 (en) * 2002-01-30 2003-07-31 United Microelectronics Corp. System of demand fulfillment and a method therefor
US7072960B2 (en) * 2002-06-10 2006-07-04 Hewlett-Packard Development Company, L.P. Generating automated mappings of service demands to server capacities in a distributed computer system
DE102005013189A1 (en) * 2005-03-22 2006-10-05 Reinhard Boltin Computer-aided information management and provision method for handling project, involves including interactive changeable width and depth by set of terms, where width/depth establishes degree of freedom/accuracy of data, respectively
AU2005332281A1 (en) * 2005-05-24 2006-11-30 Operational Solutions Management Pty Ltd Capability mapping architecture
US8275577B2 (en) 2006-09-19 2012-09-25 Smartsignal Corporation Kernel-based method for detecting boiler tube leaks
US20080082378A1 (en) * 2006-09-28 2008-04-03 Joshua Scott Duncan Logistics start-up method
US8311774B2 (en) 2006-12-15 2012-11-13 Smartsignal Corporation Robust distance measures for on-line monitoring
US8190461B2 (en) * 2007-04-20 2012-05-29 Sap Ag Logically centralized scrap management using planning operations
US7853669B2 (en) * 2007-05-04 2010-12-14 Microsoft Corporation Mesh-managing data across a distributed set of devices
US8572033B2 (en) 2008-03-20 2013-10-29 Microsoft Corporation Computing environment configuration
US9753712B2 (en) 2008-03-20 2017-09-05 Microsoft Technology Licensing, Llc Application management within deployable object hierarchy
US8484174B2 (en) * 2008-03-20 2013-07-09 Microsoft Corporation Computing environment representation
US9298747B2 (en) * 2008-03-20 2016-03-29 Microsoft Technology Licensing, Llc Deployable, consistent, and extensible computing environment platform
US20090248737A1 (en) * 2008-03-27 2009-10-01 Microsoft Corporation Computing environment representation
DE102011080769A1 (en) * 2011-08-10 2013-02-14 Mall + Herlan Gmbh Effective production line for aerosol cans
JP2015026968A (en) 2013-07-26 2015-02-05 富士通株式会社 Distortion compensation device and distortion compensation method
US11544658B2 (en) 2019-04-18 2023-01-03 Target Brands, Inc. Platform using instruction engine to simulate and perform warehouse processes

Citations (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4209845A (en) * 1977-01-25 1980-06-24 International Business Machines Corporation File qualifying and sorting system
US4459663A (en) * 1981-07-02 1984-07-10 American Business Computer Data processing machine and method of allocating inventory stock for generating work orders for producing manufactured components
US4591983A (en) * 1984-07-09 1986-05-27 Teknowledge, Inc. Hierarchical knowledge system
US4611280A (en) * 1984-03-12 1986-09-09 At&T Bell Laboratories Sorting method
US4611310A (en) * 1982-08-23 1986-09-09 Canevari Timber Co. Method and system for rearranging data records in accordance with keyfield values
EP0231552A1 (en) * 1986-01-09 1987-08-12 Koninklijke Philips Electronics N.V. A method and device for sorting objects provided with a parameter, according to the value of this parameter
US4796194A (en) * 1986-08-20 1989-01-03 Atherton Robert W Real world modeling and control process
US4827423A (en) * 1987-01-20 1989-05-02 R. J. Reynolds Tobacco Company Computer integrated manufacturing system
WO1991017494A1 (en) * 1990-04-27 1991-11-14 Bachman Information Systems, Inc. Dynamic information management computer system
EP0466090A2 (en) * 1990-07-10 1992-01-15 Fujitsu Limited System for controlling production and supply at dispersed producing points
EP0466089A2 (en) * 1990-07-10 1992-01-15 Fujitsu Limited Production control system for controlling producing points
US5089970A (en) * 1989-10-05 1992-02-18 Combustion Engineering, Inc. Integrated manufacturing system
US5130932A (en) * 1989-03-03 1992-07-14 Mitsubishi Denki Kabushiki Kaisha Generating device for production system simulator
US5148370A (en) * 1987-06-17 1992-09-15 The Standard Oil Company Expert system and method for batch production scheduling and planning
US5175857A (en) * 1988-12-28 1992-12-29 Kabushiki Kaisha Toshiba System for sorting records having sorted strings each having a plurality of linked elements each element storing next record address
US5216612A (en) * 1990-07-16 1993-06-01 R. J. Reynolds Tobacco Company Intelligent computer integrated maintenance system and method
US5218700A (en) * 1990-01-30 1993-06-08 Allen Beechick Apparatus and method for sorting a list of items
US5229948A (en) * 1990-11-03 1993-07-20 Ford Motor Company Method of optimizing a serial manufacturing system
US5233533A (en) * 1989-12-19 1993-08-03 Symmetrix, Inc. Scheduling method and apparatus
US5280425A (en) * 1990-07-26 1994-01-18 Texas Instruments Incorporated Apparatus and method for production planning
US5291394A (en) * 1990-06-01 1994-03-01 Motorola, Inc. Manufacturing control and capacity planning system
US5303144A (en) * 1989-12-08 1994-04-12 Hitachi, Ltd. Computer aided planning support system
US5331545A (en) * 1991-07-05 1994-07-19 Hitachi, Ltd. System and method for planning support
US5351196A (en) * 1991-03-15 1994-09-27 Spacial Technology, Inc. Method and apparatus for solids based machining
US5369570A (en) * 1991-11-14 1994-11-29 Parad; Harvey A. Method and system for continuous integrated resource management

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5247693A (en) * 1985-10-08 1993-09-21 The Foxboro Company Computer language structure for process control applications and method of translating same into program code to operate the computer
US5168441A (en) * 1990-05-30 1992-12-01 Allen-Bradley Company, Inc. Methods for set up and programming of machine and process controllers
EP0553285B1 (en) * 1990-10-16 2000-03-01 Consilium, Inc. Object-oriented architecture for factory floor management
US5586039A (en) * 1993-03-29 1996-12-17 Texas Instruments Incorporated Computer-aided manufacturing support method and system for specifying relationships and dependencies between process type components

Patent Citations (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4209845A (en) * 1977-01-25 1980-06-24 International Business Machines Corporation File qualifying and sorting system
US4459663A (en) * 1981-07-02 1984-07-10 American Business Computer Data processing machine and method of allocating inventory stock for generating work orders for producing manufactured components
US4611310A (en) * 1982-08-23 1986-09-09 Canevari Timber Co. Method and system for rearranging data records in accordance with keyfield values
US4611280A (en) * 1984-03-12 1986-09-09 At&T Bell Laboratories Sorting method
US4591983A (en) * 1984-07-09 1986-05-27 Teknowledge, Inc. Hierarchical knowledge system
EP0231552A1 (en) * 1986-01-09 1987-08-12 Koninklijke Philips Electronics N.V. A method and device for sorting objects provided with a parameter, according to the value of this parameter
US4796194A (en) * 1986-08-20 1989-01-03 Atherton Robert W Real world modeling and control process
US4827423A (en) * 1987-01-20 1989-05-02 R. J. Reynolds Tobacco Company Computer integrated manufacturing system
US5148370A (en) * 1987-06-17 1992-09-15 The Standard Oil Company Expert system and method for batch production scheduling and planning
US5175857A (en) * 1988-12-28 1992-12-29 Kabushiki Kaisha Toshiba System for sorting records having sorted strings each having a plurality of linked elements each element storing next record address
US5130932A (en) * 1989-03-03 1992-07-14 Mitsubishi Denki Kabushiki Kaisha Generating device for production system simulator
US5089970A (en) * 1989-10-05 1992-02-18 Combustion Engineering, Inc. Integrated manufacturing system
US5303144A (en) * 1989-12-08 1994-04-12 Hitachi, Ltd. Computer aided planning support system
US5233533A (en) * 1989-12-19 1993-08-03 Symmetrix, Inc. Scheduling method and apparatus
US5218700A (en) * 1990-01-30 1993-06-08 Allen Beechick Apparatus and method for sorting a list of items
WO1991017494A1 (en) * 1990-04-27 1991-11-14 Bachman Information Systems, Inc. Dynamic information management computer system
US5291394A (en) * 1990-06-01 1994-03-01 Motorola, Inc. Manufacturing control and capacity planning system
EP0466090A2 (en) * 1990-07-10 1992-01-15 Fujitsu Limited System for controlling production and supply at dispersed producing points
EP0466089A2 (en) * 1990-07-10 1992-01-15 Fujitsu Limited Production control system for controlling producing points
US5216612A (en) * 1990-07-16 1993-06-01 R. J. Reynolds Tobacco Company Intelligent computer integrated maintenance system and method
US5280425A (en) * 1990-07-26 1994-01-18 Texas Instruments Incorporated Apparatus and method for production planning
US5229948A (en) * 1990-11-03 1993-07-20 Ford Motor Company Method of optimizing a serial manufacturing system
US5351196A (en) * 1991-03-15 1994-09-27 Spacial Technology, Inc. Method and apparatus for solids based machining
US5331545A (en) * 1991-07-05 1994-07-19 Hitachi, Ltd. System and method for planning support
US5369570A (en) * 1991-11-14 1994-11-29 Parad; Harvey A. Method and system for continuous integrated resource management

Cited By (154)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6029097A (en) * 1996-02-02 2000-02-22 Siemens Ag Process and system for time control of a basic industry plant
US5993041A (en) * 1996-11-29 1999-11-30 Nec Corporation Production controller for facility group work start
US5923552A (en) * 1996-12-31 1999-07-13 Buildnet, Inc. Systems and methods for facilitating the exchange of information between separate business entities
US6341240B1 (en) * 1997-07-28 2002-01-22 International Business Machines Corporation Method of allocating work in capacity planning
US6332130B1 (en) * 1997-08-25 2001-12-18 I2 Technologies Us, Inc. System and process for inter-domain planning analysis and optimization using model agents as partial replicas of remote domains
US6222533B1 (en) 1997-08-25 2001-04-24 I2 Technologies, Inc. System and process having a universal adapter framework and providing a global user interface and global messaging bus
US5995945A (en) * 1997-08-25 1999-11-30 I2 Technologies, Inc. System and process for inter-domain planning analysis and optimization using model agents as partial replicas of remote domains
US5931900A (en) * 1997-08-25 1999-08-03 I2 Technologies, Inc. System and process for inter-domain interaction across an inter-domain connectivity plane
WO1999046689A1 (en) * 1998-03-12 1999-09-16 Crossworlds Software, Inc. Execution of extended activity diagrams by code generation
US7308416B2 (en) * 1999-01-04 2007-12-11 International Business Machines Corporation Single level bill of material available to promise
US20040068430A1 (en) * 1999-01-04 2004-04-08 Peachey-Kountz Penny Jeanette Single level bill of material available to promise
US7444295B2 (en) * 1999-01-04 2008-10-28 International Business Machines Corporation Single level bill of material available to promise
US6594535B1 (en) * 1999-01-11 2003-07-15 Demand Flow Institute, Llc Material and inventory control system for a demand flow process
US6470324B1 (en) * 1999-02-19 2002-10-22 Daimlerchrysler Corporation Dealer inventory management system
US20020062238A1 (en) * 1999-02-24 2002-05-23 Brilando Joseph Frank Method for managing the level and reducing the volatility of a company's share price
US6415193B1 (en) * 1999-07-08 2002-07-02 Fabcentric, Inc. Recipe editor for editing and creating process recipes with parameter-level semiconductor-manufacturing equipment
US7069101B1 (en) 1999-07-29 2006-06-27 Applied Materials, Inc. Computer integrated manufacturing techniques
US7174230B2 (en) 1999-07-29 2007-02-06 Applied Materials, Inc. Computer integrated manufacturing techniques
US7970722B1 (en) 1999-11-08 2011-06-28 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US8160988B1 (en) 1999-11-08 2012-04-17 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US8005777B1 (en) 1999-11-08 2011-08-23 Aloft Media, Llc System, method and computer program product for a collaborative decision platform
US7957991B2 (en) 1999-11-22 2011-06-07 Accenture Global Services Limited Technology sharing during demand and supply planning in a network-based supply chain environment
US10013705B2 (en) 1999-11-22 2018-07-03 Accenture Global Services Limited Increased visibility during order management in a network-based supply chain environment
US8560366B2 (en) 1999-11-22 2013-10-15 Accenture Global Services Limited Technology sharing during demand and supply planning in a network-based supply chain environment
US7130807B1 (en) 1999-11-22 2006-10-31 Accenture Llp Technology sharing during demand and supply planning in a network-based supply chain environment
US6606744B1 (en) 1999-11-22 2003-08-12 Accenture, Llp Providing collaborative installation management in a network-based supply chain environment
US8271336B2 (en) 1999-11-22 2012-09-18 Accenture Global Services Gmbh Increased visibility during order management in a network-based supply chain environment
US7716077B1 (en) 1999-11-22 2010-05-11 Accenture Global Services Gmbh Scheduling and planning maintenance and service in a network-based supply chain environment
US6671818B1 (en) 1999-11-22 2003-12-30 Accenture Llp Problem isolation through translating and filtering events into a standard object format in a network based supply chain
US7124101B1 (en) 1999-11-22 2006-10-17 Accenture Llp Asset tracking in a network-based supply chain environment
US20040064351A1 (en) * 1999-11-22 2004-04-01 Mikurak Michael G. Increased visibility during order management in a network-based supply chain environment
US8032409B1 (en) 1999-11-22 2011-10-04 Accenture Global Services Limited Enhanced visibility during installation management in a network-based supply chain environment
US8732023B2 (en) 1999-11-22 2014-05-20 Accenture Global Services Limited Increased visibility during order management in a network-based supply chain environment
US9922345B2 (en) 1999-11-22 2018-03-20 Accenture Global Services Limited Increased visibility during order management in a network-based supply chain environment
US6859927B2 (en) 1999-12-21 2005-02-22 Lockheed Martin Corporation Apparatus and method for controlling allocation of resources and task execution
US6640151B1 (en) 1999-12-22 2003-10-28 Applied Materials, Inc. Multi-tool control system, method and medium
US20010049632A1 (en) * 1999-12-30 2001-12-06 Rod Rigole Systems and methods for online selection of service providers and management of service accounts
US20070050481A1 (en) * 1999-12-30 2007-03-01 Rod Rigole Systems and methods for online selection of service providers and management of service accounts
US7139728B2 (en) * 1999-12-30 2006-11-21 Rod Rigole Systems and methods for online selection of service providers and management of service accounts
US8260682B2 (en) 1999-12-30 2012-09-04 Leod Network Holdings L.L.C. Systems and methods for online selection of service providers and management of service accounts
US7707071B2 (en) 1999-12-30 2010-04-27 Rod Rigole Systems and methods for online selection of service providers and management of service accounts
US7983960B2 (en) 1999-12-30 2011-07-19 Leod Network Holdings L.L.C. Systems and methods for online selection of service providers and management of service accounts
US20040107111A1 (en) * 2000-02-29 2004-06-03 United Parcel Service Of America, Inc. Delivery system and method for vehicles and the like
US20050288986A1 (en) * 2000-02-29 2005-12-29 United Parcel Service Of America, Inc. Delivery system and method for vehicles and the like
US20040039597A1 (en) * 2000-02-29 2004-02-26 United Parcel Service Of America, Inc. Delivery system and method for vehicles and the like
US20040054554A1 (en) * 2000-02-29 2004-03-18 United Parcel Service Of America, Inc. Delivery system and method for vehicles and the like
US20020082893A1 (en) * 2000-02-29 2002-06-27 Dennis Barts Delivery system and method for vehicles and the like
US20040073448A1 (en) * 2000-02-29 2004-04-15 United Parcel Service Of America, Inc. Delivery system and method for vehicles and the like
WO2002005143A1 (en) * 2000-07-11 2002-01-17 Pirelli Pneumatici S.P.A. Method for designing a tyre
EP1440789A2 (en) * 2000-07-11 2004-07-28 PIRELLI PNEUMATICI S.p.A. Method for the production of tyres
US7133736B2 (en) 2000-07-11 2006-11-07 Pirelli Pneumatici S.P.A. Method for designing a tire and method for producing at least one tire
EP1440789A3 (en) * 2000-07-11 2005-06-01 PIRELLI PNEUMATICI S.p.A. Method for the production of tyres
US20040015333A1 (en) * 2000-07-11 2004-01-22 Renato Caretta Method for designing a tyre
US6708074B1 (en) 2000-08-11 2004-03-16 Applied Materials, Inc. Generic interface builder
US7962371B2 (en) * 2000-09-05 2011-06-14 Amada Company, Limited Commodity presenting method and system therefor
US20030182149A1 (en) * 2000-09-05 2003-09-25 Yoshiyuki Matsui Commodity presenting method and system therefor
US7552103B2 (en) * 2000-10-03 2009-06-23 Celcorp, Inc. Application integration system and method using intelligent agents for integrating information access over extended networks
US7269580B2 (en) 2000-10-03 2007-09-11 Celcorp, Inc. Application integration system and method using intelligent agents for integrating information access over extended networks
US20040075692A1 (en) * 2000-10-03 2004-04-22 Bruce Matichuk Application integration system and method using intelligent agents for integrating information access over extended networks
US20080010227A1 (en) * 2000-10-03 2008-01-10 Bruce Matichuk Application integration system and method using intelligent agents for integrating information access over extended networks
US6591153B2 (en) 2000-10-12 2003-07-08 Manugistics, Inc. System and methods for scheduling manufacturing resources
WO2002031746A1 (en) * 2000-10-12 2002-04-18 Manugistics, Inc. System and methods for scheduling manufacturing resources
US20020188499A1 (en) * 2000-10-27 2002-12-12 Manugistics, Inc. System and method for ensuring order fulfillment
US7668761B2 (en) 2000-10-27 2010-02-23 Jda Software Group System and method for ensuring order fulfillment
US20020095307A1 (en) * 2000-10-27 2002-07-18 Manugistics, Inc. System and method for inventory and capacity availability management
US8504620B2 (en) 2000-11-30 2013-08-06 Applied Materials, Inc. Dynamic subject information generation in message services of distributed object systems
US7188142B2 (en) 2000-11-30 2007-03-06 Applied Materials, Inc. Dynamic subject information generation in message services of distributed object systems in a semiconductor assembly line facility
US20050267791A1 (en) * 2000-12-29 2005-12-01 Lavoie Steven Product offering management and tracking system
US20110035327A1 (en) * 2000-12-29 2011-02-10 Arrowstream, Inc. Transport Vehicle Capacity Maximization Logistics System and Method of Same
US8756089B2 (en) 2000-12-29 2014-06-17 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US20110029448A1 (en) * 2000-12-29 2011-02-03 Arrowstream, Inc. Transport Vehicle Capacity Maximization Logistics System and Method of Same
US8744884B2 (en) 2000-12-29 2014-06-03 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US8478619B2 (en) 2000-12-29 2013-07-02 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US20110029414A1 (en) * 2000-12-29 2011-02-03 Arrowstream, Inc. Transport Vehicle Capacity Maximization Logistics System and Method of Same
US20110029446A1 (en) * 2000-12-29 2011-02-03 Arrowstream, Inc. Transport Vehicle Capacity Maximization Logistics System and Method of Same
US8756090B2 (en) 2000-12-29 2014-06-17 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US6937992B1 (en) 2000-12-29 2005-08-30 Arrowstream, Inc. Transport vehicle capacity maximization logistics system and method of same
US7324966B2 (en) 2001-01-22 2008-01-29 W.W. Grainger Method for fulfilling an order in an integrated supply chain management system
US7313534B2 (en) 2001-01-22 2007-12-25 W.W. Grainger, Inc. System and method for predictive maintenance and service parts fulfillment in a supply chain
US20020138358A1 (en) * 2001-01-22 2002-09-26 Scheer Robert H. Method for selecting a fulfillment plan for moving an item within an integrated supply chain
US7212976B2 (en) 2001-01-22 2007-05-01 W.W. Grainger, Inc. Method for selecting a fulfillment plan for moving an item within an integrated supply chain
US20020143598A1 (en) * 2001-01-22 2002-10-03 Scheer Robert H. System for providing integrated supply chain management
US20020161674A1 (en) * 2001-01-22 2002-10-31 Scheer Robert H. Method for fulfilling an order in an integrated supply chain management system
US7415393B1 (en) 2001-06-14 2008-08-19 Massachusetts Institute Of Technology Reliability buffering technique applied to a project planning model
US7349863B1 (en) 2001-06-14 2008-03-25 Massachusetts Institute Of Technology Dynamic planning method and system
US7201936B2 (en) 2001-06-19 2007-04-10 Applied Materials, Inc. Method of feedback control of sub-atmospheric chemical vapor deposition processes
US7040956B2 (en) 2001-06-19 2006-05-09 Applied Materials, Inc. Control of chemical mechanical polishing pad conditioner directional velocity to improve pad life
US7725208B2 (en) 2001-06-19 2010-05-25 Applied Materials, Inc. Dynamic metrology schemes and sampling schemes for advanced process control in semiconductor processing
US20020193899A1 (en) * 2001-06-19 2002-12-19 Applied Materials, Inc. Dynamic metrology schemes and sampling schemes for advanced process control in semiconductor processing
US6910947B2 (en) 2001-06-19 2005-06-28 Applied Materials, Inc. Control of chemical mechanical polishing pad conditioner directional velocity to improve pad life
US7698012B2 (en) 2001-06-19 2010-04-13 Applied Materials, Inc. Dynamic metrology schemes and sampling schemes for advanced process control in semiconductor processing
US20020194059A1 (en) * 2001-06-19 2002-12-19 International Business Machines Corporation Business process control point template and method
US7101799B2 (en) 2001-06-19 2006-09-05 Applied Materials, Inc. Feedforward and feedback control for conditioning of chemical mechanical polishing pad
US7082345B2 (en) 2001-06-19 2006-07-25 Applied Materials, Inc. Method, system and medium for process control for the matching of tools, chambers and/or other semiconductor-related entities
US7160739B2 (en) 2001-06-19 2007-01-09 Applied Materials, Inc. Feedback control of a chemical mechanical polishing device providing manipulation of removal rate profiles
US8070909B2 (en) 2001-06-19 2011-12-06 Applied Materials, Inc. Feedback control of chemical mechanical polishing device providing manipulation of removal rate profiles
US7783375B2 (en) 2001-06-19 2010-08-24 Applied Materials, Inc. Dynamic metrology schemes and sampling schemes for advanced process control in semiconductor processing
US8694145B2 (en) 2001-06-19 2014-04-08 Applied Materials, Inc. Feedback control of a chemical mechanical polishing device providing manipulation of removal rate profiles
US20060009129A1 (en) * 2001-06-19 2006-01-12 Applied Materials, Inc. Feedforward and feedback control for conditioning of chemical mechanical polishing pad
US6913938B2 (en) 2001-06-19 2005-07-05 Applied Materials, Inc. Feedback control of plasma-enhanced chemical vapor deposition processes
US20050208879A1 (en) * 2001-06-19 2005-09-22 Applied Materials Control of chemical mechanical polishing pad conditioner directional velocity to improve pad life
US7337019B2 (en) 2001-07-16 2008-02-26 Applied Materials, Inc. Integration of fault detection with run-to-run control
US8005634B2 (en) 2002-03-22 2011-08-23 Applied Materials, Inc. Copper wiring module control
US7151973B1 (en) * 2002-07-18 2006-12-19 Oracle International Corporation Methods and systems for scheduling and buffer balancing
US6999836B2 (en) 2002-08-01 2006-02-14 Applied Materials, Inc. Method, system, and medium for handling misrepresentative metrology data within an advanced process control system
US20040143357A1 (en) * 2002-08-01 2004-07-22 Schwarm Alexander T. Method, system, and medium for handling misrepresentative metrology data within an advanced process control system
US20040034607A1 (en) * 2002-08-13 2004-02-19 Giacomo Piccinelli Validating communication between participants in an electronic interaction
US20040063224A1 (en) * 2002-09-18 2004-04-01 Applied Materials, Inc. Feedback control of a chemical mechanical polishing process for multi-layered films
US20040225377A1 (en) * 2002-11-15 2004-11-11 Yuri Kokotov Method, system and medium for controlling manufacture process having multivariate input parameters
US7966087B2 (en) 2002-11-15 2011-06-21 Applied Materials, Inc. Method, system and medium for controlling manufacture process having multivariate input parameters
US7272459B2 (en) 2002-11-15 2007-09-18 Applied Materials, Inc. Method, system and medium for controlling manufacture process having multivariate input parameters
US8538840B2 (en) 2002-12-20 2013-09-17 Siebel Systems, Inc. Financial services data model
US20070226093A1 (en) * 2002-12-20 2007-09-27 Chan Cynthia M Financial services data model
US7333871B2 (en) 2003-01-21 2008-02-19 Applied Materials, Inc. Automated design and execution of experiments with integrated model creation for semiconductor manufacturing tools
US8392298B2 (en) 2003-03-04 2013-03-05 Siebel Systems, Inc. Invoice adjustment data object for a common data object format
US8473399B2 (en) 2003-03-04 2013-06-25 Siebel Systems, Inc. Invoice data object for a common data object format
US20070214065A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory transaction common object
US8200539B2 (en) 2003-03-24 2012-06-12 Siebel Systems, Inc. Product common object
US8489470B2 (en) 2003-03-24 2013-07-16 Siebel Systems, Inc. Inventory location common object
US7912932B2 (en) 2003-03-24 2011-03-22 Siebel Systems, Inc. Service request common object
US9704120B2 (en) 2003-03-24 2017-07-11 Oracle International Corporation Inventory balance common object
US8510179B2 (en) 2003-03-24 2013-08-13 Siebel Systems, Inc. Inventory transaction common object
US20060271446A1 (en) * 2003-03-24 2006-11-30 Siebel Systems, Inc. Product common object
US20070208577A1 (en) * 2003-03-24 2007-09-06 Leon Maria T B Position common object
US20070214063A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory balance common object
US20070214064A1 (en) * 2003-03-24 2007-09-13 Paramjit Kahlon Inventory location common object
US20070226037A1 (en) * 2003-03-25 2007-09-27 Shailendra Garg Modeling of opportunity data
US7205228B2 (en) 2003-06-03 2007-04-17 Applied Materials, Inc. Selective metal encapsulation schemes
US7354332B2 (en) 2003-08-04 2008-04-08 Applied Materials, Inc. Technique for process-qualifying a semiconductor manufacturing tool using metrology data
US7356377B2 (en) 2004-01-29 2008-04-08 Applied Materials, Inc. System, method, and medium for monitoring performance of an advanced process control system
US6922600B1 (en) 2004-04-28 2005-07-26 International Business Machines Corporation System and method for optimizing manufacturing processes using real time partitioned process capability analysis
US7221990B2 (en) 2004-05-28 2007-05-22 Applied Materials, Inc. Process control by distinguishing a white noise component of a process variance
US7096085B2 (en) 2004-05-28 2006-08-22 Applied Materials Process control by distinguishing a white noise component of a process variance
US7349753B2 (en) 2004-05-28 2008-03-25 Applied Materials, Inc. Adjusting manufacturing process control parameter using updated process threshold derived from uncontrollable error
US6961626B1 (en) 2004-05-28 2005-11-01 Applied Materials, Inc Dynamic offset and feedback threshold
RU2451318C2 (en) * 2004-09-03 2012-05-20 КЛААС Зельбстфаренде Эрнтемашинен ГмбХ Electronic data exchange system
RU2553066C2 (en) * 2004-09-03 2015-06-10 КЛААС Зельбстфаренде Эрнтемашинен ГмбХ Data support system for agricultural processes based on electronic data exchange
US20070219929A1 (en) * 2006-03-14 2007-09-20 Jochen Steinbach Planning granularity in manufacturing computing systems
US7412295B2 (en) * 2006-03-14 2008-08-12 Sap Ag Modeling manufacturing processes to include defined markers
US8175733B2 (en) 2006-03-14 2012-05-08 Sap Ag Modeling manufacturing processes to include defined markers
US20070219656A1 (en) * 2006-03-14 2007-09-20 Mario Rothenburg Modeling manufacturing processes to include defined markers
US20090099676A1 (en) * 2006-03-14 2009-04-16 Mario Rothenburg Modeling Manufacturing Processes to Include Defined Markers
US8027857B2 (en) 2006-03-14 2011-09-27 Sap Ag Rough-cut manufacturing operations for use in planning
US7894922B2 (en) 2006-12-21 2011-02-22 Sap Ag Structural transformation of execution-level manufacturing process routings into planning-level routings
US20080154412A1 (en) * 2006-12-21 2008-06-26 Jochen Steinbach Structural transformation of execution-level manufacturing process routings into planning-level routings
US20080154660A1 (en) * 2006-12-21 2008-06-26 Jochen Steinbach Generating Planning-Level Time and Capacity Requirement Formulas for Manufacturing Processes
US7617015B2 (en) 2006-12-21 2009-11-10 Sap Ag Generating planning-level time and capacity requirement formulas for manufacturing processes
US8086467B2 (en) * 2007-12-28 2011-12-27 Japan Marine Science Inc. Process management support system and simulation method
US20090172691A1 (en) * 2007-12-28 2009-07-02 Sap Ag Streaming operations for workflow process models
US9342383B2 (en) * 2007-12-28 2016-05-17 Sap Se Streaming operations for workflow process models using multiple views on a same buffer
US20110022538A1 (en) * 2007-12-28 2011-01-27 Japan Marine Science Inc. Process management support system and simulation method
US8799186B2 (en) 2010-11-02 2014-08-05 Survey Engine Pty Ltd. Choice modelling system and method
US20140236651A1 (en) * 2013-02-15 2014-08-21 The Boeing Company Display of Process-Plan Execution
CN105590034A (en) * 2016-03-15 2016-05-18 上海市水务规划设计研究院 Flood prevention and disaster reduction capability evaluation model

Also Published As

Publication number Publication date
GB9611769D0 (en) 1996-08-07
TW371338B (en) 1999-10-01
ES2128172T3 (en) 1999-05-01
AU712238B2 (en) 1999-11-04
DE69601152D1 (en) 1999-01-28
GB2302426A (en) 1997-01-15
JPH0916686A (en) 1997-01-17
WO1997000488A1 (en) 1997-01-03
EP0776507B1 (en) 1998-12-16
CA2176531A1 (en) 1996-12-17
US5930156A (en) 1999-07-27
AU5598996A (en) 1997-01-02
EP0776507A1 (en) 1997-06-04
MY132176A (en) 2007-09-28
ATE174705T1 (en) 1999-01-15
DE69601152T2 (en) 1999-05-20
DK0776507T3 (en) 1999-08-23
MXPA97010223A (en) 2002-07-02
BR9608596A (en) 1999-01-05

Similar Documents

Publication Publication Date Title
US5764543A (en) Extensible model network representation system for process planning
Rekiek et al. State of art of optimization methods for assembly line design
US6560501B1 (en) System and method for collaborative batch aggregation and scheduling
AU764982B2 (en) Method for computerized supply chain planning
US5594639A (en) Order processing control module
Leachman et al. IMPReSS: An automated production-planning and delivery-quotation system at Harris Corporation—Semiconductor Sector
Biswas et al. Object oriented modeling and decision support for supply chains
Riane et al. An integrated production planning and scheduling system for hybrid flowshop organizations
Selcuk et al. The effect of updating lead times on the performance of hierarchical planning systems
Moreno et al. Heuristics for the FMS-loading and part-type-selection problems
Dean et al. A framework for generating product production information for mass customization
Lau et al. An intelligent logistics support system for enhancing the airfreight forwarding business
Watson et al. Order-release planning using variable lead times based on a backward simulation model
Rogers et al. Inventory positioning/partitioning for backorders optimization for a class of multi‐echelon inventory problems
Rafiei et al. Order partitioning in hybrid MTS/MTO contexts using fuzzy ANP
Euwe et al. Logistics control enabled by IT–a window in the future
Brauer et al. A goal programming model for aggregate inventory and distribution planning
Kim et al. Heuristic-Based Algorithm for Production Planning Considering Allocation Rate Conformance to Prevent Unstable Production Chain
Kazemi et al. A multi-objective integrated production-allocation and distribution planning problem of a multi-echelon supply chain network: two parameter-tuned meta-heuristic algorithms
Bangsow et al. Warehousing and Procurement
Dickersbach Distribution & Supply Chain Planning Overview
within Distribution 9 Distribution & Supply Chain Planning Overview
Pisaruk Optimization in operations management
Chen A Mathematical Model for Tactical Operations Planning for Response-Base Supply Chains
Settanni et al. Feedback loops and closed-loop recycling as a driver for dynamics

Legal Events

Date Code Title Description
AS Assignment

Owner name: I2 TECHNOLOGIES, INC., TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:KENNEDY, BRIAN M.;REEL/FRAME:007569/0759

Effective date: 19950616

STCF Information on status: patent grant

Free format text: PATENTED CASE

REFU Refund

Free format text: REFUND - PAYMENT OF MAINTENANCE FEE, 4TH YEAR, LARGE ENTITY (ORIGINAL EVENT CODE: R183); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

AS Assignment

Owner name: I2 TECHNOLOGIES US, INC., TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:I2 TECHNOLOGIES, INC.;REEL/FRAME:012025/0059

Effective date: 20010701

FPAY Fee payment

Year of fee payment: 4

FEPP Fee payment procedure

Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY

FPAY Fee payment

Year of fee payment: 8

RR Request for reexamination filed

Effective date: 20070510

FPAY Fee payment

Year of fee payment: 12

AS Assignment

Owner name: WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT, CALIFORNIA

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:JDA TECHNOLOGIES US, INC.;REEL/FRAME:026072/0353

Effective date: 20110318

Owner name: WELLS FARGO CAPITAL FINANCE, LLC, AS AGENT, CALIFO

Free format text: PATENT SECURITY AGREEMENT;ASSIGNOR:JDA TECHNOLOGIES US, INC.;REEL/FRAME:026072/0353

Effective date: 20110318

AS Assignment

Owner name: JDA TECHNOLOGIES US, INC, TEXAS

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:I2 TECHNOLOGIES US, INC;REEL/FRAME:026468/0119

Effective date: 20100205

B1 Reexamination certificate first reexamination

Free format text: CLAIMS 1, 12 AND 39 ARE CANCELLED. CLAIMS 2-11, 13-38 AND 40 WERE NOT REEXAMINED.

AS Assignment

Owner name: JDA SOFTWARE GROUP, INC., ARIZONA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JDA TECHNOLOGIES US, INC.;REEL/FRAME:026740/0676

Effective date: 20110524

Owner name: JDA SOFTWARE GROUP, INC, ARIZONA

Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:JDA TECHNOLOGIES US, INC;REEL/FRAME:026740/0676

Effective date: 20110524

AS Assignment

Owner name: JDA TECHNOLOGIES US, INC., ARIZONA

Free format text: RELEASE OF SECURITY INTEREST IN PATENT COLLATERAL;ASSIGNOR:WELLS FARGO CAPITAL FINANCE, LLC;REEL/FRAME:029529/0812

Effective date: 20121221

AS Assignment

Owner name: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, NEW YORK

Free format text: FIRST LIEN PATENT SECURITY AGREEMENT;ASSIGNOR:JDA SOFTWARE GROUP, INC.;REEL/FRAME:029556/0697

Effective date: 20121221

Owner name: CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH, NEW YORK

Free format text: FIRST LIEN PATENT SECURITY AGREEMENT;ASSIGNOR:JDA SOFTWARE GROUP, INC.;REEL/FRAME:029556/0809

Effective date: 20121221

AS Assignment

Owner name: JDA SOFTWARE GROUP, INC., ARIZONA

Free format text: RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0809;ASSIGNOR:CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH;REEL/FRAME:040337/0356

Effective date: 20161012

Owner name: JDA SOFTWARE GROUP, INC., ARIZONA

Free format text: RELEASE OF SECURITY INTEREST IN PATENTS AT REEL/FRAME NO. 29556/0697;ASSIGNOR:CREDIT SUISSE AG, CAYMAN ISLANDS BRANCH;REEL/FRAME:040337/0053

Effective date: 20161012

AS Assignment

Owner name: JDA TECHNOLOGIES US, INC., TEXAS

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF THE CONVEYING AND RECEIVING PARTIES TO INCLUDE A PERIOD AFTER THE TERM INC PREVIOUSLY RECORDED ON REEL 026468 FRAME 0199. ASSIGNOR(S) HEREBY CONFIRMS THE CHANGE OF NAME FROM I2 TECHNOLOGIES US, INC. TO JDA TECHNOLOGIES US, INC.;ASSIGNOR:I2 TECHNOLOGIES US, INC.;REEL/FRAME:055136/0623

Effective date: 20100205

AS Assignment

Owner name: JDA SOFTWARE GROUP, INC., ARIZONA

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE NAME OF THE CONVEYING AND RECEIVING PARTIES TO INCLUDE A PERIOD AFTER THE TERM INC PREVIOUSLY RECORDED AT REEL: 026740 FRAME: 0676. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT;ASSIGNOR:JDA TECHNOLOGIES US, INC.;REEL/FRAME:055257/0747

Effective date: 20110524

AS Assignment

Owner name: JDA TECHNOLOGIES US, INC., TEXAS

Free format text: CORRECTIVE ASSIGNMENT TO CORRECT THE REEL 026468 FRAME NUMBER FROM 0199 TO 0119 PREVIOUSLY RECORDED ON REEL 055136 FRAME 0623. ASSIGNOR(S) HEREBY CONFIRMS THE CORRECTION ASSIGNMENT;ASSIGNOR:I2 TECHNOLOGIES US, INC.;REEL/FRAME:056813/0110

Effective date: 20100205