The present invention generally relates to workload balancing for pharmacy resources connected by a computer network.
Existing pharmacy networks performing order processing may suffer from inefficient distribution of workload. Many factors may contribute to this inefficient distribution. For example, a first location may receive a greater amount of order volume than a second location, equipment at a first facility may be more efficient than in a second facility, or employees at a first location may be more efficient (e.g., better skilled) than in a second retail location. While these pharmacy networks may benefit from redistributing workload, existing pharmacy information systems do not provide this functionality.
Certain retail industries, such as pharmacies, process discrete product orders on the premises of a retail store. Processing of the order may be separated into information processing of the order and physical processing of the order. Because information processing of the order may not need to be performed completely by a single resource and/or at a particular location, the information processing portion of the order fulfillment process may be sent to another resource for execution, e.g., another retail store. This redistribution of work may be especially useful in a franchise retail store network where a corporate entity may have the power to manage distribution and completion of work within the network. However, a distribution system and method may be required to obtain such a workload distribution objective.
The method and system claimed in the present application provide a process for distributing workload amongst a plurality of pharmacy resources that are connected by a computer network. While the specific method and system will be described to apply to a pharmacy retail network embodiment, it is emphasized that this process may be applied to other retail industries as well.
One embodiment of the claims involves queuing pharmacy prescription orders at each pharmacy resource. Metrics may be taken by a client or a server computer, or may even be taken manually, to determine the workload for each pharmacy resource in the network. A distribution of the current workload may be generated to assist in determining which resources may be overworked and which resources may be under worked. This distribution information may be used to determine a more efficient target workload distribution. The target workload distribution may be implemented by rerouting workload between pharmacy resources in the network. In one embodiment, this may be performed by designating pharmacies as senders or receivers and routing work orders from sender queues to receiver queues.
In another embodiment, workload may be redistributed based on a demand for a drug type and/or a capacity of a pharmacy resource to process orders for that drug type. In this embodiment a pharmacy resource may be assigned or designated a specific order process function to perform and work orders may be routed to the pharmacy resource for processing a portion of work related to the function. For example, a pharmacy resource may be designated a receiver for prescription orders having a certain drug type. Consequently, work orders for the drug type may be rerouted to the pharmacy resource for at least a portion of the order processing.
a and 5b illustrate possible pharmacy information processing flows;
Although the following text sets forth a detailed description of numerous different embodiments, it should be understood that the legal scope of the invention is defined by the word of the claims set forth at the end of this patent. The detailed description is to be construed as exemplary only and does not describe every possible embodiment since describing every possible embodiment would be impractical, if not impossible. Numerous alternative embodiments could be implemented, using either current technology or technology developed after the filing date of this patent, which would still fall within the scope the claims.
It should also be understood that, unless a term is expressly defined in this patent using the sentence “As used herein, the term ‘——————’ is hereby defined to mean . . . ” or a similar sentence, there is no intent to limit the meaning of that term, either expressly or by implication, beyond its plain or ordinary meaning, and such term should not be interpreted to be limited in scope based on any statement made in any section of this patent (other than the language of the claims). To the extent that any term recited in the claims at the end of this patent is referred to in this patent in a manner consistent with a single meaning, that is done for sake of clarity only so as to not confuse the reader, and it is not intended that such claim term be limited, by implication or otherwise, to that single meaning. Finally, unless a claim element is defined by reciting the word “means” and a function without the recital of any structure, it is not intended that the scope of any claim element be interpreted based on the application of 35 U.S.C. §112, sixth paragraph.
The network computer 30 may be a server computer of the type commonly employed in networking solutions. The network computer 30 may be used to accumulate, analyze, and download pharmacy data. For example, the network computer 30 may periodically receive data from each of the pharmacies 20 indicative of information pertaining to a prescription order, billing information, employee data, etc. The pharmacies 20 may include one or more facility servers 36 that may be utilized to store information for a plurality of customers/employees/accounts/etc. associated with each facility.
Although the data network 10 is shown to include one network computer 30 and three pharmacies 20, it should be understood that different numbers of computers and pharmacies may be utilized. For example, the network 32 may include a plurality of network computers 30 and dozens of pharmacies 20, all of which may be interconnected via the network 32. According to the disclosed example, this configuration may provide several advantages, such as, for example, enabling near real time uploads and downloads of information as well as periodic uploads and downloads of information. This provides for a primary backup of all the information generated in the process of updating and accumulating pharmacy data.
The controller 50 may include a program memory 60, a microcontroller or a microprocessor (MP) 62, a random-access memory (RAM) 64, and an input/output (I/O) circuit 66, all of which may be interconnected via an address/data bus 70. It should be appreciated that although only one microprocessor 62 is shown, the controller 50 may include multiple microprocessors 62. Similarly, the memory of the controller 50 may include multiple RAMs 64 and multiple program memories 60. Although the I/O circuit 66 is shown as a single block, it should be appreciated that the I/O circuit 66 may include a number of different types of I/O circuits. The RAM(s) 64 and programs memories 60 may be implemented as semiconductor memories, magnetically readable memories, and/or optically readable memories, for example. The controller 50 may also be operatively connected to the network 32 via a link 72.
The pharmacies 20 may have a facility server 36, which includes a controller 80, wherein the facility server 36 is operatively connected to a plurality of client device terminals 82 via a network 84. The network 84 may be a wide area network (WAN), a local area network (LAN), or any other type of network readily known to those persons skilled in the art. The client device terminals 82 may also be operatively connected to the network computer 30 from
Similar to the controller 50 from
The client device terminals 82 may include a display 96, a controller 97, a keyboard 98 as well as a variety of other input/output devices (not shown) such as a scanner, printer, mouse, touch screen, track pad, track ball, isopoint, voice recognition system, etc. Each client device terminal 82 may be signed onto and occupied by a pharmacy employee to assist them in performing their duties. Pharmacy employees may sign onto a client device terminal 82 using any generically available technique, such as entering a user name and password. If a pharmacy employee is required to sign onto a client device terminal 82, this information may be passed via the link 84 to the facility server 36, so that the controller 80 will be able to identify which pharmacy employees are signed onto the system and which client device terminals 82 the employees are signed onto. This may be useful in monitoring the pharmacy employees'productivity.
Typically, facility servers 36 store a plurality of files, programs, and other data for use by the client device terminals 82 and the network computer 30. One facility server 36 may handle requests for data from a large number of client device terminals 82. Accordingly, each facility server 36 may typically comprise a high end computer with a large storage capacity, one or more fast microprocessors, and one or more high speed network connections. Conversely, relative to a typical facility server 36, each client device terminal 82 may typically include less storage capacity, a single microprocessor, and a single network connection.
The prescriptions that have finished information processing are ready for physical processing to fill the prescription. The physical process of filing the prescription at the retail location may begin with the printing of a prescription label 411 from the queue 405. The scheduling and printing may be automated, and may be in accordance with the process described in U.S. application Ser. No. 11/253,252, entitled, “System For Separating And Distributing Pharmacy Order Processing,” taking into account desired delivery times, customer waiting requirements, etc. Based on the label 411, and/or instruction set, a pharmacist 406 may physically prepare the drug by mixing compounds 407 to produce a final prescription drug, receive pre-processed compounds and formulations, or otherwise obtain the materials necessary to fill the prescription 408 based on the label. The queue 405 may be operated as a first in, first out (FIFO) stack process, where newly entered orders are placed on top of the queue while orders are pulled from the bottom of the queue for filling.
In a pharmacy embodiment, work for each prescription order may be divided between physical preparation of a prescribed drug and the processing of prescription information required to prepare the drug. For example, referring to
The information processing portion of work may be performed by multiple pharmacy resources, e.g., pharmacy employees, at different locations. Therefore, an embodiment may distribute this work portion amongst a number of pharmacy resources to improve overall network processing efficiency. While
Referring again to
The process of distributing information processing for a network of pharmacies will now be described. The workload for each pharmacy may be determined in a number of ways. Generally, workload may be determined by determining the amount of work performed in a given amount of time. Because one of the described embodiments is concerned with pharmacy related work and pharmacy efficiency, a workload calculation that uses a pharmacy related work factor and pharmacy efficiency factor is useful. Pharmacy workload may be determined as the ratio of the number of prescriptions filled to the total number of man hours for a given store:
Man hours may be calculated as a unit of one hour's work performed by an average pharmacy employee, which may be adjusted or weighted based on the type of employee, e.g., a pharmacist, a pharmacy technician, clerks, etc.
The prescription volume may be manually tabulated, or determined by a computer. For example, the network computer may simply sum the number of prescriptions filled for each day and use this number. The computer may calculate the average number of prescriptions being fulfilled over a shorter or longer time period as desired. If a manual collection system is implemented, a reasonable amount of time for collecting workload data may be a 1-2 week period. For automated systems, the collection time may be made arbitrarily small, e.g., on the order of hours, minutes, seconds, etc.
As illustrated in
Once the workload information from the pharmacies is collected, a current workload distribution 601 of a network of pharmacies may then be determined and a redistribution strategy may be analyzed. The analysis may be facilitated by using a distribution graph as illustrated in
In one embodiment, stores in which workload needs to be redistributed from may be designated as sender stores/resources, while stores in which workload needs to be redistributed to may be designated as receiver stores/resources. Sender stores may be stores in which the workload is higher than a given threshold or average, while receiver stores may be stores in which the workload is lower than a given threshold or average. Thresholds may be determined based on the current workload distribution and target workload distribution. As illustrated in
Once the stores/resources are designated as senders or receivers, a sender network computer may begin taking unprocessed prescription orders from its queue and sending them to a receiver store/resource queue. The number of prescriptions sent or accepted may be based on a workload level and routing rate that is adjusted in order to meet a target distribution for a particular period of time. For example, a first store may have a workload of 8 prescriptions/man-hour, while the target workload is set at 6 prescriptions/man-hour. The system may set a routing rate such that the first store sends prescriptions to a set of receivers until its workload stabilizes at 6 over a period of time.
Metrics may be taken on a periodic basis such that when a threshold is met, the designation of a store automatically changes. The shorter the period for recalculating workload distribution, the quicker the response for a change in store volume or manpower. For example, should the above mentioned store begin to average only 5 prescriptions/man-hour, the store may be changed from a sender to a receiver. An alternate designation may be non-participating, or neutral. This designation may be placed when the store is performing within a target range at a particular efficiency or when the store is performing within a target workload range. In the above example, if the store is operating at 6 prescriptions/man-hour without intervention (or within a lower and upper threshold around 6 prescriptions/man-hour), it may be designated as non-participating or neutral. It should be noted that the neutral designation may be placed on a store for other reasons, e.g., neutral may be placed on stores that are non-functioning, or non-participating.
The flowchart of
When a store switches designations, it may continue processing the work placed in its queue even if the work is from another pharmacy. However, if the store has been switched from a sender to a receiver or from a receiver to a sender, priority routing may be performed based on ownership of the order. For example, in a store that has switched from a receiver to a sender, the store may first send off work that was not originated from its store. Also, if a prior sender has become a receiver and a prior receiver has become a sender the current sender may direct work back to the receiver that sent it.
Additional metrics may be used to determine the efficacy of a workload distribution. For example, a cost metric may be used to determine if the increase in the average prescriptions/man-hour rate for the network translates into a cost savings. This may be done by factoring in the number of prescriptions sent to the receiving stores, the number of prescriptions completed by the receiving stores, and then calculating the financial benefit to a store based on possible missed prescriptions. This report may be called a missed opportunity report.
Workload distribution may be based on a capacity of a network resource to process product demand. In the case of a pharmacy network system, demand may be based on the number of prescriptions that need to be processed in a given amount of time, e.g., a promised delivery time. (Queued prescriptions may be arranged by promised time, and consequently, demand may be based on the promised times of prescription orders in a queue.) Pharmacy resource capacity may be based on the rate at which the resource can process a number of prescriptions. This rate may be estimated based on historic data for the resource. For example, metrics may be taken to determine the average time necessary for a pharmacy resource to process a number of prescription orders. The capacity of the resource can then be estimated by calculating the amount of time necessary to process the prescription orders in its queue and comparing this to a desired time, such as a promised delivery time, for the prescription orders. If the estimated finish time approaches or exceeds the desired time, then the pharmacy resource may have insufficient capacity and be designated as a sender. If the estimated finish time is less than the desired time by a threshold, then the pharmacy resource may have excess capacity and may be designated as a receiver. The threshold may be based, for example, on the amount of time needed for a resource to process an additional order within the desired time for that order. In one embodiment, the promised time of queued work orders for a pharmacy resource may be averaged and the pharmacy resource may be designated a receiver or sender based on whether the averaged promised time is above or below a threshold.
Workload distribution may be further based on product type and resource type. In a pharmacy system comprising a network of pharmacy resources, each pharmacy may be outfitted with identical equipment, inventory, and personnel for processing standard drug prescription orders. However, there are non-standard or non-traditional drugs that may require different equipment, special materials, and/or different technical expertise to process. Outfitting every facility with similar equipment and inventory to account for non-traditional drugs could be prohibitively expensive. Providing expert personnel at each store location in a network may also be difficult, if not impossible. Also, more often than not, the demand for non-traditional drugs and even a portion of traditional drugs, is not substantial enough to justify an additional expenditure in equipment, inventory, and human resources for each store.
A pharmacy system may thus assign or designate certain resources, e.g., facilities or personnel, to process a portion of a prescription order based on drug type. The assignment may be based on a demand for the drug type and/or a capacity of a resource to process the drug type. In this case, the capacity of the resource may be based on the efficiency and cost of using the pharmacy resource, not just its capacity to fill a demand in a given time. A workload distribution system may accordingly route prescription orders for specific drug types primarily to the designated pharmacy resources having the capacity to process the drug types, thereby leveraging pharmacy resource expertise and/or economies of scale. The designated pharmacy resource may be called a process center for the specific drug type.
In one embodiment, assigning a pharmacy resource to process the prescription order may be based on minimizing a difference between the system demand for the drug type and the capacity of a set of pharmacy resources.
When a pharmacy resource is designated as a process center, that pharmacy'resource may be a primary receiver for prescription orders associated with a drug type that the pharmacy resource is assigned to process. If there is only one pharmacy resource assigned to process a drug type, for example compound drugs, then all compound drug prescriptions in the network may be routed to that pharmacy resource. However, if demand exceeds the capacity of the single resource, more pharmacy resources may be assigned to handle the workload. This is the case illustrated in 1104, where two pharmacy resources (locations 3 and 4) are designated pet centers.
Determining capacity of the resource may involve determining the existence of equipment, availability of materials at the facility to process the drug type, and availability of the equipment. Availability of the equipment may be based on the existing workload of the equipment. Availability of equipment may also be based on a configuration of the equipment. For example, identical equipment may be used to process two different drug types, but a different equipment setup may be required to produce each drug type. In this case, equipment capacity may take into account a transition time required to configure the equipment to process a prescription order associated with a different drug type. Efficiency of the pharmacy resource or equipment may also be based on the transition time.
A pharmacy resource may be an individual pharmacist. Pharmacists for performing specialty drug processing may be located in a number of different locations, including retail stores, other specialty stores, or home locations. A distribution table such as 1200 in
In one embodiment, determining the capacity of a pharmacist may include determining the availability of the pharmacist to process a drug type. This may be based on a pharmacist work schedule 1230. Determining the capacity of the pharmacist may also be based on an expertise level 1240 of the pharmacist and a labor cost of the pharmacist. The expertise level may be based on a certification of a pharmacist to perform processing for specialized drugs. This certification may be based on legal standards. The expertise level may also be determined by a pharmacy company. For example, the expertise level may be based on an accuracy rating of the pharmacist and/or efficiency of the pharmacist, where efficiency may be based on the pharmacist's rate of processing a specific drug type.
While
Workload distribution may also be based on anticipated capacity changes of a pharmacy resource. For example, in emergency situations, (e.g., a natural disaster causing evacuation of pharmacists) work may be manually redirected to non-affected locations and stores. In another example, there may be anticipated intermittent staffing and/or availability changes (e.g., equipment maintenance periods, staff vacations, etc.) which may cause the efficiency of a resource to decrease. In this situation, a target workload distribution may involve placing a smaller workload on pharmacy resources in which there is an anticipated shortage in capacity. The determination of the target workload distribution may also consider the workload backlog at a particular location and adjust that location up or down accordingly. It should be noted that an anticipated staffing shortage may be accounted for when calculating the workload for the store and/or when determining an appropriate target workload distribution. Furthermore, in addition to anticipating staffing changes, an embodiment of the claims may proactively adjust staffing in order to effect workload of a pharmacy to achieve a target workload distribution of the network.
Number | Name | Date | Kind |
---|---|---|---|
4457772 | Haynes et al. | Jul 1984 | A |
4852001 | Tsushima et al. | Jul 1989 | A |
5053970 | Kurihara et al. | Oct 1991 | A |
5072383 | Brimm et al. | Dec 1991 | A |
5260868 | Gupta et al. | Nov 1993 | A |
5289370 | Lirov | Feb 1994 | A |
5337919 | Spaulding et al. | Aug 1994 | A |
5548518 | Dietrich et al. | Aug 1996 | A |
5559710 | Shahraray et al. | Sep 1996 | A |
5597995 | Williams et al. | Jan 1997 | A |
5615121 | Babayev et al. | Mar 1997 | A |
5619991 | Sloane | Apr 1997 | A |
5630070 | Dietrich et al. | May 1997 | A |
5737539 | Edelson et al. | Apr 1998 | A |
5737728 | Sisley et al. | Apr 1998 | A |
5748907 | Crane | May 1998 | A |
5758095 | Albaum et al. | May 1998 | A |
5765139 | Bondy | Jun 1998 | A |
5790785 | Klug et al. | Aug 1998 | A |
5797515 | Liff et al. | Aug 1998 | A |
5801755 | Echerer | Sep 1998 | A |
5826236 | Narimatsu et al. | Oct 1998 | A |
5826252 | Wolters, Jr. et al. | Oct 1998 | A |
5845255 | Mayaud | Dec 1998 | A |
5852259 | Yanase et al. | Dec 1998 | A |
5907493 | Boyer et al. | May 1999 | A |
5911687 | Sato et al. | Jun 1999 | A |
5915240 | Karpf | Jun 1999 | A |
5924074 | Evans | Jul 1999 | A |
5946883 | Yuyama et al. | Sep 1999 | A |
5954640 | Szabo | Sep 1999 | A |
5963911 | Walker et al. | Oct 1999 | A |
5970462 | Reichert | Oct 1999 | A |
5987519 | Peifer et al. | Nov 1999 | A |
6067524 | Byerly et al. | May 2000 | A |
6078912 | Buerger et al. | Jun 2000 | A |
6112182 | Akers et al. | Aug 2000 | A |
6202080 | Lu et al. | Mar 2001 | B1 |
6202923 | Boyer et al. | Mar 2001 | B1 |
6208973 | Boyer et al. | Mar 2001 | B1 |
6256550 | Wu et al. | Jul 2001 | B1 |
6266655 | Kalyan | Jul 2001 | B1 |
6294999 | Yarin et al. | Sep 2001 | B1 |
6311163 | Sheehan et al. | Oct 2001 | B1 |
6330491 | Lion | Dec 2001 | B1 |
6347329 | Evans | Feb 2002 | B1 |
6364517 | Yuyama et al. | Apr 2002 | B1 |
6370841 | Chudy et al. | Apr 2002 | B1 |
6381577 | Brown | Apr 2002 | B1 |
6397190 | Goetz | May 2002 | B1 |
6421650 | Goetz et al. | Jul 2002 | B1 |
6438451 | Lion | Aug 2002 | B1 |
6463417 | Schoenberg | Oct 2002 | B1 |
6464142 | Denenberg et al. | Oct 2002 | B1 |
6477442 | Valerino, Sr. | Nov 2002 | B1 |
6493427 | Kobylevsky et al. | Dec 2002 | B1 |
6496427 | Kojima et al. | Dec 2002 | B2 |
6523009 | Wilkins | Feb 2003 | B1 |
6539281 | Wan et al. | Mar 2003 | B2 |
6564121 | Wallace et al. | May 2003 | B1 |
6625952 | Chudy et al. | Sep 2003 | B1 |
6665740 | Mason et al. | Dec 2003 | B1 |
6711460 | Reese | Mar 2004 | B1 |
6735497 | Wallace et al. | May 2004 | B2 |
6741724 | Bruce et al. | May 2004 | B1 |
6874684 | Denenberg et al. | Apr 2005 | B1 |
6947900 | Giordano, III et al. | Sep 2005 | B2 |
7058584 | Kosinski et al. | Jun 2006 | B2 |
7111780 | Broussard et al. | Sep 2006 | B2 |
7139639 | Broussard et al. | Nov 2006 | B2 |
20010009005 | Godin et al. | Jul 2001 | A1 |
20020019786 | Gonzalez et al. | Feb 2002 | A1 |
20020052770 | Podrazhansky | May 2002 | A1 |
20020062175 | Lion | May 2002 | A1 |
20020062230 | Morag et al. | May 2002 | A1 |
20020120573 | McCormick | Aug 2002 | A1 |
20020153411 | Wan et al. | Oct 2002 | A1 |
20020188467 | Eke | Dec 2002 | A1 |
20020198454 | Seward et al. | Dec 2002 | A1 |
20030074234 | Stasny | Apr 2003 | A1 |
20030109950 | Andrade et al. | Jun 2003 | A1 |
20030149599 | Goodall et al. | Aug 2003 | A1 |
20030179287 | Kozic et al. | Sep 2003 | A1 |
20030225595 | Helmus et al. | Dec 2003 | A1 |
20040019794 | Moradi et al. | Jan 2004 | A1 |
20040117046 | Colle et al. | Jun 2004 | A1 |
20040133705 | Broussard et al. | Jul 2004 | A1 |
20040220829 | Baharav et al. | Nov 2004 | A1 |
20040221034 | Kausik et al. | Nov 2004 | A1 |
20040260577 | Dahlin et al. | Dec 2004 | A1 |
20050075902 | Wager et al. | Apr 2005 | A1 |
20050125798 | Peterson | Jun 2005 | A1 |
20060041330 | Ansari et al. | Feb 2006 | A1 |
20060276933 | Chavez et al. | Dec 2006 | A1 |
20060287906 | McGillin | Dec 2006 | A1 |
Number | Date | Country |
---|---|---|
0921 488 | Jun 1999 | EP |
61-217880 | Sep 1986 | JP |
WO-96 13790 | May 1996 | WO |
WO-0108393 | Feb 2001 | WO |
Number | Date | Country | |
---|---|---|---|
20070088594 A1 | Apr 2007 | US |