Method and system for scheduling distribution routes and timeslots

• US 7,251,612 B1
• Filed: 07/20/2000
• Issued: 07/31/2007
• Est. Priority Date: 01/10/2000
• Status: Expired due to Term

• Current Assignee: JUNE RAY LIMITED
• Original Assignee: Kaiser Foundation Hospitals (Kaiser Permanente Inc.)
• Inventors: Parker, John E., Smith, Michael L.
• Primary Examiner(s): BOYCE, ANDRE D
• Application Number:
  US09/620,199
• Time in Patent Office: 2,567 Days
• Field of Search: 705/9
• US Class Current: 705/7.22
• CPC Class Codes: G06Q 10/06312 Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
• CPC Class Codes: G06Q 10/06316 Sequencing of tasks or work
• CPC Class Codes: G06Q 10/08 Logistics, e.g. warehousing, loading or distribution; Inventory or stock management

Abstract

Computer-based methods and systems for dynamically scheduling the distribution of products and services among a system of routes and timeslots are provided. Exemplary embodiments provide a Route and Timeslot Scheduler (the “RTS”), which controls the creation, quantity, and allocation of schedule stops (or events) for each timeslot of each route based upon a calendar and template system. Each route typically represents a geographic area to which products can be delivered. Each timeslot typically represents a window of time, during which delivery stops (or events) can be scheduled. Scheduled stops/events are created based upon defaults which are specified in the template system. A calendar system is provided to specify which routes and timeslots, which would otherwise be available based upon the template system, are actually applicable to be scheduled on a given calendar day. The RTS creates scheduled stops for a designated point.

Claims

1. A computer-implemented method for dynamically creating a schedule of timeslot segments for a plurality of routes and timeslots, the method comprising:

determining from a calendar, a set of possible route types for a selected day and a template Identifier;

based upon the determined set of possible route types, retrieving a set of available route types from a template identified by the template identifier, wherein the available route types are limited to those route types that are within the set of possible route types, wherein the template includes at least available route types;

for each available route type, determining a set of routes for the selected day; and

for each set of routes, creating in a data repository a set of schedulable timeslot segments that correspond to the selected day,

wherein the routes are determined based on the available route types, the route types being descriptors or identifiers for grouping the different routes, wherein each of the routes is not separated into different route types, wherein at least one of the available route types is a default route type that is available for distribution of products or services on normal days, wherein at least another one of the available route types is a special route type that is available for distribution of products or services on holidays or without charge, and wherein the special route type can override the default route type, and

wherein an electronic storefront system thereafter schedules at least one delivery stop using one or more of the set of schedulable timeslot segments, the at least one delivery stop being for delivery of a product or service.

2. The method of claim 1, further comprising for each set of routes, determining a set of timeslots, wherein a portion of the set of schedulable timeslot segments are created to correspond to each timeslot.

3. The method of claim 2 wherein the number of created schedulable timeslot segments that correspond to each timeslot are based upon a potential number of timeslot segments associated with each timeslot.

4. The method of claim 2, further comprising:

modifying the template such that data that corresponds to, at least one of the set of timeslots are changed; and

updating the created set of schedulable timeslot segments in the data repository to correspond to the changed data.

5. The method of claim 1 wherein the template identifier identifies one of the days of a week.

6. The method of claim 1 wherein the method produces a delivery schedule, wherein as the schedulable timeslot segments are scheduled for the at least one delivery stop, the delivery schedule is updated, and wherein the method further comprises alerting a user when the schedulable timeslot segments available to be scheduled are within a threshold amount of being completely scheduled.

7. The method of claim 1 wherein a schedulable timeslot segment corresponds to an event.

8. The method of claim 1 wherein the selected day is a date in the future.

9. The method of claim 8 wherein the method is used to create schedulable events for a sequence of days in the future.

10. The method of claim 1 wherein the schedulable timeslot segments are sent to another program to be allocated to actual events, and wherein the actual events are scheduled delivery orders.

11. The method of claim 1 wherein the special route type indicates that no routes are available for the selected day.

12. The method of claim 1 wherein the special route type indicates holiday service is available for the selected day.

13. The method of claim 1 wherein each route is based upon geographical data.

14. The method of claim 1, further comprising:

modifying the template such that data that corresponds to at least one of the set of routes are changed; and

