The invention relates generally to contact centers and particularly to servicing incoming contacts in contact centers.
Customer contacts of a business enterprise can take various forms, and be for substantially any reason. Such contacts with the business enterprise may be in the form of face-to-face interactions at a premises for the enterprise, a telephony contact for interaction with enterprise resources (e.g., customer contact personnel, automated processes, or some combination thereof), interactive on-line sessions such as Internet chat sessions via an enterprise website, email, facsimile, etc. Moreover, when a customer contacts such an enterprise, the customer may have only a vague understanding of what the customer desires, and/or the customer may not know what enterprise tasks must be performed to fulfill each of the customer's requests. Accordingly, it frequently occurs that upon determining the requests and the enterprise tasks that must be performed to satisfy the requests of the customer, different enterprise resources are required (or best suited) to process different collections of the tasks. For example, a customer may contact the contact center to do more than one transaction (e.g., open a checking account and apply for a loan), with each transaction being performed by a different resource. In general, such requests and/or tasks are scheduled sequentially; that is, a first request or task is assigned to a first enterprise resource for completion, and once the first request or task is completed, a second request or task is entered into a queue (or other data structure) for assignment to a second enterprise resource or transferred directly to the second resource, and once the second request or task is completed by the second enterprise resource, a third request or task is entered into another queue (or other data structure) for assignment to a third enterprise resource or transferred directly to the third resource, etc. In fact, most contact centers assign tasks to contact center personnel (e.g., agents or other resources) in this fashion.
Such scheduling of customer requests and/or tasks is inefficient and/or problematic for both the customer and the enterprise for a number of reasons.
First, this type of scheduling can lead to work duplication and/or unnecessary use of enterprise resources. For example, a multi-skilled agent may be able to service multiple requests and/or tasks simultaneously. By queuing the requests and/or tasks sequentially, the ability to use such a multi-skilled agent to service multiple requests and/or tasks is frequently unrecognized by the contact center routing algorithm. If the allocation of enterprise resources is performed request-by-request, then neither the customer nor the resource may have sufficient information when performing a first of the enterprise requests and/or tasks to also perform a second of the requests and/or tasks. Thus, to complete the second request and/or task, the customer is likely to have to wait for this second corresponding task to be reassigned to the resource (or its equivalent). For example, requesting to exchange of a product for a different product, and requesting to purchase a service plan on a second product. The exchange likely entails the tasks of: (a) determining the appropriateness of the exchange, (b) arranging for the return of the product the customer currently has, and (c) providing the customer with information about alternative products. It may be that an agent from a first group of agents is able to handle (a) and (b), and an agent from a second group of agents is specifically trained for return product processing. Additionally, it may be that agents skilled in completing a service plan purchase are in a third group which can if necessary also handle customer requests for tasks of types (a) and (b). Accordingly, if tasks are scheduled sequentially in the order listed above, then the customer may likely be transferred to three different agents.
When a customer request(s) requires more than one enterprise resource to fulfill the request(s), then it is typical that a customer is only scheduled for interacting with a second resource once a customer interaction with a first enterprise resource has completed. Thus, even though a contact's associated request(s)/task(s) performed by each of the first and second resources may be independent of one another, the contact is only entered into only one queue (or other data structure) at a time for assignment to enterprise resources. Thus, the customer can experience substantial wait times between resources.
Some contact center product offerings allow a call to queue in multiple splits/skills but once a customer's call has been answered by one skill, the call is removed from all other queues. For example, if a customer needed to have three different requests handled, the customer would generally have to select one and then tell the answering agent about the additional needs. This often results in the customer being transferred to another agent, which is inefficient for the customer and the enterprise. Additionally, some product offerings support a workflow capability, which allows work to proceed through a number of tasks. This capability requires a predefined order for those tasks to occur in.
In general, there is no automated capability for uniformly expediting a customer contact having multiple requests or having one request that requires multiple skills for successful servicing, particularly when the collection of skills cannot be serviced by a single multi-skilled agent.
These and other needs are addressed by the various embodiments and configurations of the present invention. The present invention is directed to concurrent queuing of parts or components of a contact in different queues or in different positions in the same queue.
In a first embodiment of the present invention, a method for servicing work items is provided that includes the steps of:
As used herein, a “request” refers to a contact purpose, contact intent, customer need, customer problem, and/or other basis for customer assistance (e.g., transaction or interaction between the customer and contact center) associated with the contact; “task” refers to an action, occurrence, and/or event which is required for the request to be serviced, precedent to servicing of the request, or is otherwise part of the request servicing activity; and “task set” refers to a grouping of one or more tasks that require or otherwise relate to a common skill and/or queue.
In another embodiment, a database or repository for tracking task set servicing hierarchies is provided that includes sets of data structures, each set of data structures defining a corresponding work item skill queue. Each set of data structures defines a plurality of queue positions in the corresponding skill queue, with each queue position being associated with a different work item. In the data structures, first and second queues include first and second work items in first and second queue positions, respectively. The first and second work items correspond to first and second task sets, respectively, and to a common contact, and first and second subsets of data structures define the first and second work items. Each of the subsets of data structures includes a dependency field defining a servicing hierarchy for the first and second work items. The dependency field of the first work item has a different value than a dependency field of the second work item indicating that the first work item is to be serviced before the second work item.
The first subset of data structures can include a pointer to the second subset of data structures and vice versa, and each of the first and second subsets of data structures can include a pointer to the common contact.
The data structures permit multiple requests or task sets to be queued simultaneously, allowing the customer to retain his or her position in queue for the other requests while one of the requests is being serviced.
The present invention can allow the customer to specify multiple problems that need to be serviced and to notify both the servicing resource that the customer is queued in other queues once the customer has been delivered to the servicing resource and the servicing resource of the customer's position in other queues as that position changes. The invention can identify the servicing resources that can handle multiple requests from the customer and attempt to route to those servicing resources in preference to servicing resources handling fewer of the service requests. It can allow for the maintenance of queue position to a servicing resource once the customer has reached the top or head of the queue, if the customer is already being serviced by another servicing resource, so that the customer will be the next serviced in that queue once the customer has disconnected from the current servicing resource.
The contact center of the present invention can provide enterprises with a way to manage effectively customer requests involving tasks of multiple skills. Notwithstanding the fact that the customer's request(s) involve tasks of various skills, the present architecture allows the tasks in the contact to be identified and routed to a single multi-skilled agent or a number of single-skill agents serially without the contact needing to be requeued after each single-skill agent services his or her tasks in the contact. Rather, the various task sets of the contact are queued simultaneously and remain queued even when one of the task sets is being serviced. This ability can provide enhanced customer satisfaction through better understanding and addressing of customer needs and more efficient and effective contact center operation through identifying a contact's various task sets and assigning a common multi-skilled resource to handle those requests. The ability addresses all of the needs of the customer and allows efficient handling of those needs. The contact center can also direct the order in which the customer accomplishes tasks, according to the needs of the business process. For example, the tasks that need to be completed first before other tasks can be performed can be marked or flagged as having priority over the other tasks in the contact and processed by the contact preferentially.
These and other advantages will be apparent from the disclosure of the invention(s) contained herein.
As used herein, “at least one”, “one or more”, and “and/or” are open-ended expressions that are both conjunctive and disjunctive in operation. For example, each of the expressions “at least one of A, B and C”, “at least one of A, B, or C”, “one or more of A, B, and C”, “one or more of A, B, or C” and “A, B, and/or C” means A alone, B alone, C alone, A and B together, A and C together, B and C together, or A, B and C together.
The above-described embodiments and configurations are neither complete nor exhaustive. As will be appreciated, other embodiments of the invention are possible utilizing, alone or in combination, one or more of the features set forth above or described in detail below.
The invention will be illustrated below in conjunction with an exemplary communication system. Although well suited for use with, e.g., a system having an ACD or other similar contact processing switch, the invention is not limited to use with any particular type of communication system switch or configuration of system elements. Those skilled in the art will recognize that the disclosed techniques may be used in any communication application in which it is desirable to provide improved contact processing.
The present disclosure describes a customer contact system (
Note that in describing the customer contact system, the term “customer” as used herein denotes both established customers as well as potential customers, and the term “customer contact” (or merely, “contact”) includes enterprise contacts by a customer related to a customer request, and/or a customer inquiry. The contact can be by any modality, whether packet-switched or circuit-switched. Moreover, the term “customer request” (or merely “request”) as used herein denotes both requests and inquiries by both previous customers as well as potential new customers.
The resources of the contact center can be human or automated. The enterprise resources may thus be human agents, software “intelligent” agents (e.g., designed to automatically handle specific customer requests), or hybrid combinations of human agents and software agents.
Although the preferred embodiment is discussed with reference to a client-server architecture, it is to be understood that the principles of the present invention apply to other network architectures. For example, the invention applies to peer-to-peer networks, such as those envisioned by the Session Initiation Protocol. In the client-server model or paradigm, network services and the programs used by end users to access the services are described. The client side provides a user with an interface for requesting services from the network, and the server side is responsible for accepting user requests for services and providing the services transparent to the user. By contrast in the peer-to-peer model or paradigm, each networked host runs both the client and server parts of an application program. Additionally, the invention does not require the presence of packet- or circuit-switched networks.
The term “switch” or “server” as used herein should be understood to include a PBX, an ACD, an enterprise switch, or other type of communications system switch or server, as well as other types of processor-based communication control devices such as media servers, computers, adjuncts, etc.
Referring to
The switch 130 and/or server 110 can be any architecture for directing contacts to one or more communication devices. Illustratively, the switch and/or server can be a modified form of the subscriber-premises equipment disclosed in U.S. Pat. Nos. 6,192,122; 6,173,053; 6,163,607; 5,982,873; 5,905,793; 5,828,747; and 5,206,903, all of which are incorporated herein by this reference; Avaya Inc.'s Definity™ Private-Branch Exchange (PBX)-based ACD system; MultiVantage™ PBX, Customer Relationship Management or CRM Central 2000 Server™, Communication Manager™, S8300™ media server, SIP Enabled Services™, and/or Avaya Interaction Center™. Typically, the switch/server is a stored-program-controlled system that conventionally includes interfaces to external communication links, a communications switching fabric, service circuits (e.g., tone generators, announcement circuits, etc.), memory for storing control programs and data, and a processor (i.e., a computer) for executing the stored control programs to control the interfaces and the fabric and to provide automatic contact-distribution functionality. The switch and/or server typically include a network interface card (not shown) to provide services to the serviced communication devices. Other types of known switches and servers are well known in the art and therefore not described in detail herein.
Referring to
Included among the control programs in the server 110 is a contact vector 216. Contacts incoming to the contact center are assigned by contact vector 216 to different contact queues 208a-n based upon a number of predetermined criteria, including customer identity, customer needs, contact center needs, current contact center queue lengths, customer value, and the agent skill that is required for the proper handling of the contact. Call vectoring is described in DEFINITY Communications System Generic 3 Call Vectoring/Expert Agent Selection (EAS) Guide, AT&T publication no. 555-230-520 (Issue 3, November 1993). Skills-based ACD is described in further detail in U.S. Pat. Nos. 6,173,053 and 5,206,903.
Agents who are available for handling contacts are assigned to agent queues 212a-n based upon the skills that they possess. An agent may have multiple skills, and hence may be assigned to multiple agent queues 212a-n simultaneously. Furthermore, an agent may have different levels of skill expertise (e.g., skill levels 1-N in one configuration or merely primary skills and secondary skills in another configuration), and hence may be assigned to different agent queues 212a-n at different expertise levels.
Referring again to
The gateway 158 can be Avaya Inc.'s, G700 Media Gateway™ and may be implemented as hardware such as via an adjunct processor (as shown) or as a chip in the server.
The first communication devices 134-1, . . . 134-N are packet-switched and can include, for example, IP hardphones such as the Avaya Inc.'s, 4600 Series IP Phones™, IP softphones such as Avaya Inc.'s, IP Softphone™, Personal Digital Assistants or PDAs, Personal Computers or PCs, laptops, packet-based H.320 video phones and conferencing units, SIP hardphones, SIP softphones, packet-based voice messaging and response units, packet-based traditional computer telephony adjuncts, peer-to-peer based communication devices, and any other communication device.
The second communication devices 138-1, . . . 138-M are time division multiplexed and/or circuit-switched. Each of the communication devices 138-1, . . . 138-M corresponds to one of a set of internal extensions Ext1, . . . ExtM, respectively. These extensions are referred to herein as “internal” in that they are extensions within the premises that are directly serviced by the switch. More particularly, these extensions correspond to conventional communication device endpoints serviced by the switch/server, and the switch/server can direct incoming calls to and receive outgoing calls from these extensions in a conventional manner. The second communication devices can include, for example, wired and wireless telephones, PDAs, H.320 video phones and conferencing units, voice messaging and response units, traditional computer telephony adjuncts, and any other communication device.
It should be noted that the invention does not require any particular type of information transport medium between switch or server and first and second communication devices, i.e., the invention may be implemented with any desired type of transport medium as well as combinations of different types of transport channels.
The packet-switched network 162 can be any data and/or distributed processing network, such as the Internet. The network 162 typically includes proxies (not shown), registrars (not shown), and routers (not shown) for managing packet flows.
The packet-switched network 162 is in communication with an external first communication device 174 via a gateway 178, and the circuit-switched network 154 with an external second communication device 180. These communication devices are referred to as “external” in that they are not directly supported as communication device endpoints by the switch or server. The communication devices 174 and 180 are an example of devices more generally referred to herein as “external endpoints.”
In a preferred configuration, the server 110, network 162, and first communication devices 134 are Session Initiation Protocol or SIP compatible and can include interfaces for various other protocols such as the Lightweight Directory Access Protocol or LDAP, H.248, H.323, Simple Mail Transfer Protocol or SMTP, IMAP4, ISDN, E1/T1, and analog line or trunk.
It should be emphasized that the configuration of the switch, server, user communication devices, and other elements as shown in
As will be appreciated, the central server 110 is notified via LAN 142 of an incoming contact by the communications component (e.g., switch 130, fax server, email server, web server, and/or other server) receiving the incoming contact. The incoming contact is held by the receiving communications component until the server 110 forwards instructions to the switch 130, which in turn forwards instructions to the component to forward or route the contact to a specific contact center resource, such as the IVR unit 122, the voice mail server 118, and/or first or second communication device 134, 138 associated with a selected agent. The server 110 distributes and connects these contacts to communication devices of available agents based on the predetermined criteria noted above. When the central server 110 forwards a voice contact to an agent, the central server 110 also forwards customer-related information from databases 114 to the agent's computer work station for previewing and/or viewing (such as by a pop-up display) to permit the agent to better serve the customer. The agents process the contacts sent to them by the central server 110 and information respecting agent servicing of the contacts is stored in the database 114.
According to the invention, an agent and contact selector 220 and task expert module 232 are provided. The modules are stored either in the main memory or in a peripheral memory (e.g., disk, CD ROM, etc.) or some other computer-readable medium of the center 100. The agent and contact selector 220 assigns available agents to contacts in the queues 208. The task expert module 232 maps a request of customers to the request's component task(s), determines task performance dependencies between the component tasks, and forms the tasks into task sets, which are then queued in the contact queues 208 depending on the agent skill needed to service the task sets. Normally, each task set will correspond to one skill. Thus, a request or set of requests associated with an incoming contact can have multiple corresponding task sets in multiple differing queues.
Before discussing further the operation of the task expert module, it is important to describe the request/task/task set paradigm in greater detail with reference to
The various tasks often have a performance hierarchy that must be followed for effective completion of the request. With reference to
Additionally, the tasks can be grouped into sets depending on the agent skill required to perform the task(s). The task sets are commonly defined by the skill required to perform the members of the task set. Thus, the members of each task set commonly require a common skill for them to be serviced. With reference to
By dividing requests into tasks and grouping tasks into task sets, the task expert module 232 can provide for more effective scheduling for task servicing. With reference to
The queue position data structures corresponding to each of the task sets reference, or point to, the customer contact with which they are associated, reference, or point to, the other task sets associated with the contact, and include a dependency field indicating the relative order in which the task set is to be performed. For example, the dependency field of the first task set has a value of zero as its performance is independent of the performance of the other task sets, the dependency fields of the second and third task sets each have a value of one meaning that each must be performed after the first task set, while the fourth dependency field of the fourth task set has a value of two meaning that it must be performed after the first, second, and third task sets. As each related task set is completed, it is marked in the data structures of the contact and/or the related, pending task sets as having been completed. At this point, the hierarchical ordering may be adjusted. For example, if a pending task set has a dependency field value of “1” and the precursor task set is completed, the dependency field value of the pending task set may be changed to “0”. Alternatively, the dependency field value may remain unaltered, and the selector 220 will determine the completed status of the precursor task set by examining the data structures associated with the contact and/or completed task set.
The operations of the task expert module 232 and agent and contact selector 220 will now be discussed with reference to
In box 700, a work item, such as a contact, arrives at the contact center for servicing by one or more contact center resources. The work item includes one or more requests from the customer.
In step 704, the needs, or requests, of the customer and any additional request, including corporate and pending requests, are identified. A corporate request refers to a request that is an aggregate of a number of other requests. For example, a corporate request would be a request to finance an investment real estate purchase, which necessarily requires the applicant to apply for and receive a second mortgage on the applicant's home as the required down payment. The various component requests of a corporate request are identified. A pending request refers to another contact of the customer, such as an email, that is queued and waiting service. It is beneficial to the contact center to group all requests of the customer together and service them as part of the same set of transactions.
Step 704 can be performed by any suitable enterprise resource, with an automated response unit, such as the IVR 122, being the most commonly used resource.
In step 708, the task expert module 232 accesses the set of requests identified for the work item, maps each request to its corresponding component tasks using a “best fit” analysis, and groups the tasks into skill-based task sets also based on a “best fit” analysis, and determines and marks the dependencies among the identified task sets. The mapping is typically performed by characterizing each request into one of a predetermined set of request types, e.g., open a savings account, open a checking account, apply for a home loan, apply for a line of credit, and the like. Each predetermined request type has a corresponding grouping of tasks. “Best fit” matching in the mapping of the customer's requests to predetermined requests is typically done based on key word matching. The grouping of tasks into skill-based task sets is based on a “best fit” mapping between the tasks and the skills of the various contact queues. As will be appreciated, tasks corresponding to differing requests in the same work item can be grouped together as part of the same task set. In one configuration, the association of tasks with a corresponding skill is a predetermined mapping that enables, once the customer request is mapped to a corresponding predetermined request type, a rapid and predetermined grouping of tasks from one or more requests into appropriate skill-based task sets.
In decision diamond 712, the task expert module 232 determines whether each of the individual tasks defined by the contact requests can be completed within a predetermined period of time. For example, the task expert module 232 accesses selected information from CMS 228, such as agent staffing levels and/or queue lengths or sizes for each skill associated with the identified tasks for the contact, actual, expected, and/or predicted wait times for the work item queues, and, based on the information, determines whether the various tasks can be completed within the predetermined time period.
When one or more of the individual tasks cannot be completed in a timely manner, the task expert module 232 in decision diamond 716 determines whether or not processing of the contact should continue. This can be determined based on the reason for the untimely completion and/or by notifying the customer of the contact center state (e.g., expected wait time) and/or what requests or component tasks the contact center can and/or cannot complete currently and querying the customer making the contact whether or not he or she is willing to wait the needed time to complete all of the tasks. An example of the former reason is there are currently no agents having the skills available to service one or more of the tasks. The agents could be on break or off duty. An example of the latter is where the contact center has a heavy call volume at the current time and is experiencing long wait times. The contact center may wish to discourage customers from waiting or, due to the high value of the customer, to appease the customer by warning of the long wait times and offering a suitable alternative to current service. A suitable alternative could be, for example, a scheduled call back by the contact center. When the contact is not to be continued in decision diamond 716, the agent and contact selector 220, in step 748, dequeues all remaining task(s), if any, associated with the contact and the contact is disconnected.
When all of the tasks can be completed within the predetermined time period (decision diamond 712) or at least one task cannot be completed in a timely manner, but the contact is to be continued (decision diamond 716), the task expert module 232, in step 720, instructs the vector 216 to queue the various task sets in appropriate queues and mark the dependency relationships in the queued data structures representing the various task sets. In step 724, the agent and contact selector 220 waits for an available resource. The various queued task sets then progress towards the head of their respective queues. In the event that the customer disconnects while awaiting service, the agent and contact selector 220 proceeds to step 748.
When a suitably skilled resource (e.g., agent) becomes available in step 728, all task sets that the available selected resource can service are delivered to the agent. Other task sets that are not being handled by the resource remain queued. The contact is marked as “busy”. Nonetheless, the undelivered task sets associated with the contact continue to progress towards the head of their respective queues.
In step 732, when the resource is finished with the delivered task sets, the task expert module 232 re-evaluates the task set(s) and dependencies based on information received by the resource when servicing of the delivered task set(s) has completed. The contact is again marked as “not busy”. As will be appreciated, the contact center will know when the resource is finished servicing the delivered task set(s) by resource feedback, such as receipt a completed signal from the resource after the resource has completed wrap up, the receipt of a contact processing request from the resource (e.g., a request to again place the contact on hold), and/or by analysis of the data entered by the agent when servicing the task set(s). In any event, the data structures associated with the customer and the contact are updated to reflect the information entered by the resource. This is important as other agents may need to have access to this information when servicing dependent task set(s).
Re-evaluation of the dependencies as parts (task sets) of the contact are serviced can be important to effective and efficient contact center operation. For example, it may be that a task set no longer needs to be serviced because the customer has elected to drop or alter the request associated with that task set or because that customer request was able to be serviced by the resource even though the skill needed to service the request was not a primary skill of the resource. Conversely, the customer, after being serviced by a resource, may have elected to make further requests that cause the generation of additional task set(s). The additional task set(s) may have further dependency relationships with previously queued task set(s) associated with the same contact. These dependency relationships need to be considered. Thus, the queue data structures associated with the existing and new task sets will need to be altered to reflect the existence of the other task sets and the order in which they are to be serviced.
In decision diamond 736, the agent and contact selector 220 determines whether all task sets for the selected customer contact have been completed. When one or more task sets remain to be serviced, the selector 220, in decision diamond 744, determines whether the remaining task set(s) can be serviced within the predetermined time period. If not, the selector offers the customer the options noted above with respect to decision diamond 716 and, in step 748, dequeues the remaining task set(s). If the remaining task set(s) can be serviced within the predetermined time period, the selector returns to and repeats step 724.
When all of the task set(s) for the selected customer contact have been completed, the selector 220, in step 740, causes CMS 228 or other reporting device to generate a customer contact report. This step normally simply means that any unreported data collected by various agents in servicing the contact is reported to the database 114 and appropriate updates made to the data structures associated with the selected contact and the customer associated with that contact.
Finally, after step 752, any remaining task set(s) are dequeued in step 748.
Turning to
In step 800, a resource in a skill queue 212 becomes available to service a new work item.
In step 804, the agent and contact selector 220 analyzes the queued contacts/task set(s) to determine a “best fit” for the resource; that is, which work item is best for the agent and which agent is best for the work item. Additionally, in step 808, based on the results of the analysis in step 804 an appropriate work item or set of work items is selected for delivery to the available resource. What work item is a best fit can be dependent on many factors, including the number and hierarchical ordering of queued task set(s) associated with a contact, the skill level(s) of the available resource, the type of work items waiting to be serviced in each of the queues into which the resource is logged, the identities (e.g., values) of the customers associated with the work items, the potential business revenue associated with each of the work items, each queue's and/or work item's status (or degree of compliance or noncompliance with contact center policies and objectives), target and actual service levels of each queue, actual, expected, and/or predicted wait times associated with various work items and/or queues, and target and actual match rates for each queue. A preferred objective of the contact center is to service as many as possible of the task sets using a single or common resource. A resource capable of servicing only one task set is commonly used only as a last resort. By way of example, if the available agent is a single-skilled agent and the work item at the head of the agent's queue is a task set having related task sets in other queues, the selector 220 may elect to select a work item deeper into the queue because the selector 220 has determined that a multi-skilled agent, capable of servicing not only the work item at the head of the queue but also the related task sets in other queues, will soon be available. Conversely, if the available agent is a multi-skilled agent and the work item at the head of the queue has no related task sets in other queues but a work item deeper in the queue is a task set having related task sets in other queues that the available agent is skilled to handle, the selector 220 may select the work item deeper in the queue and the related task sets for delivery to the agent. By way of illustration and with reference to
In one exemplary configuration, the selector 220 uses expected or predicted wait time to estimate when a multi-skilled agent will be available to service multiple task sets from the same contact versus assigning the various task sets to different single-skilled agents. If the expected or predicted wait time is less than a selected threshold (e.g., a service objective time), the selector 220 awaits the availability of the multi-skilled agent and assigns another work item to the available single-skilled agent. If the expected or predicted wait time is more than the selected threshold, the selected task set is assigned to the single-skilled agent. In one variation, the customer is notified of the options to have a number of the task sets serviced by a multi-skilled agent if the customer waits the expected or predicted wait time or to have a single-skilled agent service one of the task sets immediately. The customer is free to choose one of the two options.
The selector 220 then proceeds to step 728 of
A number of variations and modifications of the invention can be used. It would be possible to provide for some features of the invention without providing others.
For example in one alternative embodiment, the queued data structures are configured to be the contact with a pointer to a corresponding task set to be serviced. In this configuration, a contact would simultaneously be queued in multiple skill queues, with each occurrence of the contact having a pointer to a differing set of tasks.
In other embodiments, the concepts of the present invention apply to face-to-face contacts or interactions in addition to real-time contacts (e.g., instant messaging, live voice calls, Web-based interactions, and the like) and non-real-time contacts (e.g., email), and can include servicing resources other than human agents (e.g., automated response units and Web servers).
In a further embodiment, a work item queue corresponds to multiple skills. In this configuration, multiple task sets associated with a common contact would be queued in different positions in the queue with a skill indicator in the queued data structures. The skill indicator indicates the skill needed to service the corresponding task set. Typically, the task sets are placed in queue positions based upon their associated hierarchies. For example, a task set with a dependency field value of “0” is placed in a position closer to the head of the queue than a task set with a dependency field value of “1” or higher.
In other embodiments, wherein the first and/or second queued task sets are modified based on the result of a completed task set in one or more of the following ways: a dependency of the first and/or second queued task set is changed, a priority of the first and/or second queued task set is changed, a task member of the first and/or second queued task set is eliminated, a task member of the first and/or second queued task set is added, and a queue assignment of the first and/or second task set is changed.
In another embodiment, a servicing human agent can view currently queued task sets corresponding to a contact being serviced by the agent.
In another embodiment, while a human agent is servicing a first task set, the servicing human agent can create a new task member for a second queued task set and/or a new third task set that is immediately queued upon creation.
In yet another embodiment, while a human agent is servicing a first task set but not a second task set, the servicing human agent can modify the data structures representing the second task set prior to the completion of servicing of the first task set.
In yet another embodiment, dedicated hardware implementations including, but not limited to, Application Specific Integrated Circuits or ASICs, programmable logic arrays, and other hardware devices can likewise be constructed to implement the methods described herein. Furthermore, alternative software implementations including, but not limited to, distributed processing or component/object distributed processing, parallel processing, or virtual machine processing can also be constructed to implement the methods described herein.
It should also be stated that the software implementations of the present invention are optionally stored on a tangible storage medium, such as a magnetic medium like a disk or tape, a magneto-optical or optical medium like a disk, or a solid state medium like a memory card or other package that houses one or more read-only (non-volatile) memories. A digital file attachment to e-mail or other self-contained information archive or set of archives is considered a distribution medium equivalent to a tangible storage medium. Accordingly, the invention is considered to include a tangible storage medium or distribution medium and prior art-recognized equivalents and successor media, in which the software implementations of the present invention are stored.
Although the present invention describes components and functions implemented in the embodiments with reference to particular standards and protocols, the invention is not limited to such standards and protocols. Other similar standards and protocols not mentioned herein are in existence and are considered to be included in the present invention. Moreover, the standards and protocols mentioned herein and other similar standards and protocols not mentioned herein are periodically superseded by faster or more effective equivalents having essentially the same functions. Such replacement standards and protocols having the same functions are considered equivalents included in the present invention.
The present invention, in various embodiments, includes components, methods, processes, systems and/or apparatus substantially as depicted and described herein, including various embodiments, subcombinations, and subsets thereof. Those of skill in the art will understand how to make and use the present invention after understanding the present disclosure. The present invention, in various embodiments, includes providing devices and processes in the absence of items not depicted and/or described herein or in various embodiments hereof, including in the absence of such items as may have been used in previous devices or processes, e.g., for improving performance, achieving ease and\or reducing cost of implementation.
The foregoing discussion of the invention has been presented for purposes of illustration and description. The foregoing is not intended to limit the invention to the form or forms disclosed herein. In the foregoing Detailed Description for example, various features of the invention are grouped together in one or more embodiments for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the following claims are hereby incorporated into this Detailed Description, with each claim standing on its own as a separate preferred embodiment of the invention.
Moreover, though the description of the invention has included description of one or more embodiments and certain variations and modifications, other variations and modifications are within the scope of the invention, e.g., as may be within the skill and knowledge of those in the art, after understanding the present disclosure. It is intended to obtain rights which include alternative embodiments to the extent permitted, including alternate, interchangeable and/or equivalent structures, functions, ranges or steps to those claimed, whether or not such alternate, interchangeable and/or equivalent structures, functions, ranges or steps are disclosed herein, and without intending to publicly dedicate any patentable subject matter.
Number | Name | Date | Kind |
---|---|---|---|
4163124 | Jolissaint | Jul 1979 | A |
4510351 | Costello et al. | Apr 1985 | A |
4567323 | Lottes et al. | Jan 1986 | A |
4737983 | Frauenthal et al. | Apr 1988 | A |
4797911 | Szlam et al. | Jan 1989 | A |
4894857 | Szlam et al. | Jan 1990 | A |
5001710 | Gawrys et al. | Mar 1991 | A |
5097528 | Gursahaney et al. | Mar 1992 | A |
5101425 | Darland | Mar 1992 | A |
5155761 | Hammond | Oct 1992 | A |
5164981 | Mitchell et al. | Nov 1992 | A |
5164983 | Brown et al. | Nov 1992 | A |
5167010 | Elm et al. | Nov 1992 | A |
5185780 | Leggett | Feb 1993 | A |
5206903 | Kohler et al. | Apr 1993 | A |
5210789 | Jeffus et al. | May 1993 | A |
5274700 | Gechter et al. | Dec 1993 | A |
5278898 | Cambray et al. | Jan 1994 | A |
5289368 | Jordan et al. | Feb 1994 | A |
5291550 | Levy et al. | Mar 1994 | A |
5299260 | Shaio | Mar 1994 | A |
5309513 | Rose | May 1994 | A |
5311422 | Loftin et al. | May 1994 | A |
5325292 | Crockett | Jun 1994 | A |
5335268 | Kelly, Jr. et al. | Aug 1994 | A |
5335269 | Steinlicht | Aug 1994 | A |
5390243 | Casselman et al. | Feb 1995 | A |
5436965 | Grossman et al. | Jul 1995 | A |
5444774 | Friedes | Aug 1995 | A |
5467391 | Donaghue, Jr. et al. | Nov 1995 | A |
5469503 | Butensky et al. | Nov 1995 | A |
5469504 | Blaha | Nov 1995 | A |
5473773 | Aman et al. | Dec 1995 | A |
5479497 | Kovarik | Dec 1995 | A |
5499291 | Kepley | Mar 1996 | A |
5500795 | Powers et al. | Mar 1996 | A |
5504894 | Ferguson et al. | Apr 1996 | A |
5506898 | Costantini et al. | Apr 1996 | A |
5530744 | Charalambous et al. | Jun 1996 | A |
5537470 | Lee | Jul 1996 | A |
5537542 | Eilert et al. | Jul 1996 | A |
5544232 | Baker et al. | Aug 1996 | A |
5546452 | Andrews et al. | Aug 1996 | A |
5555299 | Maloney et al. | Sep 1996 | A |
5577169 | Prezioso | Nov 1996 | A |
5592378 | Cameron et al. | Jan 1997 | A |
5592542 | Honda et al. | Jan 1997 | A |
5594726 | Thompson et al. | Jan 1997 | A |
5603029 | Aman et al. | Feb 1997 | A |
5604892 | Nuttall et al. | Feb 1997 | A |
5606361 | Davidsohn et al. | Feb 1997 | A |
5611076 | Durflinger et al. | Mar 1997 | A |
5627884 | Williams et al. | May 1997 | A |
5642515 | Jones et al. | Jun 1997 | A |
5684872 | Flockhart et al. | Nov 1997 | A |
5684964 | Powers et al. | Nov 1997 | A |
5689698 | Jones et al. | Nov 1997 | A |
5703943 | Otto | Dec 1997 | A |
5713014 | Durflinger et al. | Jan 1998 | A |
5721770 | Kohler | Feb 1998 | A |
5724092 | Davidsohn et al. | Mar 1998 | A |
5740238 | Flockhart et al. | Apr 1998 | A |
5742675 | Kilander et al. | Apr 1998 | A |
5742763 | Jones | Apr 1998 | A |
5748468 | Notenboom et al. | May 1998 | A |
5749079 | Yong et al. | May 1998 | A |
5751707 | Voit et al. | May 1998 | A |
5752027 | Familiar | May 1998 | A |
5754639 | Flockhart et al. | May 1998 | A |
5754776 | Hales et al. | May 1998 | A |
5754841 | Carino, Jr. | May 1998 | A |
5757904 | Anderson | May 1998 | A |
5784452 | Carney | Jul 1998 | A |
5787410 | McMahon | Jul 1998 | A |
5790642 | Taylor et al. | Aug 1998 | A |
5790650 | Dunn et al. | Aug 1998 | A |
5790677 | Fox et al. | Aug 1998 | A |
5794250 | Carino, Jr. et al. | Aug 1998 | A |
5796393 | MacNaughton et al. | Aug 1998 | A |
5802282 | Hales et al. | Sep 1998 | A |
5802510 | Jones | Sep 1998 | A |
5818907 | Maloney et al. | Oct 1998 | A |
5819084 | Shapiro et al. | Oct 1998 | A |
5825869 | Brooks et al. | Oct 1998 | A |
5826039 | Jones | Oct 1998 | A |
5828747 | Fisher et al. | Oct 1998 | A |
5836011 | Hambrick et al. | Nov 1998 | A |
5838968 | Culbert | Nov 1998 | A |
5839117 | Cameron et al. | Nov 1998 | A |
5864874 | Shapiro | Jan 1999 | A |
5875437 | Atkins | Feb 1999 | A |
5880720 | Iwafune et al. | Mar 1999 | A |
5881238 | Aman et al. | Mar 1999 | A |
5884032 | Bateman et al. | Mar 1999 | A |
5889956 | Hauser et al. | Mar 1999 | A |
5897622 | Blinn et al. | Apr 1999 | A |
5903641 | Tonisson | May 1999 | A |
5903877 | Berkowitz et al. | May 1999 | A |
5905793 | Flockhart et al. | May 1999 | A |
5909669 | Havens | Jun 1999 | A |
5911134 | Castonguay et al. | Jun 1999 | A |
5914951 | Bentley et al. | Jun 1999 | A |
5915012 | Miloslavsky | Jun 1999 | A |
5923745 | Hurd | Jul 1999 | A |
5926538 | Deryugin et al. | Jul 1999 | A |
5930786 | Carino, Jr. et al. | Jul 1999 | A |
5937051 | Hurd et al. | Aug 1999 | A |
5937402 | Pandilt | Aug 1999 | A |
5940496 | Gisby et al. | Aug 1999 | A |
5943416 | Gisby | Aug 1999 | A |
5948065 | Eilert et al. | Sep 1999 | A |
5960073 | Kikinis et al. | Sep 1999 | A |
5963635 | Szlam et al. | Oct 1999 | A |
5963911 | Walker et al. | Oct 1999 | A |
5970132 | Brady | Oct 1999 | A |
5974135 | Breneman et al. | Oct 1999 | A |
5974462 | Aman et al. | Oct 1999 | A |
5982873 | Flockhart et al. | Nov 1999 | A |
5987117 | McNeil et al. | Nov 1999 | A |
5991392 | Miloslavsky | Nov 1999 | A |
5996013 | Delp et al. | Nov 1999 | A |
5999963 | Bruno et al. | Dec 1999 | A |
6000832 | Franklin et al. | Dec 1999 | A |
6011844 | Uppaluru et al. | Jan 2000 | A |
6014437 | Acker et al. | Jan 2000 | A |
6031896 | Gardell et al. | Feb 2000 | A |
6038293 | McNerney et al. | Mar 2000 | A |
6038296 | Brunson et al. | Mar 2000 | A |
6044144 | Becker et al. | Mar 2000 | A |
6044205 | Reed et al. | Mar 2000 | A |
6044355 | Crockett et al. | Mar 2000 | A |
6049547 | Fisher et al. | Apr 2000 | A |
6049779 | Berkson | Apr 2000 | A |
6052723 | Ginn | Apr 2000 | A |
6055308 | Miloslavsky et al. | Apr 2000 | A |
6064730 | Ginsberg | May 2000 | A |
6064731 | Flockhart et al. | May 2000 | A |
6084954 | Harless et al. | Jul 2000 | A |
6088441 | Flockhart et al. | Jul 2000 | A |
6108670 | Weida et al. | Aug 2000 | A |
6115462 | Servi et al. | Sep 2000 | A |
6128304 | Gardell et al. | Oct 2000 | A |
6151571 | Pertrushin | Nov 2000 | A |
6154769 | Cherkasova et al. | Nov 2000 | A |
6163607 | Bogart et al. | Dec 2000 | A |
6173053 | Bogart et al. | Jan 2001 | B1 |
6175564 | Miloslavsky et al. | Jan 2001 | B1 |
6178441 | Elnozahy | Jan 2001 | B1 |
6185292 | Miloslavsky | Feb 2001 | B1 |
6185603 | Henderson et al. | Feb 2001 | B1 |
6192122 | Flockhart et al. | Feb 2001 | B1 |
6215865 | McCalmont | Apr 2001 | B1 |
6226377 | Donaghue, Jr. | May 2001 | B1 |
6229819 | Darland et al. | May 2001 | B1 |
6230183 | Yocom et al. | May 2001 | B1 |
6233333 | Dezonmo | May 2001 | B1 |
6240417 | Eastwick et al. | May 2001 | B1 |
6259969 | Tackett et al. | Jul 2001 | B1 |
6263359 | Fong et al. | Jul 2001 | B1 |
6272544 | Mullen | Aug 2001 | B1 |
6275806 | Pertrushin | Aug 2001 | B1 |
6275812 | Haq et al. | Aug 2001 | B1 |
6275991 | Erlin | Aug 2001 | B1 |
6278777 | Morley et al. | Aug 2001 | B1 |
6292550 | Burritt | Sep 2001 | B1 |
6295353 | Flockhart et al. | Sep 2001 | B1 |
6298062 | Gardell et al. | Oct 2001 | B1 |
6307931 | Vaudreuil | Oct 2001 | B1 |
6324282 | McIllwaine et al. | Nov 2001 | B1 |
6332081 | Do | Dec 2001 | B1 |
6339754 | Flanagan et al. | Jan 2002 | B1 |
6353810 | Petrushin | Mar 2002 | B1 |
6356632 | Foster et al. | Mar 2002 | B1 |
6360222 | Quinn | Mar 2002 | B1 |
6366666 | Bengtson et al. | Apr 2002 | B2 |
6366668 | Borst et al. | Apr 2002 | B1 |
6389028 | Bondarenko et al. | May 2002 | B1 |
6389132 | Price et al. | May 2002 | B1 |
6389400 | Bushey et al. | May 2002 | B1 |
6408066 | Andruska et al. | Jun 2002 | B1 |
6408277 | Nelken | Jun 2002 | B1 |
6411682 | Fuller et al. | Jun 2002 | B1 |
6424709 | Doyle et al. | Jul 2002 | B1 |
6426950 | Mistry | Jul 2002 | B1 |
6427137 | Pertrushin | Jul 2002 | B2 |
6430282 | Bannister et al. | Aug 2002 | B1 |
6434230 | Gabriel | Aug 2002 | B1 |
6446092 | Sutter | Sep 2002 | B1 |
6449356 | Dezonno | Sep 2002 | B1 |
6449358 | Anisimov et al. | Sep 2002 | B1 |
6449646 | Sikora et al. | Sep 2002 | B1 |
6453038 | McFarlane et al. | Sep 2002 | B1 |
6463148 | Brady | Oct 2002 | B1 |
6463346 | Flockhart et al. | Oct 2002 | B1 |
6463415 | St. John | Oct 2002 | B2 |
6463471 | Dreke et al. | Oct 2002 | B1 |
6480826 | Pertrushin | Nov 2002 | B2 |
6490350 | McDuff et al. | Dec 2002 | B2 |
6535600 | Fisher et al. | Mar 2003 | B1 |
6535601 | Flockhart et al. | Mar 2003 | B1 |
6553114 | Fisher et al. | Apr 2003 | B1 |
6556974 | D'Alessandro | Apr 2003 | B1 |
6560330 | Gabriel | May 2003 | B2 |
6560649 | Mullen et al. | May 2003 | B1 |
6560707 | Curtis et al. | May 2003 | B2 |
6563920 | Flockhart et al. | May 2003 | B1 |
6563921 | Williams et al. | May 2003 | B1 |
6571285 | Groath et al. | May 2003 | B1 |
6574599 | Lim et al. | Jun 2003 | B1 |
6574605 | Sanders et al. | Jun 2003 | B1 |
6597685 | Miloslavsky et al. | Jul 2003 | B2 |
6603854 | Judkins et al. | Aug 2003 | B1 |
6604084 | Powers et al. | Aug 2003 | B1 |
6614903 | Flockhart et al. | Sep 2003 | B1 |
6650748 | Edwards et al. | Nov 2003 | B1 |
6668167 | McDowell et al. | Dec 2003 | B2 |
6675168 | Shapiro et al. | Jan 2004 | B2 |
6684192 | Honarvar et al. | Jan 2004 | B2 |
6697457 | Petrushin | Feb 2004 | B2 |
6700967 | Kleinoder et al. | Mar 2004 | B2 |
6704409 | Dilip et al. | Mar 2004 | B1 |
6707903 | Burok et al. | Mar 2004 | B2 |
6711253 | Prabhaker | Mar 2004 | B1 |
6724885 | Deutsch et al. | Apr 2004 | B1 |
6735299 | Krimstock et al. | May 2004 | B2 |
6735593 | Williams | May 2004 | B1 |
6738462 | Brunson | May 2004 | B1 |
6744877 | Edwards | Jun 2004 | B1 |
6754333 | Flockhart et al. | Jun 2004 | B1 |
6757362 | Cooper et al. | Jun 2004 | B1 |
6766013 | Flockhart et al. | Jul 2004 | B2 |
6766014 | Flockhart et al. | Jul 2004 | B2 |
6766326 | Cena | Jul 2004 | B1 |
6775377 | McIllwaine et al. | Aug 2004 | B2 |
6785666 | Nareddy et al. | Aug 2004 | B1 |
6822945 | Petrovykh | Nov 2004 | B2 |
6829348 | Schroeder et al. | Dec 2004 | B1 |
6839735 | Wong et al. | Jan 2005 | B2 |
6842503 | Wildfeuer | Jan 2005 | B1 |
6847973 | Griffin et al. | Jan 2005 | B2 |
6898190 | Shtivelman et al. | May 2005 | B2 |
6915305 | Subramanian et al. | Jul 2005 | B2 |
6947543 | Alvarado et al. | Sep 2005 | B2 |
6947988 | Saleh | Sep 2005 | B1 |
6963826 | Hanaman et al. | Nov 2005 | B2 |
6968052 | Wullert, II | Nov 2005 | B2 |
6981061 | Sakakura | Dec 2005 | B1 |
6985901 | Sachse et al. | Jan 2006 | B1 |
6988126 | Wilcock et al. | Jan 2006 | B2 |
7010542 | Trappen et al. | Mar 2006 | B2 |
7020254 | Phillips | Mar 2006 | B2 |
7035808 | Ford | Apr 2006 | B1 |
7035927 | Flockhart et al. | Apr 2006 | B2 |
7039176 | Borodow et al. | May 2006 | B2 |
7054434 | Rodenbusch et al. | May 2006 | B2 |
7062031 | Becerra et al. | Jun 2006 | B2 |
7076051 | Brown et al. | Jul 2006 | B2 |
7100200 | Pope et al. | Aug 2006 | B2 |
7103562 | Kosiba et al. | Sep 2006 | B2 |
7110525 | Heller et al. | Sep 2006 | B1 |
7117193 | Basko et al. | Oct 2006 | B1 |
7127058 | O'Connor et al. | Oct 2006 | B2 |
7136873 | Smith et al. | Nov 2006 | B2 |
7149733 | Lin et al. | Dec 2006 | B2 |
7155612 | Licis | Dec 2006 | B2 |
7158628 | McConnell et al. | Jan 2007 | B2 |
7162469 | Anonsen et al. | Jan 2007 | B2 |
7165075 | Harter et al. | Jan 2007 | B2 |
7170976 | Keagy | Jan 2007 | B1 |
7170992 | Knott et al. | Jan 2007 | B2 |
7177401 | Mundra et al. | Feb 2007 | B2 |
7200219 | Edwards et al. | Apr 2007 | B1 |
7203655 | Herbert et al. | Apr 2007 | B2 |
7212625 | McKenna et al. | May 2007 | B1 |
7215744 | Scherer | May 2007 | B2 |
7222075 | Petrushin | May 2007 | B2 |
7246371 | Diacakis et al. | Jul 2007 | B2 |
7257513 | Lilly | Aug 2007 | B2 |
7257597 | Pryce et al. | Aug 2007 | B1 |
7266508 | Owen et al. | Sep 2007 | B1 |
7283805 | Agrawal | Oct 2007 | B2 |
7295669 | Denton et al. | Nov 2007 | B1 |
7299259 | Petrovykh | Nov 2007 | B2 |
7324954 | Calderaro et al. | Jan 2008 | B2 |
7336779 | Boyer et al. | Feb 2008 | B2 |
7340408 | Drew et al. | Mar 2008 | B1 |
7373341 | Polo-Malouvier | May 2008 | B2 |
7376127 | Hepworth et al. | May 2008 | B2 |
7392402 | Suzuki | Jun 2008 | B2 |
7409423 | Horvitz et al. | Aug 2008 | B2 |
7415417 | Boyer et al. | Aug 2008 | B2 |
7418093 | Knott et al. | Aug 2008 | B2 |
7499844 | Whitman, Jr. | Mar 2009 | B2 |
7500241 | Flockhart et al. | Mar 2009 | B1 |
7526440 | Walker et al. | Apr 2009 | B2 |
7545925 | Williams | Jun 2009 | B2 |
7567653 | Michaelis | Jul 2009 | B1 |
7734032 | Kiefhaber et al. | Jun 2010 | B1 |
20010011228 | Shenkman | Aug 2001 | A1 |
20010034628 | Eder | Oct 2001 | A1 |
20020019829 | Shapiro | Feb 2002 | A1 |
20020021307 | Glenn et al. | Feb 2002 | A1 |
20020035605 | McDowell et al. | Mar 2002 | A1 |
20020038422 | Suwamoto et al. | Mar 2002 | A1 |
20020065894 | Dalal et al. | May 2002 | A1 |
20020076010 | Sahai | Jun 2002 | A1 |
20020085701 | Parsons et al. | Jul 2002 | A1 |
20020087630 | Wu | Jul 2002 | A1 |
20020112186 | Ford et al. | Aug 2002 | A1 |
20020116336 | Diacakis et al. | Aug 2002 | A1 |
20020116461 | Diacakis et al. | Aug 2002 | A1 |
20020123923 | Manganaris et al. | Sep 2002 | A1 |
20020147730 | Kohno | Oct 2002 | A1 |
20030028621 | Furlong et al. | Feb 2003 | A1 |
20030073440 | Mukherjee et al. | Apr 2003 | A1 |
20030093465 | Flockhart et al. | May 2003 | A1 |
20030108186 | Brown et al. | Jun 2003 | A1 |
20030144900 | Whitmer | Jul 2003 | A1 |
20030144959 | Makita | Jul 2003 | A1 |
20030231757 | Harkreader et al. | Dec 2003 | A1 |
20040008828 | Coles et al. | Jan 2004 | A1 |
20040015496 | Anonsen | Jan 2004 | A1 |
20040015506 | Anonsen et al. | Jan 2004 | A1 |
20040054743 | McPartlan et al. | Mar 2004 | A1 |
20040057569 | Busey et al. | Mar 2004 | A1 |
20040102940 | Lendermann et al. | May 2004 | A1 |
20040103324 | Band | May 2004 | A1 |
20040138944 | Whitacre et al. | Jul 2004 | A1 |
20040162998 | Tuomi et al. | Aug 2004 | A1 |
20040202309 | Baggenstoss et al. | Oct 2004 | A1 |
20040203878 | Thomson | Oct 2004 | A1 |
20040210475 | Starnes et al. | Oct 2004 | A1 |
20040240659 | Gagle et al. | Dec 2004 | A1 |
20040249650 | Freedman et al. | Dec 2004 | A1 |
20040260706 | Anonsen et al. | Dec 2004 | A1 |
20050021529 | Hodson et al. | Jan 2005 | A1 |
20050044375 | Paatero et al. | Feb 2005 | A1 |
20050049911 | Engelking et al. | Mar 2005 | A1 |
20050071211 | Flockhart et al. | Mar 2005 | A1 |
20050071212 | Flockhart et al. | Mar 2005 | A1 |
20050071241 | Flockhart et al. | Mar 2005 | A1 |
20050071844 | Flockhart et al. | Mar 2005 | A1 |
20050091071 | Lee | Apr 2005 | A1 |
20050125432 | Lin et al. | Jun 2005 | A1 |
20050125458 | Sutherland et al. | Jun 2005 | A1 |
20050138064 | Trappen et al. | Jun 2005 | A1 |
20050154708 | Sun | Jul 2005 | A1 |
20050182784 | Trappen et al. | Aug 2005 | A1 |
20050283393 | White et al. | Dec 2005 | A1 |
20050289446 | Moncsko et al. | Dec 2005 | A1 |
20060004686 | Molnar et al. | Jan 2006 | A1 |
20060007916 | Jones et al. | Jan 2006 | A1 |
20060015388 | Flockhart et al. | Jan 2006 | A1 |
20060026049 | Joseph et al. | Feb 2006 | A1 |
20060056598 | Brandt et al. | Mar 2006 | A1 |
20060100973 | McMaster et al. | May 2006 | A1 |
20060135058 | Karabinis | Jun 2006 | A1 |
20060178994 | Stolfo et al. | Aug 2006 | A1 |
20060242160 | Kanchwalla et al. | Oct 2006 | A1 |
20060256957 | Fain et al. | Nov 2006 | A1 |
20060271418 | Hackbarth et al. | Nov 2006 | A1 |
20070038632 | Engstrom | Feb 2007 | A1 |
20070064912 | Kagan et al. | Mar 2007 | A1 |
20070083572 | Bland et al. | Apr 2007 | A1 |
20070112953 | Barnett | May 2007 | A1 |
20070127643 | Keagy | Jun 2007 | A1 |
20070192414 | Chen et al. | Aug 2007 | A1 |
20070201311 | Olson | Aug 2007 | A1 |
20070201674 | Annadata et al. | Aug 2007 | A1 |
20070230681 | Boyer et al. | Oct 2007 | A1 |
20080056165 | Petrovykh | Mar 2008 | A1 |
20090193050 | Olson | Jul 2009 | A1 |
Number | Date | Country |
---|---|---|
2143198 | Jan 1995 | CA |
2174762 | Jun 1995 | CA |
0501189 | Sep 1992 | EP |
0740450 | Oct 1996 | EP |
0770967 | May 1997 | EP |
0772335 | May 1997 | EP |
0829996 | Mar 1998 | EP |
0855826 | Jul 1998 | EP |
0863651 | Sep 1998 | EP |
0866407 | Sep 1998 | EP |
0899673 | Mar 1999 | EP |
0998108 | May 2000 | EP |
1035718 | Sep 2000 | EP |
1091307 | Apr 2001 | EP |
1150236 | Oct 2001 | EP |
2273418 | Jun 1994 | GB |
2290192 | Dec 1995 | GB |
2001-053843 | Feb 2001 | JP |
2002-304313 | Oct 2002 | JP |
2006-054864 | Feb 2006 | JP |
WO 9607141 | Mar 1996 | WO |
WO 9728635 | Aug 1997 | WO |
WO 9856207 | Dec 1998 | WO |
WO 9917522 | Apr 1999 | WO |
WO 0026804 | May 2000 | WO |
WO 0026816 | May 2000 | WO |
WO 0180094 | Oct 2001 | WO |
WO 02099640 | Dec 2002 | WO |
03015425 | Feb 2003 | WO |