IP Library Granted Patent US 7,127,412
Granted Patent B2
US 7,127,412 · App. 09/327,228 · Granted Oct 24, 2006

Method and system for allocating specific appointment time windows in a service industry

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,127,412
App. No.
09/327,228
Granted
Oct 24, 2006
Kind
B2
Abstract

The present invention provides a method for allocating appointment time windows. The steps of this method include creating a statistical estimate of a daily schedule comprising a series of estimated service orders. An actual service order is then received. This actual service order is inserted into the daily schedule by using a set of scheduling instructions for determining the least cost to employ the available service resources. At this point, this actual service order does not have a system imposed time window. The set of scheduling instructions is used to determine a time window surrounding this insertion point. If the customer accepts this time window, then the closest estimated service order is replaced by this actual service order, and the daily schedule is recomputed based upon the revised set of service orders to yield a revised daily schedule. This process may be repeated for any number of days or time periods from which the customer may choose the time window best meeting the customer's availability.

Claims (28)

1. A method for allocating an appointment time window to derive an optimal service schedule for a service provider, comprising the steps of:

generating a statistical service schedule estimate for a predetermined service time period, said statistical service schedule estimate comprising a set of statistically-derived service orders;

(a) receiving an actual service order to fulfill in said predetermined service time period;

(b) imposing a scheduled time on said actual service order to derive an optimal time window in which to fulfill said actual service order wherein said scheduled time of said actual service order is centered within said optimal time window;

(c) comparing said actual service order to said set of statistically-derived service orders for determining a most closely related service order from said set of statistically-derived service orders;

(d) replacing said most closely related service order with said actual service order creating a modified service order set;

(e) generating a modified service schedule based on said modified service order set; and

(f) repeating steps (a) through (e) in response to the receipt of additional actual service orders for generating the optimal service schedule.

2. A method for allocating appointment time windows, using a computer program, and wherein the computer program is operable to execute the method with a scheduler software engine, comprising the steps of:

generating a statistical service schedule estimate for a predetermined service time period, said statistical service schedule estimate comprising a set of statistically-derived service orders;

(a) receiving an actual service order to fulfill in said predetermined service time period;

(b) imposing a scheduled time on said actual service order to derive an optimal time window in which to fulfill said actual service order wherein said scheduled time of said actual service order is centered within said optimal time window;

(c) comparing said actual service order to said set of statistically-derived service orders for determining a most closely related service order from said set of statistically-derived service orders;

(d) replacing said most closely related service order with said actual service order creating a modified service order set;

(e) generating a modified service schedule based on said modified service order set; and

(f) repeating steps (a) through (e) in response to the receipt of additional actual service orders for generating an optimal service schedule.

3. A computer system directed by a computer program operable to schedule a plurality of diverse work assignments, the computer system comprising:

a software engine;

a storage device operable to store program data;

a memory operable to store a computer program;

a processor coupled to the storage device and the memory, the processor operable to execute the computer program such that the computer is directed by the computer program to allocate appointment time windows for service orders performed by a mobile workforce having a plurality of mobile workforce members by performing the steps of:

generating a statistical service schedule estimate for a predetermined service time period, said statistical service schedule estimate comprising a set of statistically-derived service orders;

(a) receiving an actual service order to fulfill in said predetermined service time period;

(b) imposing a scheduled time on said actual service order to derive an optimal time window in which to fulfill said actual service order wherein said scheduled time of said actual service order is centered within said optimal time window;

(c) comparing said actual service order to said set of statistically-derived service orders for determining a most closely related service order from said set of statistically-derived service orders;

(d) replacing said most closely related service order with said actual service order creating a modified service order set;

(e) generating a modified service schedule based on said modified service order set; and

(f) repeating steps (a) through (e) in response to the receipt of additional actual service orders for generating an optimal service schedule.

Assignments (11)
CORRECTIVE ASSIGNMENT TO CORRECT THE THE COVER SHEET, WHICH LISTED PATENT NUMBER 6377219 IN ERROR. THE CORRECT PATENT NUMBER IS 6377210 PREVIOUSLY RECORDED ON REEL 052697 FRAME 0574. ASSIGNOR(S) HEREBY CONFIRMS THE CORRECT LISTING OF PATENT 6377210 ON PAGE 6, ROW 8 OF THE ORIGINAL RELEASE OF SECURITY INTEREST.. Recorded May 20, 2020
From: THE TORONTO-DOMINION BANK
To: GEOTAB INC.
Reel/Frame 052718/0050 →
RELEASE OF SECURITY INTEREST Recorded May 19, 2020
From: THE TORONTO-DOMINION BANK
To: GEOTAB INC.
Reel/Frame 052697/0574 →
MERGER Recorded Apr 28, 2020
From: BSM TECHNOLOGIES LTD.
To: GEOTAB INC.
Reel/Frame 052518/0711 →
CHANGE OF NAME Recorded Aug 28, 2019
From: POINTSERVE, INC.
To: MOBI CORP.
Reel/Frame 050206/0200 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 26, 2017
From: MOBI CORP.
To: BSM TECHNOLOGIES LTD.
Reel/Frame 042155/0754 →
SECURITY INTEREST Recorded Dec 22, 2016
From: BSM TECHNOLOGIES LTD. F/K/A BSM WIRELESS INC.
To: THE TORONTO-DOMINION BANK
Reel/Frame 040744/0314 →
RELEASE OF SECURITY INTEREST Recorded Dec 9, 2016
From: LAMPE, CONWAY & CO., LLC
To: POINTSERVE, INC.
Reel/Frame 040700/0609 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 7, 2016
From: MOBI CORP.
To: BSM TECHNOLOGIES LTD. F/K/A BSM WIRELESS INC.
Reel/Frame 040242/0255 →
SECURITY AGREEMENT Recorded Nov 17, 2006
From: POINTSERVE, INC.
To: LAMPE, CONWAY & CO., LLC
Reel/Frame 018535/0001 →
CORRECTIVE CHANGE OF NAME TO CORRECT THE NAME OF THE ASSIGNOR PREVIOUSLY RECORDED AT REEL 010023 FRAME 0687. Recorded May 19, 2000
From: POWELL, G. EDWARD; LANE, MARK T.; INDSETH, RUNAR
To: POINTSERVE, INC.
Reel/Frame 010797/0754 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 7, 1999
From: POWELL, G. EDWARD; LANE, MART T.; INDSETH, RUNAR
To: EPICRON, INC., A CORP. OF TEXAS
Reel/Frame 010023/0687 →