Computer implemented resource allocation model and process to dynamically and optimally schedule an arbitrary number of resources subject to an arbitrary number of constraints in the managed care, health care and/or pharmacy industry
First Claim
1. A computer-implemented method of dynamically scheduling an arbitrary number of resources from among a plurality of resources of a work-producing system, wherein the work-producing system comprises a pharmacy, said method comprising the steps of:
- (a) in a computer system, sorting, in a predetermined order, available resources by an arbitrary number of tasks from among a plurality of tasks of the work-producing system performable per resource, and rate per task, and determining at least one queue responsive to said sorting, wherein the tasks are subject to an arbitrary number of constraints from among a plurality of constraints of the work-producing system, wherein the rate per task characteristizes the processing of pharmaceutical orders processed in the at least one task for a time period, the at least one task including reviewing a pharmaceutical order, dispensing a pharmaceutical prescription as part of the pharmaceutical order, and verifying the pharmaceutical order; and
(b) assigning the available resources to the at least one task from among a plurality of tasks of the work-producing system subject to at least one constraint from among a plurality of constraints of the work-producing system,wherein said sorting step (a), and said assigning step (b) are performed according to a resource allocation model,wherein the resource allocation model includes entities with variable attributes having variable quantities that transform through at least one network of nodes; and
wherein each node of the at least one network of nodes includes an associated set of attributes and parameters, the attributes include the resource;
each node or at least one network of nodes exists for a pre-determined time period.
4 Assignments
0 Petitions
Accused Products
Abstract
A method of allocating resources includes scheduling jobs from among a plurality of resources of a work-producing system. The work producing system is a pharmacy. The method includes the steps of sorting, in a predetermined order, available resources to be utilized in the pharmacy by a last task assignment, a number of tasks performable, rate per task, and/or cost per hour, and determining one or more queues responsive to the sorting. The method also includes the step of normalizing the queue by dividing a current task queue by an average rate of the available resources for each task in the current task queue. The method also includes the step of assigning the available resources to one or more tasks with a predetermined normalized queue, subject to at least one task constraint.
-
Citations
76 Claims
-
1. A computer-implemented method of dynamically scheduling an arbitrary number of resources from among a plurality of resources of a work-producing system, wherein the work-producing system comprises a pharmacy, said method comprising the steps of:
-
(a) in a computer system, sorting, in a predetermined order, available resources by an arbitrary number of tasks from among a plurality of tasks of the work-producing system performable per resource, and rate per task, and determining at least one queue responsive to said sorting, wherein the tasks are subject to an arbitrary number of constraints from among a plurality of constraints of the work-producing system, wherein the rate per task characteristizes the processing of pharmaceutical orders processed in the at least one task for a time period, the at least one task including reviewing a pharmaceutical order, dispensing a pharmaceutical prescription as part of the pharmaceutical order, and verifying the pharmaceutical order; and (b) assigning the available resources to the at least one task from among a plurality of tasks of the work-producing system subject to at least one constraint from among a plurality of constraints of the work-producing system, wherein said sorting step (a), and said assigning step (b) are performed according to a resource allocation model, wherein the resource allocation model includes entities with variable attributes having variable quantities that transform through at least one network of nodes; and wherein each node of the at least one network of nodes includes an associated set of attributes and parameters, the attributes include the resource;
each node or at least one network of nodes exists for a pre-determined time period. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27)
-
-
28. A method of dynamically scheduling an arbitrary number of resources from among a plurality of resources of a pharmacy system, said method comprising the steps of:
-
(a) in a computer system, sorting, in a predetermined order, available resources by a an arbitrary number of tasks from among a plurality of tasks of the pharmacy system performable per resource, and rate per task, and determining at least one queue responsive to said sorting, wherein the tasks are subject to an arbitrary number of constraints from among a plurality of constraints of the pharmacy system, wherein the rate per task characterizes the number of pharmaceutical orders processed in the at least one task for a time period, the at least one task including reviewing a pharmaceutical order, dispensing a pharmaceutical prescription as part of the pharmaceutical order, and verifying the pharmaceutical order; (b) assigning the available resources to the at least one task from among a plurality of tasks of the pharmacy system subject to at least one constraint from among a plurality of constraints of the pharmacy system; and
assigning the available resources to a varying set of tasks having varying individual rates and variable individual demands, wherein the at least one task is performed at least one of manually and automatically,wherein said sorting step (a), and said assigning step (b) are performed according to a resource allocation model, wherein the resource allocation model includes entities with variable attributes having variable quantities that transform through at least one network of nodes; and wherein each node of the at least one network of nodes includes an associated set of attributes and parameters, the attributes include the resource;
each node or at least one network of nodes exists for a pre-determined time period. - View Dependent Claims (29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52)
-
-
53. A method of dynamically scheduling an arbitrary number of resources from among a plurality of resources of a pharmacy system, said method comprising the steps of:
-
(a) in a computer system, sorting, in a predetermined order, available resources by a an arbitrary number of tasks from a plurality of tasks of the pharmacy system performable per resource, and rate per task, and determining at least one queue responsive to said sorting, wherein the tasks are subject to an arbitrary number of constraints from among a plurality of constraints of the pharmacy system, wherein the rate per task characterizes the number of pharmaceutical orders processed in the at least one task for a time period, the at least one task including reviewing a pharmaceutical order, dispensing a pharmaceutical prescription as part of the pharmaceutical order, and verifying the pharmaceutical order. (b) assigning the available resources to at least one task from among a plurality of tasks of the pharmacy system with a predetermined queue subject to at least one constraint from among a plurality of constraints of the pharmacy system; and (c) dynamically re-allocating the available resources at the end of a real time period, in a same day, for at least one task, including;
repeating steps (a) and (b), re-determining the at least one queue after assignment of the available resources, and designating the assigned resource as unavailable until a predetermined real time when the assigned available resource expires,wherein said sorting step (a), and said assigning step (b) are performed according to a resource allocation model, wherein the resource allocation model includes entities with variable attributes having variable quantities that transform through at least one network of nodes; and wherein each node of the at least one network of nodes includes an associated set of attributes and parameters, the attributes include the resource;
each node or at least one network of nodes exists for a pre-determined time period. - View Dependent Claims (54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76)
-
Specification