Method and system for scheduling activities

• US 8,781,873 B2
• Filed: 03/28/2002
• Issued: 07/15/2014
• Est. Priority Date: 04/02/2001
• Status: Active Grant

• Current Assignee: Siebel Systems Inc. (Oracle Corporation)
• Original Assignee: Siebel Systems Inc. (Oracle Corporation)
• Inventors: Purohit, Atul, Bansal, Harish, Wang, Jun, Krishnan, Praveen, Nash, Christopher Scott
• Primary Examiner(s): Sterrett, Jonathan G
• Assistant Examiner(s): Anderson, Folashade
• Application Number:
  US10/112,913
• Publication Number:
  US 20070208604A1
• Time in Patent Office: 4,492 Days
• Field of Search: 705/9, 705/7.18
• US Class Current: 705/7.18
• CPC Class Codes: G06Q 10/06375 Prediction of business process outcome or impact based on a proposed change
• CPC Class Codes: G06Q 10/109 Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G06Q 10/1095 Meeting or appointment

Abstract

Techniques to schedule activities. In one method, a request to book an appointment for an activity in a particular schedule is initially received. In response, time slots available in the schedule for booking the activity are determined, and a set (all or a subset) of the time slots is provided as possible appointment choices. The time slots in the set are temporarily locked. A next set of time slots or more time slots may be requested (if the time slots provided are not acceptable or desirable), in which case additional time slots may be provided. Thereafter, a selection for one of the time slots is received. In response, the activity is booked in the selected time slot and previously locked time slots are released. The locked time slots may also be released if no selection is received after a particular amount of time.

Claims

1. A computer-implemented method for scheduling activities, comprising:

receiving a request, from a user device, to book an appointment for an activity in a schedule,

performing a check of a service region associated with the request;

performing a check on a no-later-than time included in the request;

performing a check on a no-sooner-than time included in the request;

subsequent to the performing the check of the service region, the performing the check on the no-later-than time, and the performing the check on the no-sooner-than time, providing, to the user device, a plurality of time slots as possible appointment choices for the appointment, wherein

time slots in the plurality of time slots provided as the possible appointment choices are available in the schedule for booking the activity;

locking the plurality of time slots provided as the possible appointment choices to the user device, wherein

the locking makes the plurality of time slots provided as the possible appointment choices unavailable for subsequent requests;

receiving a rejection of the plurality of time slots provided as possible appointment choices, wherein

the rejection is received from the user device;

in response to the rejection,

unlocking the plurality of time slots, and

providing, to the user device, a substitute plurality of time slots as possible appointment choices for the appointment;

receiving, from the user device, a selection for one of the time slots in the substitute plurality of time slots provided as the possible appointment choices;

unlocking all time slots in the substitute plurality of time slots provided as the possible appointment choices other than the selected time slot, wherein

the unlocking the all time slots in the substitute plurality of time slots other than the selected time slot is performed in response to the receiving the selection, and

the unlocking the all time slots in the substitute plurality of time slots other than the selected time slot causes the unlocked time slots in the substitute plurality of time slots to become available for subsequent requests; and

booking the activity in the selected time slot by updating information stored in a computer memory device.

2. The method of claim 1, further comprising:

defining a duration for the time slots based on an expected duration for the activity;

after the booking, optimizing the selected time slot, wherein

the optimizing comprises rearranging a plurality of activities in the selected time slot,

the rearranging is performed by a processor coupled to the computer memory device, and

the optimizing is based at least in part on

a cost function of the selected time slot; and

optimizing a second time slot, wherein

the optimizing the second time slot is performed substantially in parallel with the booking, and

the second time slot and the selected time slot are distinct from each other.

3. The method of claim 1, further comprising:

locking the schedule in response to the receiving the request, wherein the locking the schedule makes all time slots in the schedule unavailable for subsequent requests.

4. The method of claim 3, further comprising:

unlocking the schedule after the providing the plurality of time slots.

5. The method of claim 1, further comprising:

receiving a request for a next plurality of the time slots; and

providing the next plurality of the time slots as additional possible appointment choices, wherein

the time slots in the next plurality of the time slots are not included among time slots previously provided for the activity.

6. The method of claim 1, further comprising:

receiving a request for a particular number of additional time slots; and

providing the requested number of additional time slots, if available, as the possible appointment choices.

7. The method of claim 1, wherein the locked time slots are released after a particular amount of time.

8. The method of claim 1, further comprising:

determining available time slots in the schedule for booking the activity based on a set of parameters associated with the activity and parameters associated with resources in the schedule.

9. The method of claim 8, wherein the available time slots are determined based in part on an earliest time and a latest time between which the activity may be booked.

10. The method of claim 1, further comprising:

optimizing the schedule for a particular time segment to provide a more optimum schedule having a lower cost.

11. The method of claim 1, wherein the schedule is partitioned into a plurality of time segments.