updating the created set of schedulable timeslot segments in the data repository to correspond to the changed data.

15. The method of claim 1, further comprising using the determined set of routes to automatically generate in the data repository a set of schedulable timeslot segments that correspond to a different day.

16. The method of claim 1 wherein the method further comprises alerting a user when the schedulable timeslot segments available to be scheduled are within a threshold amount of being completely scheduled.

17. A computer-readable memory medium containing instruction for controlling a computer processor to dynamically create a schedule of timeslot segments for a plurality of routes and timeslots by:

determining from a calendar, a set of possible route types for a selected day and a template identifier;

based upon the determined set of possible route types, retrieving a set of available route types from a template identified by the template identifier, wherein the available route types are limited to those route types that are within the set of possible route types, wherein the template includes at least available route types,

for each available route type, determining a set of routes for the selected day; and

for each set of routes, creating a data repository a set of schedulable timeslot segments that correspond to the selected day,

wherein the routes are determined based on the route types, the route types being descriptors or identifiers for grouping the different routes, and wherein each of the routes is not separated into the different route types, wherein at least one of the available route types is a default route type that is available for distribution of products or services on normal days, wherein at least another one of the available route types is a special route type that is available for distribution of products or services on holidays or without charge, and wherein the special route type can override the default route type, and

wherein an electronic storefront program thereafter schedules at least one delivery stop using one or more of the set of schedulable timeslot segments, the at least one delivery stop being for delivery of a product or service.

18. The computer-readable memory medium of claim 17, further comprising for each set of routes, determining a set of timeslots, wherein a portion of the set of schedulable timeslot segments are created to correspond to each timeslot.

19. The computer-readable memory medium of claim 18 wherein the number of created schedulable timeslot segments that correspond to each timeslot are based upon a potential number of timeslot segments associated with each timeslot.

20. The computer-readable memory medium of claim 17 wherein a schedulable timeslot segment corresponds to a delivery stop.

21. The computer-readable memory medium of claim 20 wherein a schedulable timeslot segment is allocated to an order to delivery groceries.

22. The computer-readable memory medium of claim 17 wherein the product or service was purchased at an online grocery store.

23. The computer-readable memory medium of claim 17,

wherein the set of schedulable timeslot segments supports the scheduling of a delivery of a product a plurality of days into the future, and

wherein at least one route type in the set of possible route types indicates that (i) no routes are available for the selected day, or (ii) a holiday service is available for the selected day.

24. The computer-readable memory medium of claim 17 wherein computer-readable medium further contains instructions for controlling the computer processor to alert a user when the schedulable timeslot segments available to be scheduled are within a threshold amount of being completely scheduled.

26. The scheduling system of claim 24 wherein the available routes, timeslots, and numbers of potential timeslot segment per timeslot are grouped by day of week.

27. The scheduling system of claim 24 wherein the user interface comprises a collection of database forms.

28. The scheduling system of claim 24 wherein the elements comprise a database system.

29. The scheduling system of claim 24 wherein a scheduled timeslot segment for a timeslot, for a route, for a designated calendar day that was created in the data repository is allocated to an order for a product or service.

30. The scheduling system of claim 24 wherein a scheduled timeslot segment for a timeslot, for a route, for a designated calendar day that was created in the data repository is allocated to a particular customer.

31. The scheduling system of claim 30 wherein a timeslot segment is allocated to the particular customer based upon a rating system.

25. A computer-based home delivery scheduling system comprising:

a data repository;

a set of routines for automatically creating in the data repository scheduled timeslot segments for each timeslot, for each route, for a designated calendar day, based upon a template and a calendar system that indicates available routes, timeslots, and numbers of potential timeslot segments per timeslot subject to the available routes being permissible on a particular calendar day, wherein the template is a master pattern from which a copy may be made to create a schedule, wherein the template includes at least available route types, wherein the routes are determined based on the available route types, the available route types being descriptors or identifiers for grouping the different routes, each of the routes is not separated into different route types, at least one of the available route types is a default route type that is available for distribution of products or services on normal days, at least another one of the available route types is a special route type that is available for distribution of products or services on holidays or without charge, and the special route type can override the default route type; and

a user interface for displaying and modifying scheduling data stored in the data repository by invoking the set of routines,

wherein thereafter using the scheduled timeslot segments to schedule deliveries of products and services purchased at an electronic storefront.