초록 ▼

An improved scheduling system is effective to schedule resources in a resource constrained environment. The first step in the process is initialization wherein the set of requests to be scheduled and the processing controls are input to the system. A primary sort is done to determine the order of re

An improved scheduling system is effective to schedule resources in a resource constrained environment. The first step in the process is initialization wherein the set of requests to be scheduled and the processing controls are input to the system. A primary sort is done to determine the order of request processing according to an “importance”ranking. Next, the feasible segments are determined. This determination defines the times where the request could conceivably be scheduled with respect to constraints and resource availabilities. A dynamic laxity determination implements a set of heuristics which models a request\s allocation possibilities by taking into account the remaining unscheduled requests with which it conflicts. Account is taken of those requests which require multiple concurrent resources by combining multiple resources. A worthiness determination is made which defines a function indicating advantageous start times admitting high worth values. The best start time is determined for request scheduling by combining factors such as worth and request interactions. The request is then placed into the schedule. The primary sort is then resorted in light of the present schedule and processing controls.

대표청구항 ▼

A scheduling method for scheduling resources in a resource constrained environment comprising the steps of: receiving a set of requests to be scheduled and inputting processing controls; performing a primary sort of input requests to determine an order of request processing according to an importanc

A scheduling method for scheduling resources in a resource constrained environment comprising the steps of: receiving a set of requests to be scheduled and inputting processing controls; performing a primary sort of input requests to determine an order of request processing according to an importance ranking; determining from the primary sort of input requests the times when a request could be scheduled with respect to constraints and resource availabilities; determining a dynamic laxity using a set of heuristics which computes the allocation possibilities of a request by taking into account remaining unscheduled requests with which it conflicts; combining multiple resources to account for those requests which require multiple concurrent resources after the step of determining the dynamic laxity; and then repeating steps of determining the times when a request could be scheduled and determining dynamic laxity; making a worthiness determination of each request, said worthiness determination defining a function indicating advantageous start times admitting high work values; determining a best start time for request scheduling by combining factors including worth and request interactions; and placing the requests into a schedule.