Abstract: A system and method to improve storage efficiency in a warehouse. Storage combinations are assigned a ranking base on the distance from optimal storage. After sorting the data structure base on the ranking a best available storage combination can be identified by iterating the table in a rank order. In one embodiment, the ranking is used to identify candidates for rearrangement. By comparing the best available ranking with the current ranking, greater differences reflect greater benefit of rearrangement.

Abstract: Methods and apparatus provide a delay in posting a confirmation of a warehouse activity in a warehouse having decentralized management. The delay enables a process to be performed with respect to the goods associated with the confirmation. For example, the delay can enable a CRM system to route the goods to fulfill an order for goods. In another example, the delay can enable the performance of a correction to the confirmation of the goods.

Abstract: A method and apparatus directed to receiving maintenance demands and historical maintenance data associated with maintenance items are presented. A plurality of models that each define locations, maintenance items, resources, cycles, and average performance is generated, wherein each model represents a hypothetical scenario adjustable by a user so that a model representing one scenario may be compared alongside another model to view the differences in result for various hypothetical scenarios. One or more plans are generated for each model and take into account the received maintenance demands and historical maintenance data. A work package is generated in view of the received maintenance demands and historical maintenance data and the plan.

Abstract: A method and apparatus to efficiently round requested quantities to efficient transportation quantities in the supply chain. Target locations are organized in a sequence. A tolerance interval around the requested quantity is calculated for each target location. The requested value is then rounded to an efficient transportation quantity for each target location in its sequential order.

Abstract: A system and method are described for intelligently sourcing demand forecasts within a supply chain management (“SCM”) system based on a constrained supply chain model, in light of material and resource constraints. For example, a computer implemented method according to one embodiment of the invention comprises: calculating a demand forecast identifying anticipated demand for a product over a specified time period; identifying current sales orders for the product with delivery dates scheduled during the specified time period; generating an open forecast for the product based on the current sales orders and the anticipated demand; and sourcing different percentages of the open forecast from different plants, the percentages selected based on supply chain material and/or resource constraints. In addition, after the demand forecast is sourced, one embodiment of the invention employs additional techniques for intelligently sourcing new sales orders entering the SCM system.

Abstract: A system and method for dynamically appending prefixes to source code is described. User-selectable options for a prefix naming convention are provided to a user. Prefixes are transiently appended to variables based on a user selection. The variables are displayed with their respective prefixes in a code editor. Modifications to the source code are detected. The prefixes are removed from the modified source code and the modified source code is written to a persistent storage.

Abstract: Methods and apparatuses enable a generic mapping tool accessible to multiple applications. One or more of the applications may invoke the mapping tool to map objects to each other with a defined relationship. The mapping occurs dynamically during the run-time of the application. The flexibility of the mapping tool enables the use of standard mapping mechanisms.

Abstract: A set order that most efficiently separates a set of output vectors of a derivation table is iteratively determined for a set of input vectors belonging to the derivation table. Code is generated to evaluate the input vectors in the set order.

Abstract: Embodiments of the invention include a system for scheduling the shipment of a set of products. The shipment may be loaded into a set of vehicles and further configured to fit a set of compartments on those vehicles. The system may include attempts to fill each vehicle and the compartments of each vehicle. The system may include evaluating a set of constraints on the shipment. The constraints may include a complex logical statement.

Abstract: Embodiments of the invention include a system and process that manages scheduling and processing of orders to provide improved delivery schedules. The system attempts to schedule package deliveries in time to meet a requested delivery target time and date. This scheduling attempts to schedule a shipping time for the current day to meet next day or nearer term deadlines. The scheduling system examines schedules and shipping locations that are not optimal for minimizing costs, but provide more timely delivery including examining locations other that a facing location for shipment.

Abstract: The invention provides methods and apparatus, including computer program products, for of determining a possible lot size of units with respect to a fixed date for a chain of at least two process steps, each process step requiring a respective assigned resource, and consuming a respective time per unit for being performed by the respective assigned resource, where the process steps are sequentially dependent on each other. This is achieved by the following: (a) determining, for each resource, a respective time interval of availability during which the respective resource is continuously available, each time interval being limited by the fixed date, (b) calculating, for each determined time interval of availability, a respective largest possible number of times the respective process step can be performed by the respective resource, and (c) selecting the lot size of units to the minimum of the largest possible numbers.

