SYSTEMS AND METHOD FOR DYNAMIC SCHEDULING OF SERVICE APPOINTMENTS

    公开(公告)号:US20190102746A1

    公开(公告)日:2019-04-04

    申请号:US15722976

    申请日:2017-10-02

    Abstract: A system includes a non-transitory memory and one or more hardware processors configured to read instructions from the non-transitory memory. The one or more hardware processors are configured to perform operations including receiving a service appointment request, identifying the one or more skills associated with the service appointment request, referencing service agent profile data stored on a first database, wherein the service agent profile data includes one or more skills possessed by each of a plurality of service agents, referencing service agent schedule data stored on a second database, dynamically populating a calendar of available appointment times, including identifying one or more time slots, occurring during a period of time, during which at least one service agent of the plurality of service agents possesses the identified skills is available, receiving an input selecting a first time slot of the one or more time slots, and updating a schedule of a first service agent of the plurality of service agents to reflect that the first service agent has a service appointment scheduled during the first time slot.

    SYSTEMS AND METHOD FOR PROCESSING RESOURCE ACCESS REQUESTS

    公开(公告)号:US20220012671A1

    公开(公告)日:2022-01-13

    申请号:US17303533

    申请日:2021-06-01

    Abstract: A system performs operations including receiving a service appointment request, identifying the one or more skills associated with the service appointment request, referencing service agent profile data stored on a first database, wherein the service agent profile data includes one or more skills possessed by each of a plurality of service agents, referencing service agent schedule data stored on a second database, dynamically populating a calendar of available appointment times, including identifying one or more time slots during which at least one service agent of the plurality of service agents possesses the identified skills is available, receiving an input selecting a first time slot of the one or more time slots, and updating a schedule of a first service agent of the plurality of service agents to reflect that the first service agent has a service appointment scheduled during the first time slot.

    Systems and methods for comprehensive routing

    公开(公告)号:US11137258B2

    公开(公告)日:2021-10-05

    申请号:US16241723

    申请日:2019-01-07

    Abstract: In accordance with the present approach, a routing algorithm may be implemented to enable an agent to receive an acceptable route between a number of assigned tasks on demand. Particularly, the algorithm may determine the acceptable route by determining a travel cost for each route between an end location and one of the assigned tasks. Then, the algorithm may add in another assigned task and determine a travel cost for each route from the end location, to a first assigned task, and then to a second assigned task. Continuing in this manner, the algorithm constructs routes from the end location and through each possible subset of the assigned tasks, while tracking a permutation of each subset having the lowest travel cost. The algorithm may therefore trace back through the lowest-cost permutations to construct a complete route that has the lowest cost.

    SYSTEMS AND METHODS FOR COMPREHENSIVE ROUTING

    公开(公告)号:US20200217672A1

    公开(公告)日:2020-07-09

    申请号:US16241723

    申请日:2019-01-07

    Abstract: In accordance with the present approach, a routing algorithm may be implemented to enable an agent to receive an acceptable route between a number of assigned tasks on demand. Particularly, the algorithm may determine the acceptable route by determining a travel cost for each route between an end location and one of the assigned tasks. Then, the algorithm may add in another assigned task and determine a travel cost for each route from the end location, to a first assigned task, and then to a second assigned task. Continuing in this manner, the algorithm constructs routes from the end location and through each possible subset of the assigned tasks, while tracking a permutation of each subset having the lowest travel cost. The algorithm may therefore trace back through the lowest-cost permutations to construct a complete route that has the lowest cost.

Patent Agency Ranking