Resource Allocation

1. A resource allocation method, comprising: determining, using a processor, at least one candidate allocation time period according to a resource benefit time step function, wherein a benefit of a resource does not vary with time in said at least one candidate allocation time period; converting, with said processor and a resource cost time step function, said resources into sub-resources; converting said sub-resources into sub-resource groups by correspondingly applying any pre-determined relations between said resources to said sub-resources wherein said sub-resource groups comprise sub-resources representative of all possible values of resource costs and any exclusive relations between said resources, and wherein the resource costs of the sub-resources depend on request moments corresponding to the sub-resources and the resource cost time step function, and wherein converting said sub-resources into sub-resource groups further comprises removing sub-resources whose request moments are posterior to any candidate allocation moments; and with respect to said at least one candidate allocation time period, inputting said sub-resource groups into a resource schedule optimizer to obtain optimized results with respect to said sub-resource groups and said at least one candidate allocation time period.

2. The method according to claim 1 , wherein converting said sub-resources into sub-resource groups comprises: using a plurality of sub-resource groups to represent various combinations of the resource costs, wherein each of the plurality of sub-resource groups comprises sub-resources representative of a combination of the resource costs.

3. A resource allocation system comprising: a processor; and memory connected to the processor, wherein the memory is encoded with instructions and wherein the instructions when executed comprise: instructions for determining at least one candidate allocation time period according to a resource benefit time step function, wherein a benefit of a resource does not vary with time in said at least one candidate allocation time period; instructions for converting, with said processor and a resource cost time step function, said resources into sub-resources; instructions for converting said sub-resources into sub-resource groups by correspondingly applying any pre-determined relations between said resources to said sub-resources wherein said sub-resource groups comprise sub-resources representative of all possible values of resource costs and any exclusive relations between said resources, and wherein the resource costs of the sub-resources depend on request moments corresponding to the sub-resources and the resource cost time step function, and wherein converting said sub-resources into sub-resource groups further comprises removing sub-resources whose request moments are posterior to any candidate allocation moments; and instructions for, with respect to said at least one candidate allocation time period, inputting said sub-resource groups into a resource schedule optimizer to obtain optimized results with respect to said sub-resource groups and said at least one candidate allocation time period.

4. The system according to claim 3 , wherein instructions for converting said sub-resources into sub-resource groups comprises: instructions for using a plurality of sub-resource groups to represent various combinations of the resource costs, wherein one of the plurality sub-resource groups comprises sub-resources representative of a combination of the resource costs.

5. A computer program product for resource allocation, the computer program product comprising a computer readable storage device having computer readable program code embodied therewith, the computer readable program code comprising: computer readable program code configured to determine at least one candidate allocation time period according to a resource benefit time step function, wherein a benefit of a resource does not vary with time in said at least one candidate allocation time period; computer readable program code configured to convert, using a resource cost time step function, said resources into sub-resources; computer readable program code configured to convert said sub-resources into sub-resource groups by correspondingly applying any pre-determined relations between said resources to said sub-resources wherein said sub-resource groups comprise sub-resources representative of all possible values of resource costs and any exclusive relations between said resources, and wherein the resource costs of the sub-resources depend on request moments corresponding to the sub-resources and the resource cost time step function, and wherein converting said sub-resources into sub-resource groups further comprises removing sub-resources whose request moments are posterior to any candidate allocation moments; and computer readable program code configured to, with respect to the at least one candidate allocation time period, input said sub-resource groups into a resource schedule optimizer to obtain optimized results with respect to said sub-resource groups and said at least one candidate allocation time period.

6. The computer program product of claim 5 , wherein the computer readable program code configured to convert said sub-resources into sub-resource groups comprises: computer readable program code configured to use a plurality of sub-resource groups to represent various combinations of the resource costs, wherein each of the plurality of sub-resource groups comprises sub-resources representative of a combination of the resource costs.