Abstract: Computer-implemented method of loading goods stored in a warehouse on a vehicle for transporting and delivering to a number of destination locations, whereby the destination locations are on a predetermined route, comprising the following steps: receiving a number of delivery requests, each request specifying the goods to be delivered, and the destination locations of the goods to be delivered; receiving data descriptive of the route which the vehicle has to travel for delivering the goods at the destinations; placing the goods to be delivered on a staging area associated with the vehicle, the staging area defining a physical place where the goods are intermediately put down and sequentially picked up from for being loaded on the vehicle; whereby the goods are positioned on the staging area in such a first spatial sequence that they can be picked up there from and placed in the vehicle in such a second spatial sequence that they can be unloaded from the vehicle at the respective destination locations in the s

Abstract: A system and method for visualizing a plural dimensional data. One of a plurality of potential visualization formats is selected in a processor for each dimension of a plural dimensional data set. The selected visualization format is used to display the associated dimension on an electronic display. User interface elements are provided to navigate between elements of the plural dimensional data set within the displayed visualization format.

Abstract: A new model for transportation planning vehicle scheduling (TPVS). A database table for shipment documents independent of an order for goods, e.g., a sales order is created. When an order for goods is received, the database table is populated with a shipment document corresponding to, but independent of, the order for goods. This shipment document is owned by the TPVS system.

Abstract: A computer-implemented framework and method for maintaining product allocation data objects comprising a plurality of product allocation data objects, a plurality of software modules, an interface for the software modules, and a plurality of computer-applications, wherein the product allocation data objects are representative of product allocations for several participants within an e-business system, wherein a product allocation data object is processed by at least one of the plurality of computer-applications, the software modules providing access to the product allocation data objects, and the interface provides concurrent access to the software modules for online collaboration, wherein a collaborative planning process of the product allocation data objects is executed by the software modules and controlled by the applications.

Abstract: A system and process that groups identical values that are adjacent to one another within a column of a table. The system provides this functionality through an application and backend implementation independent module. Custom grouping information for a table or columns within a table can be stored for retrieval each time a table is open or displayed. A user can manage the customizations through a centralized portal.

Abstract: A system and method are described for identifying an appropriate demand distribution to use for safety stock planning within a supply chain management (“SCM”) system. For example, one embodiment of the invention comprises a computer-implemented method comprising: extracting historical demand characteristics for a product from a specified data source, the demand characteristics including the mean value of the demand for specified periods of time and/or the fraction of periods without any demand; evaluating the historical demand characteristics including the mean value of the demand for the specified periods and/or the fraction of periods without any demand; based on the evaluation, categorizing the demand characteristics into one of two or more different predefined categories; and using the classification to perform safety stock calculations for the product over the specified periods of time.

Abstract: Methods and apparatuses enable linking stateful transactions with multiple separate systems. The first and second stateful transactions are associated with a transaction identifier. Real time data from each of the multiple systems is concurrently presented within a single operation context to provide a transparent user experience. Context data may be passed from one system to another to provide a context in which operations in the separate systems can be linked.

Abstract: A system and method for concurrency management in an environment, in which a common pool of objects is shared by multiple users. A virtual lock owner is created for a main thread of a processing task. The main thread spawns parallel threads to update the objects in the common pool with locks. The virtual lock owner is passed to each parallel thread. Each thread (including the main thread) is associated with a thread dependent lock indicator identified by the virtual lock owner. The lifetime of the thread dependent lock indicator is coupled with the lifetime of the associated thread. The virtual lock owner is also associated with a thread independent lock indicator that has a lifetime independent of the lifetime of the main thread. Thus, the parallel threads can perform object update with lock protection even if the main thread aborts.

Abstract: A system collects ancillary data objects such as log messages from an application while the application is in use. The data objects may be stored if desired; otherwise, they may be discarded if the application begins a new transaction. Software to perform related methods is also described and claimed.