Service scheduling
First Claim
Patent Images
1. A method for scheduling one or more services, comprising the steps of:
- obtaining dynamically changing customer information for two or more customers, wherein the dynamically changing customer information comprises dynamic customer arrival and customer priority, and wherein obtaining customer information is carried out by a token generator module executing on a hardware processor;
obtaining one or more dynamically changing service characteristics for each of the one or more services, wherein the one or more dynamically changing service characteristics comprise dynamic availability of resources and priority of each service, and wherein obtaining one or more service characteristics for each of the one or more services is carried out by a token generator module executing on a hardware processor; and
using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics, wherein using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics comprises generating a ranked list specifying an order in which the one or more services with respect to the two or more customers should be processed, wherein the ranked list is based on simultaneous comparison of a per customer dynamic value for each of the two or more customers calculated as equal to
1 Assignment
0 Petitions
Accused Products
Abstract
Techniques for scheduling one or more services are provided. The techniques include obtaining customer information, obtaining one or more service characteristics for each of the one or more services, and using the customer information and the one or more service characteristics to schedule the one or more services.
-
Citations
20 Claims
-
1. A method for scheduling one or more services, comprising the steps of:
-
obtaining dynamically changing customer information for two or more customers, wherein the dynamically changing customer information comprises dynamic customer arrival and customer priority, and wherein obtaining customer information is carried out by a token generator module executing on a hardware processor; obtaining one or more dynamically changing service characteristics for each of the one or more services, wherein the one or more dynamically changing service characteristics comprise dynamic availability of resources and priority of each service, and wherein obtaining one or more service characteristics for each of the one or more services is carried out by a token generator module executing on a hardware processor; and using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics, wherein using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics comprises generating a ranked list specifying an order in which the one or more services with respect to the two or more customers should be processed, wherein the ranked list is based on simultaneous comparison of a per customer dynamic value for each of the two or more customers calculated as equal to - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer program product comprising a non-transitory tangible computer readable recordable storage medium having computer readable program code for scheduling one or more services, said computer program product including:
-
computer readable program code for obtaining dynamically changing customer information for two or more customers, wherein the dynamically changing customer information comprises dynamic customer arrival and customer priority; computer readable program code for obtaining one or more dynamically changing service characteristics for each of the one or more services, wherein the one or more dynamically changing service characteristics comprise dynamic availability of resources and priority of each service; and computer readable program code for using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics, wherein using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics comprises generating a ranked list specifying an order in which the one or more services with respect to the two or more customers should be processed, wherein the ranked list is based on simultaneous comparison of a per customer dynamic value for each of the two or more customers calculated as equal to - View Dependent Claims (11, 12, 13, 14)
-
-
15. A system for scheduling one or more services, comprising:
-
a memory; and at least one processor coupled to said memory and operative to; obtain dynamically changing customer information for two or more customers, wherein the dynamically changing customer information comprises dynamic customer arrival and customer priority; obtain one or more dynamically changing service characteristics for each of the one or more services, wherein the one or more dynamically changing service characteristics comprise dynamic availability of resources and priority of each service; and use the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics, wherein using the customer information and the one or more service characteristics to schedule the one or more services to optimize one or more metrics comprises generating a ranked list specifying an order in which the one or more services with respect to the two or more customers should be processed, wherein the ranked list is based on simultaneous comparison of a per customer dynamic value for each of the two or more customers calculated as equal to - View Dependent Claims (16, 17, 18, 19)
-
-
20. A method for real-time transaction scheduling, comprising the steps of:
-
obtaining dynamically changing customer information for two or more customers, wherein the dynamically changing customer information comprises dynamic customer arrival and customer priority, and wherein obtaining customer information is carried out by a token generator module executing on a hardware processor; obtaining one or more dynamically changing service characteristics for each of one or more services, wherein the one or more dynamically changing service characteristics comprise dynamic availability of resources and priority of each service, and wherein obtaining one or more service characteristics for each of the one or more services is carried out by a token generator module executing on a hardware processor; scheduling one or more transactions in real-time based on the customer information and the one or more service characteristics according to a pre-specified criteria, wherein scheduling an iteration of transactions is carried out by a job scheduling algorithm module executing on a hardware processor; and repeating one or more iterations of scheduling transactions in real-time at a pre-defined interval or until all customers are served, whichever is earlier, wherein repeating one or more iterations of scheduling transactions in real-time further comprises continuously updating customer priority via calculating
-
Specification