Abstract: Generating an optimized pricing plan includes accessing a hierarchy comprising a sequence of levels, where each level includes an objective function and a set of constraints associated with the objective function. A mathematical programming model representing a pricing plan problem is determined for an item group comprising items. The following is repeated for each level of the sequence of levels: selecting a level comprising an objective function and a set of constraints associated with the objective function, determining an optimized boundary for the objective function, and adding a constraint generated from the optimized boundary to the set of constraints of a next level. An objective function of a last level of the sequence is optimized subject to the set of constraints associated with the objective function to yield an optimized result. An optimized pricing plan is generated in accordance with the optimized result.

Abstract: A computer-related system for visually representing a supply chain includes a supply chain physical window (12). The supply chain physical window (12) displays a plurality of supply chain entities (24), at least one supply chain bar (28) adjacent a corresponding supply chain entity (24), and at least one connector (26) between two of the supply chain entities (24). The supply chain bar (28) provides data related to the adjacent supply chain entity(24), and the connector (26) represents product flow between the two supply chain entities (24).

Abstract: A PDF file is received from an external application and key information from the PDF file, concerning a PDF document contained in the PDF file, is extracted. The extracted key information is compared with analogous reference information stored for previously received PDF documents to determine a status for the received PDF document, which is provided to the external application from which the PDF file was received. The received PDF document is a duplicate if all the extracted key information matches analogous reference information, is an updated document if certain but not all the extracted key information matches analogous reference information, or is a new document if at least certain extracted key information does not match analogous reference information. If the PDF document is a duplicate document, processing of the PDF file is returned to the application without storing any extracted key information as reference information.

Abstract: A system for generating a value for a first attribute includes a database having one or more dimensions that each include one or more members. The database includes one or more storage locations that are each associated with one member from each dimension in a set of one or more of the dimensions. A server evaluates an expression including at least one second attribute that depends on a set of one or more of the dimensions, the expression mapping at least one member of a first dimension on which the first attribute depends to at least one member of a second dimension on which the second attribute depends. The value for the first attribute is generated according to the expression. The server and database may operate in an on-line analytical processing (OLAP) environment.

Abstract: A computer-implemented method for mapping between part numbers that are based on different part numbering schemes includes receiving a first part number associated with an item, the first part number associated with the item being defined according to a first part numbering scheme. A database is searched for one or more second part numbers that are associated with the item and also cross-referenced to the first part number associated with the item, the one or more second part numbers associated with the item being defined according to one or more corresponding second part numbering schemes.

Abstract: A method for distributed automated software graphical user interface (GUI) testing includes maintaining a centralized test queue, which stores multiple software GUI test instances to be executed by multiple distributed test execution computers. Each distributed test execution computer includes a client platform and is connected to one or more server platforms. The client platforms and server platforms collectively provide multiple client-server combinations against which the tests may be executed. For each test execution computer, a request for a test instance is received from a particular test execution computer in response to completion of a preceding test by the particular test execution computer and, in response, a test instance is retrieved from the test queue.

Abstract: A computer implemented method for workflow communication is provided. The method includes the following steps. First, one or more workflows are executed. Then an event manger is triggered on the occurrence of a predefined event on the workflow. Finally, a message based on the event is formulated and sent to a fixed group.

Abstract: A method for detecting and resolving conflicts in association with a data allocation includes determining a relationship between each of a plurality of positions in a hierarchical organization of data. The method also includes selecting a position i and determining a total weight of position i. If the total weight of position i is effectively non-zero, the method further includes removing the influence of position i from the other positions and adding position i to a set of conflict-free positions.

Abstract: A computer-based system (10) for aggregating and scheduling product batches (50) includes a batch aggregation engine (20) that allocates one or more product demands (40) to one or more product batches (50) having suggested sizes and suggested starting times. The batch aggregation engine (20) communicates to a scheduling engine (30) the suggested batch sizes, the suggested starting times, and feedback (26) relating to the suggested sizes and suggested starting times to assist the scheduling engine (30) in scheduling a start time for each product batch (50). The system (10) may also include a scheduling engine (30) coupled to the batch aggregation engine (20) that receives the suggested sizes, suggested starting times, and feedback (26) from the batch aggregation engine (20). The scheduling engine (30) schedules a starting time for one or more of the batches (50) according to the suggested sizes, suggested starting times, and feedback (26) received from the batch aggregation engine (20).

Abstract: A system (100) for campaign planning includes a memory (106) operable to store at least two slab values (132) for each of a plurality of slabs (108). The slab values (132) for a slab are associated with at least two properties of the slab (108). The memory (106) is also operable to store at least one preference value (142) identifying a relative importance between the properties of the slabs (108). The system (100) also includes one or more processors (128) collectively operable to generate a sort value (400) for each of the slabs (108). The sort value (400) depends at least partially on the slab value (132) associated with the slab (108) and the preference value (142). The processor (128) is also operable to allocate the slabs (108) to a plurality of rounds (200) in a campaign (250). The slabs (108) are allocated in an order depending at least partially on the sort values (400) associated with the slabs (108).