12. The method of claim 11, wherein new appointments are booked in a first time segment of the schedule.

13. The method of claim 11, further comprising:

optimizing a first time segment of the schedule to provide a schedule having a lower cost.

14. The method of claim 11, wherein a first time segment of the schedule is fixed, and no changes due to non-emergency events are made to the first time segment of the schedule.

15. The method of claim 1, wherein:

the plurality of time slots provided as possible appointment choices is based at least in part on corresponding costs associated with the possible appointment choices, and

the locking the plurality of time slots comprises temporarily locking the plurality of time slots for a predetermined timeout period.

16. A scheduling system comprising:

a first local storage device; and

an appointment booking system, coupled to the first local storage device and configured to

receive a request to book an appointment for an activity in a schedule,

perform a check of a service region associated with the request,

perform a check on a no-later-than time included in the request,

perform a check on a no-sooner-than time included in the request,

provide a plurality of time slots as possible appointment choices for the appointment, subsequent to the perform the check of the service region, the perform the check on the no-later-than time, and the perform the check on the no-sooner-than time, wherein

time slots in the plurality of time slots provided as the possible appointment choices are available in the schedule for booking the activity,

lock the plurality of time slots provided as the possible appointment choices so that the plurality of time slots provided as the possible appointment choices are unavailable for subsequent requests,

receive a rejection of the plurality of time slots provided as possible appointment choices,

in response to the rejection,

unlock the plurality of time slots, and

provide a substitute plurality of time slots as possible appointment choices for the appointment,

receive a selection for one of the time slots in the substitute plurality of time slots provided as the possible appointment choices,

unlock, in response to the selection, all time slots in the substitute plurality of time slots provided as the possible appointment choices other than the selected time slot so that the unlocked time slots in the substitute plurality of time slots are available for subsequent requests, and

update a record in the first local storage device to book the activity in the selected time slot.

17. The scheduling system of claim 16, further comprising:

an optimizer configured to

receive a set of constraints comprising;

constraints related to one or more activities in the schedule, and

constraints related to one or more candidate resources for the one or more activities,

compute a current cost for the schedule based on a cost function,

rearrange activities in the selected time slot based on the set of constraints,

compute a new cost for the schedule using the cost function and the rearranged activities in the selected time slot,

compare the new cost and the current cost, and

revise the schedule based at least in part on

an improvement algorithm, and

a comparison of the new cost and the current cost.

18. The scheduling system of claim 17, wherein the optimizer is configured to operate substantially in parallel with the appointment booking system.

19. The scheduling system of claim 17, wherein the constraints related to the one or more activities comprise one or more of:

a location constraint, or

a required equipment constraint.

20. The scheduling system of claim 17, wherein the constraints related to the one or more activities comprise one or more of:

a time constraint,

a constraint relating to type-of-activity, or

a constraint relating to priority-of-activity.

21. The scheduling system of claim 17, wherein the constraints related to the one or more candidate resources comprise one or more of:

a constraint relating to equipment available to a human resource, and

a constraint relating to locations in which the human resource is available.

22. The scheduling system of claim 17, wherein the constraints related to the one or more candidate resources comprise one or more of:

a constraint relating to a skill of an available human resource, and

a constraint relating to times during which the human resource is available.

23. A computer program product, comprising:

a non-transitory computer-readable storage medium; and

instructions encoded on the computer-readable storage medium, wherein the instructions are executable by one or more processors to perform a method for scheduling activities, the method comprising;

receiving a request to book an appointment for an activity in a particular schedule,

performing a check of a service region associated with the request,

performing a check on a no-later-than time included in the request,

performing a check on a no-sooner-than time included in the request,

subsequent to the performing the check of the service region, the performing the check on the no-later-than time, and the performing the check on the no-sooner-than time, providing a plurality of time slots as possible appointment choices for the appointment, wherein

time slots in the plurality of time slots provided as the possible appointment choices are available in the schedule for booking the activity,

locking the plurality of time slots provided as the possible appointment choices, wherein the locking makes the plurality of time slots provided as the possible appointment choices unavailable for subsequent requests,

receiving a rejection of the plurality of time slots provided as possible appointment choices

in response to the rejection,

unlocking the plurality of time slots, and

providing a substitute plurality of time slots as possible appointment choices for the appointment,

receiving a selection for one of the time slots in the substitute plurality of time slots provided as the possible appointment choices,

unlocking all time slots in the substitute plurality of time slots provided as the possible appointment choices other than the selected time slot, wherein

the unlocking the all time slots in the substitute plurality of time slots other than the selected time slots is performed in response to the receiving the selection, and

the unlocking the all time slots in the substitute plurality of time slots other than the selected time slots causes the unlocked time slots in the substitute plurality of time slots to become available for subsequent requests, and

booking the activity in the selected time slot.