i2 TECHNOLOGIES US, INC. Patent applications |
Patent application number | Title | Published |
20110125470 | Generalizing an Optimized Supplier Allocation Plan - Generating an optimized supplier allocation plan includes identifying parts and suppliers associated with an allocation problem, where each supplier can supply at least one part. One or more objective functions are selected. Each objective function has part variables, and each part variable represents a quantity of a part to be procured from a supplier. At least one constraint constraining at least one part variable is received. The one or more objective functions are optimized with respect to the at least one constraint to yield a value for each part variable. A quantity of each part to be procured from at least one supplier is determined according to the values to generate the optimized supplier allocation plan. | 05-26-2011 |
20090271236 | Dynamically Routing Salvage Shipments and Associated Method - A system and method is disclosed for managing salvage shipments in a transportation network. The system includes a transportation planner coupled with one or more entities in the transportation network. The transportation planner determines an optimized transportation plan for delivery and pick-up of shipments throughout the transportation network. | 10-29-2009 |
20090198598 | Optimizing Inventory In Accordance with a Constrained Network - In one embodiment, optimizing inventory includes accessing service level band sets. Each service level band set is associated with a policy group, and includes service level bands. Each service level band of a service level band set has a service level priority with respect to any other service level bands of the same service level band set. An inventory band set is determined for each service level band set. Each inventory band set includes inventory bands, where each inventory band satisfies a corresponding service level band assuming an unconstrained network. Each inventory band of an inventory band set has an inventory priority with respect to any other inventory bands of the same inventory band set. A feasible supply chain plan that satisfies the inventory band sets is generated in order of the inventory priorities until a constrained network is depleted. | 08-06-2009 |
20090177516 | Redistribution of Parts in a Distribution Network - Redistributing parts includes defining locations. An actual inventory of parts is established among the locations, and a desired allocation of the parts is established among the locations. A demand for the parts at each location is determined using the actual inventory and the desired allocation. Paths are determined, where a path transfers an excess part from one location to another location. A transfer function describing a cost of transferring the excess part along the paths is generated. The transfer function is optimized to achieve the desired allocation of the excess parts at a minimum cost. | 07-09-2009 |
20090177512 | Determining A Policy Parameter For An Entity Of A Supply Chain - Determining a policy parameter for an entity of a supply chain includes establishing attributes of the entities of the supply chain. Attribute segments are established for each attribute, where an attribute segment includes one or more values of the corresponding attribute. Rules are formulated using the attribute segments to define policy groups, and policy parameters are assigned to each policy group. A policy group corresponding to an entity is identified in accordance with the rules. The policy parameters assigned to the identified policy group are determined and selected for the entity. | 07-09-2009 |
20090171856 | System and Method for Negotiating According to Improved Matching Criteria - A computer-implemented system stores profiles for parties to the negotiation, each profile specifying values for one or more parameters negotiated, the values reflecting a desirable outcome of the negotiation for the associated party. A matching server accesses an offer from a first party containing values for one or more of the parameters negotiated and computes a distance between the offer values and the profile values of a second party. If the distance is acceptably small, the server causes the offer to be accepted by the second party to conclude the negotiation. If the distance is not acceptably small, the server automatically modifies one or more values in the offer such that the distances between the modified offer and the profiles of the first and second parties are acceptably small simultaneously and causes the modified offer to be accepted by the first and second parties to conclude the automatic negotiation. | 07-02-2009 |