Probabilistic optimization of resource discovery, reservation and assignment
First Claim
Patent Images
1. A method of allocating multiple resources, the method comprising:
- receiving, by one or more processors, 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;
creating, by one or more processors, multiple resource type requests by retrieving flags, from the series of requests, that identify resource types for each of the multiple resources;
matching and transmitting, by one or more processors, 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, by one or more processors, a unique thread for each solution set for each of the multiple resource type requests;
reassembling, by one or more processors, threads for best solutions to the multiple resource type 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 optimal analytic engine failing to produce the best solution, transmitting, by one or more processors, a specific resource type request to another optimal analytic engine.
1 Assignment
0 Petitions
Accused Products
Abstract
A processor-implemented method, system and/or computer program product allocates 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.
230 Citations
19 Claims
-
1. A method of allocating multiple resources, the method comprising:
-
receiving, by one or more processors, 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; creating, by one or more processors, multiple resource type requests by retrieving flags, from the series of requests, that identify resource types for each of the multiple resources; matching and transmitting, by one or more processors, 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, by one or more processors, a unique thread for each solution set for each of the multiple resource type requests; reassembling, by one or more processors, threads for best solutions to the multiple resource type 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 optimal analytic engine failing to produce the best solution, transmitting, by one or more processors, a specific resource type request to another optimal 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 medium having program code embodied therewith, the program code readable and executable by a processor to:
-
receive 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; create multiple resource type requests by retrieving flags, from the series of requests, that identify resource types for each of the multiple resources; 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; generate and label a unique thread for each solution set for each of the multiple resource type requests; reassemble threads for best solutions to the multiple resource type 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 optimal analytic engine failing to produce the best solution, transmit a specific resource type request to another optimal analytic engine. - View Dependent Claims (13, 14, 15, 16)
-
-
17. 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 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; second program instructions to create multiple resource type requests by retrieving flags, from the series of requests, that identify resource types for each of the multiple resources; third 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; fourth program instructions to generate and label a unique thread for each solution set for each of the multiple resource type requests; fifth program instructions to reassemble threads for best solutions to the multiple resource type 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 sixth program instructions to, in response to a specific optimal analytic engine failing to produce the best solution, transmit a specific resource type request to another optimal analytic engine; and
whereinthe first, second, third, fourth, fifth, and sixth 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 (18, 19)
-
Specification