Appointment booking and scheduling system

• US 5,848,395 A
• Filed: 06/26/1996
• Issued: 12/08/1998
• Est. Priority Date: 03/23/1996
• Status: Expired due to Term

• Current Assignee: International Computers Limited (Fujitsu Limited)
• Original Assignee: International Computers Limited (Fujitsu Limited)
• Inventors: Smith, Alan, Johnson, Michael Alan, Webster, Donald Brian, Edgar, James William Hardie, Gathercole, Peter John, Roycroft, Alistair Edward
• Primary Examiner(s): MacDonald, Allen R.
• Assistant Examiner(s): Jeanty, Romain
• Application Number:
  US08/673,728
• Time in Patent Office: 895 Days
• Field of Search: 705/5, 705/9, 705/1, 705/8, 364/468.06, 364/468.08, 364/468.05, 364/472.05, 364/478.11, 364/479.02
• US Class Current: 705/7.13
• CPC Class Codes: G06Q 10/02 Reservations, e.g. for tickets, services or events
• CPC Class Codes: G06Q 10/06311 Scheduling, planning or task assignment for a person or group
• CPC Class Codes: G06Q 10/109 Time management, e.g. calendars, reminders, meetings or time accounting
• CPC Class Codes: G16H 40/20 for the management or administration of healthcare resources or facilities, e.g. managing hospital staff or surgery rooms

Abstract

An appointment booking and scheduling system is described, for booking appointments with operatives (e.g. service engineers) visiting customer sites within a defined geographic area. The system includes a table for storing a number of routes, each of which specifies a sequence of regions to be visited by a particular operative, and jobs to be performed by the operative in each of the regions. An appointment server is provided for offering appointments at specified times, using the table to check for availability of operatives in specified regions at specified times, and for inserting new jobs in the routes to reflect booked appointments. A scheduler periodically updates the routes e.g by means of a simulated annealing process, to generate a new set of routes.

Claims

1. A computerized appointment booking and scheduling apparatus for scheduling a plurality of operatives traveling to sites in a geographical area, said geographical area being divided into a plurality of regions, each of which regions includes a plurality of said sites, said apparatus comprising:

(a) a database for storing information relating to a plurality of appointments that have been booked, and for storing a plurality of routes, each of said routes comprising information specifying a sequence of said regions to be visited by a particular operative, the times the operative is scheduled to enter and leave each of said sequence of regions, and the amount of free time available for new appointments in each of said sequence of regions;

(b) an appointment server for offering appointments at specified times, using said routes stored in the database to check for availability of operatives in specified regions at specified times, and for inserting new appointments in the database and updating said routes to reflect said new appointments; and

(c) an appointment scheduler for periodically accessing the database to obtain said information relating to appointments that have been booked, using this information to generate a new plurality of routes, optimizing said new plurality of routes in accordance with predetermined criteria, and writing said new plurality of routes into said database to replace the existing plurality of routes stored in said database.

2. Apparatus according to claim 1 further including means for checking whether a predetermined trigger number of appointments has been made since the last time said appointment scheduler was run and for running said appointment scheduler whenever said predetermined trigger number of appointments has been made.

3. A method of operating a computer apparatus to schedule a plurality of operatives traveling to sites in a geographical area, said geographical area being divided into a plurality of regions, each of which regions includes a plurality of said sites, said method comprising the steps:

(a) storing in a database information relating to a plurality of appointments that have been booked, and a plurality of routes, each of said routes comprising information specifying a sequence of said regions to be visited by a particular operative, the times the operative is scheduled to enter and leave each of said sequence of regions, and the amount of free time available for new appointments in each of said sequence of regions;

(b) offering appointments at specified times, using said routes stored in the database to check for availability of operatives in specified regions at specified times;

(c) booking new appointments, inserting the new appointments in the database, and updating said routes to reflect the new appointments; and

(d) periodically accessing the database to obtain said information relating to appointments that have been booked, using this information to generate a new plurality of routes, optimizing said new plurality of routes in accordance with predetermined criteria, and writing said new plurality of routes into said database to replace the existing plurality of routes stored in said database.

4. A method according to claim 3 including the further step of checking whether a predetermined trigger number of appointments has been made since the last time said appointment scheduler was run, and running said appointment scheduler whenever said predetermined trigger number of appointments has been made.