Probabilistic optimization of resource discovery, reservation and assignment
First Claim
Patent Images
1. A computer implemented method of allocating multiple resources, the computer implemented method comprising:
- a processor receiving a series of requests for multiple resources from multiple organizations, wherein the multiple resources are required to accomplish a task, and wherein each of the multiple resources has been assigned a probability of consumption, wherein the probability of consumption is based on a resource acquisition authorization history of a person who is requesting the multiple resources, wherein a first person having a first resource acquisition authorization history of always receiving approval for acquiring requested resources has a higher probability of consumption than a second person having a second resource acquisition authorization history of never receiving approval for acquiring requested resources;
the processor determining and transmitting, to the multiple organizations, probabilities of availability of the multiple resources;
defining a resource type for each of the multiple resources to create multiple resource type requests;
matching and transmitting each of the multiple resource type requests to one or more optimal analytic engines, wherein each different optimal analytic engine uses a different analytic technique to produce one or more solution sets for locating and apportioning resources needed to satisfy a best solution to each of the multiple resource type requests, wherein the best solution complies with predefined parameters;
generating and labeling a unique thread for each solution set for each of the multiple resource type requests; and
reassembling threads for best solutions, to the multiple resource requests, into a synthetic event, wherein the synthetic event is an emulation of the task and a completion of the task to which the multiple resources are allocated, wherein the synthetic event matches a description of the task, and wherein the synthetic event maintains a probabilistic, time period sensitive inventory of resources, requests, and demand likelihood of fulfilling the multiple resource type requests, wherein the synthetic event describes which particular resources will be allocated to the task, when said particular resources will be allocated to the task, and a likelihood of said particular resources being allocated to the task; and
in response to a specific analytic engine failing to produce the best solution, transmitting a specific resource type request to another analytic engine.
1 Assignment
0 Petitions
Accused Products
Abstract
A computer implemented method, system and/or computer program product allocate multiple resources from multiple organizations. A series of requests for multiple resources from multiple organizations is received. The multiple resources are required to accomplish a specific task, and each of the multiple resources is assigned a probability of consumption. Probabilities of availability of the multiple resources are then determined and transmitted to the organizations.
168 Citations
15 Claims
-
1. A computer implemented method of allocating multiple resources, the computer implemented method comprising:
-
a processor receiving a series of requests for multiple resources from multiple organizations, wherein the multiple resources are required to accomplish a task, and wherein each of the multiple resources has been assigned a probability of consumption, wherein the probability of consumption is based on a resource acquisition authorization history of a person who is requesting the multiple resources, wherein a first person having a first resource acquisition authorization history of always receiving approval for acquiring requested resources has a higher probability of consumption than a second person having a second resource acquisition authorization history of never receiving approval for acquiring requested resources; the processor determining and transmitting, to the multiple organizations, probabilities of availability of the multiple resources; defining a resource type for each of the multiple resources to create multiple resource type requests; matching and transmitting each of the multiple resource type requests to one or more optimal analytic engines, wherein each different optimal analytic engine uses a different analytic technique to produce one or more solution sets for locating and apportioning resources needed to satisfy a best solution to each of the multiple resource type requests, wherein the best solution complies with predefined parameters; generating and labeling a unique thread for each solution set for each of the multiple resource type requests; and reassembling threads for best solutions, to the multiple resource requests, into a synthetic event, wherein the synthetic event is an emulation of the task and a completion of the task to which the multiple resources are allocated, wherein the synthetic event matches a description of the task, and wherein the synthetic event maintains a probabilistic, time period sensitive inventory of resources, requests, and demand likelihood of fulfilling the multiple resource type requests, wherein the synthetic event describes which particular resources will be allocated to the task, when said particular resources will be allocated to the task, and a likelihood of said particular resources being allocated to the task; and in response to a specific analytic engine failing to produce the best solution, transmitting a specific resource type request to another analytic engine. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11)
-
-
12. A computer program product for allocating multiple resources, the computer program product comprising:
-
a non-transitory computer readable storage media; first program instructions to receive a series of requests for multiple resources from multiple organizations, wherein each of the multiple resources has been assigned a probability of consumption, and wherein each of the multiple resources comprises multiple hierarchies of sub-resources that are required to accomplish a task; second program instructions to determine and transmit, to the multiple organizations, probabilities of availability of the multiple resources; third program instructions to define a resource type for each of the multiple resources to create multiple resource type requests; fourth program instructions to match and transmit each of the multiple resource type requests to one or more optimal analytic engines, wherein each different optimal analytic engine uses a different analytic technique to produce one or more solution sets for locating and apportioning resources needed to satisfy a best solution to each of the multiple resource type requests, wherein the best solution complies with predefined parameters; fifth program instructions to generate and label a unique thread for each solution set for each of the multiple resource type requests; sixth program instructions to reassemble threads for best solutions to the multiple resource type requests into a synthetic event, wherein the synthetic event matches a description of the task and maintains a probabilistic, time period sensitive inventory of resources, requests, and demand likelihood of fulfilling the multiple resource type requests; and seventh program instructions to, in response to a specific analytic engine failing to produce the best solution, transmit a specific resource type request to another analytic engine; and
whereinthe first, second, third, fourth, fifth, sixth, and seventh program instructions are stored on the non-transitory computer readable storage media. - View Dependent Claims (13)
-
-
14. A computer system comprising:
-
a central processing unit (CPU), a computer readable memory, and a computer readable storage media; first program instructions to receive a series of requests for multiple resources from multiple organizations, wherein each of the multiple resources has been assigned a probability of consumption, and wherein each of the multiple resources comprises multiple hierarchies of sub-resources that are required to accomplish a task; second program instructions to determine and transmit, to the multiple organizations, probabilities of availability of the multiple resources; third program instructions to define a resource type for each of the multiple resources to create multiple resource type requests; fourth program instructions to match and transmit each of the multiple resource type requests to one or more optimal analytic engines, wherein each different optimal analytic engine uses a different analytic technique to produce one or more solution sets for locating and apportioning resources needed to satisfy a best solution to each of the multiple resource type requests, wherein the best solution complies with predefined parameters; fifth program instructions to generate and label a unique thread for each solution set for each of the multiple resource type requests; sixth program instructions to reassemble threads for best solutions to the multiple resource type requests into a synthetic event, wherein the synthetic event matches a description of the task and maintains a probabilistic, time period sensitive inventory of resources, requests, and demand likelihood of fulfilling the multiple resource type requests; and seventh program instructions to, in response to a specific analytic engine failing to produce the best solution, transmit a specific resource type request to another analytic engine; and
whereinthe first, second, third, fourth, fifth, sixth, and seventh program instructions are stored on the non-transitory computer readable storage media for execution by the CPU via the computer readable memory. - View Dependent Claims (15)
-
Specification