Abstract: A computer-implemented method for routing shipments according to criticality includes accessing an initial solution to an optimization problem of routing multiple shipments to multiple locations using multiple vehicles, the initial solution including multiple loads such that each shipment is routed within exactly one load and a global cost across all loads is minimized, the initial solution being generated independent of the criticality of the shipments. Into each of one or more critical loads in a current solution, one or more non-critical shipments are inserted that are within a neighborhood of the critical load, a critical load being a load containing at least one critical shipment.

Abstract: An electronic commerce system includes one or more seller databases that store product data for one or more products. The system further includes a seller selection interface operable to receive seller requirements from a user and generate one or more custom global content directories based on the seller requirements. The custom global content directories include a plurality of product classes organized in a hierarchy with the product classes categorizing a number of products from sellers satisfying the seller requirements and associated with attributes of the products categorized in the product class. At least one of the product classes has associated pointers that identify the on or more of the seller databases. The system further includes a search interface that communicates a search query to the seller databases for product data.

Abstract: An electronic commerce system includes one or more product databases that store product data for a plurality of products. The system includes a global content directory that includes a plurality of product classes organized in a hierarchy. Each product class categorizes a number of products and is associated with one or more attributes of the products categorized in the product class. At least one of the product classes has one or more associated pointers that identify one or more of the product databases. The system further includes a search interface that communicates a search query to the product databases to search for product data stored in the product databases identified by one of the pointers. The system also includes a traffic module operable to monitor the traffic levels associated with each product class and dynamically balance searches on the product databases based on the traffic levels.

Abstract: A computer-implemented system (10) for task scheduling. The system (10) models an enterprise in terms of products, tasks and resources used to make them, and constraints imposed in scheduling tasks. A scheduling engine, comprised of a genetic algorithm (13) and a schedule builder (14), operates on the model to produce candidate schedules. The schedule builder (14) uses graph theory techniques to solve tightly constrained scheduling problems. Each candidate schedule is evaluated and used to generate an improved schedule in accordance with genetic processing, until a best schedule is produced.

Abstract: A system for displaying logistics information using one or more computers includes a presentation interface. The presentation interface generates a first panel displaying a plurality of icons and a plurality of links. The icons represent entities in a supply chain. Each link couples two of the icons and represents one or more distribution resources for moving one or more items between entities represented by the two icons. Each link indicates a distribution time associated with moving the items between the entities represented by the two icons. Each link may have a length proportional to the distribution time associated with moving the items between the entities represented by the two icons, or may include a time icon indicating the distribution time associated with moving the items between the entities represented by the two icons.

Abstract: A system and method are provided for maintaining states for user sessions with a web system. Maintaining state includes receiving a request from a user that initiates a user session with the web system and processing the request to provide a web page to the user. Session data (220) representing a state of the user session is stored in memory in a global session server (212). Then, for each subsequent request associated with the user session, the subsequent request is received, and the session data (220) is retrieved from the global session server (212). The subsequent request is then processed using the session data (220) to provide a web page to the user, and the session data (220) is changed to reflect the processing. The session data (220) is then updated in the global session server (212). The global session server (212) thereby stores session data (220) unique to each user session accumulated over multiple web transactions.

Abstract: A computer-implemented system (10) providing a three-dimensional display (30) includes at least one model (12) of an environment and at least one engine (14) operable to generate the display (30) using information associated with the model (12). The display (30) includes a graphical body (38) conveying a first value corresponding to a value of a variable, the variable value being identified according to an axis. The first value is conveyed according to a height (40) of the graphical body (38) at the variable value. The graphical body (38) conveys a second value corresponding to the variable value, the second value being conveyed according to a depth (42) of the graphical body (38) at the variable value. The graphical body (38) also conveys at least a comparison of the first value to a first comparison value according to an indicia (44) that is visible on the graphical body (38) at the variable value, the indicia (44) specified according to a predetermined scale.

Abstract: In one embodiment of the present invention, a cost savings analysis system includes one or more software components. The software components collectively receive from a user one or more first inputs specifying a cost savings goal and one or more second inputs specifying a technique for generating a baseline price. The software components collectively access historical transaction data within one or more databases needed to generate a baseline price according to the specified technique, generate the baseline price, determine a variation between the generated baseline price and an actual price for each of one or more transactions corresponding to the specified cost savings goal, and compare the determined variations for the one or more transactions with the specified cost savings goal to conduct a baseline cost savings analysis.

Abstract: A method and system for solving constrained optimization problems. An initial abstract solution represents a prioritized set of decisions. The abstract solution is used as the basis for building a concrete solution. The concrete solution is analyzed to determine one or more local moves that represent a re-prioritization of the abstract solution. After a local moves is made, the process begins again with a new abstract solution, that is closer to an optimal solution. This process continues interactively until an optimal solution is reached or approached. The prioritized set of decisions can be implemented as a priority vector or a priority graph.

Abstract: An exemplar workflow is disclosed for use in the design and deployment of a workflow for multi-enterprise collaboration. The computer implemented process involves allowing a workflow design to include at least one exemplar workflow. The exemplar workflow is associated with an exemplar node allowing at least one activity to be parameterized over a plurality of nodes within a node group. The process then involves instantiating the workflow such that the at least one exemplar workflow is instantiated as a plurality of activities each associated with a specific node in the node group. The workflow is deployed by distributing the activities over the nodes in the node group to provide multi-enterprise collaboration.