Abstract: For an enterprise system in which physical items are stored in physical container and in which physical container are stored in other physical containers, a data system has data records identifying logical items and logical containers that correspond to the physical items and physical containers, the data records further reflecting the storage of physical items and physical containers with other physical containers. Some of the items are identified as as high-priority items. Containers to hold the high-priority items in transit are identified. Excess capacity in the containers is identified. Low-priority items to be sent are identified. The high-priority items and the low-priority items are aggregated into a list of items-to-be-moved. A list of tasks includes instructions to move the items-to-be-moved from their respective starting logical locations to the containers is made and distributed.

Abstract: For an enterprise system in which physical items are stored in physical container and in which physical container are stored in other physical containers, a data system has data records identifying logical items and logical containers that correspond to the physical items and physical containers, the data records further reflecting the storage of physical items and physical containers with other physical containers. Some of the items are identified as as high-priority items. Containers to hold the high-priority items in transit are identified. Excess capacity in the containers is identified. Low-priority items to be sent are identified. The high-priority items and the low-priority items are aggregated into a list of items-to-be-moved. A list of tasks includes instructions to move the items-to-be-moved from their respective starting logical locations to the containers is made and distributed.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.

Abstract: Disclosed is a computer-implemented planning process that aids a system administrator in the task of creating a job schedule. The process treats enterprise computing resources as a grid of resources, which provides greater flexibility in assigning resources to jobs. During the planning process, an administrator or other user, or software, builds a job-dependency tree. Jobs are then ranked according to priority, pickiness, and network centricity. Difficult and problematic jobs then are assigned resources and scheduled first, with less difficult jobs assigned resources and scheduled afterwards. The resources assigned to the most problematic jobs then are changed iteratively to determine if the plan improves. This iterative approach not only increases the efficiency of the original job schedule, but also allows the planning process to react and adapt to new, ad-hoc jobs, as well as unexpected interruptions in resource availability.