Real-Time Publishing of Finite Schedules and Real-Time Response to Schedule Changes

• US 20130275173A1
• Filed: 04/11/2012
• Published: 10/17/2013
• Est. Priority Date: 04/11/2012
• Status: Abandoned Application

• Current Assignee: Bioproduction Group
• Original Assignee: Bioproduction Group
• Inventors: Johnston, Lenrick
• Application Number:
  US13/444,779
• Publication Number:
  US 20130275173A1
• Time in Patent Office: Days
• 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

Abstract

A method for real-time publishing of a finite schedule that includes a plurality of activities and a plurality of resources is presented. The method utilizes at least one master schedule derived from an output of the finite schedule and at least one published schedule associated with the at least one master schedule. The at least one master schedule includes at least one master activity instance and the at least one published schedule includes at least one published activity instance. The method creates a schedule mapping table and an activity instance-mapping table. The schedule mapping table stores at least one relationship between the at least one master schedule and the at least one published schedule. Furthermore, the method updates the finite schedule and communicates schedule deviations in real-time with the finite schedule.

Claims

1. A method for real-time publishing of a feasible finite schedule comprising a plurality of activities and a plurality of resources, the method comprising the steps of:

(a) deriving at least one master schedule a, a=1 . . . A from an output of a finite schedule, the at least one master schedule comprising at least one master activity instance i_a, i_a=1 . . . I_a associated therewith;

(b) providing at least one published schedule b, b=1 . . . B associated with the at least one master schedule a, the at least one published schedule b including at least one published activity instance i_b, i_b=1 . . . I_b associated therewith;

(c) creating a schedule mapping table to store at least one relationship between the at least one master schedule a and the at least one published schedule b;

(d) creating an activity instance mapping table for the at least one master schedule a, the activity instance mapping table including at least one unique identifier to map the at least one master activity instance i_a and the at least one published activity instance i_b in the at least one master schedule a and the at least one published schedule b;

(e) defining at least one property p, p=1 . . . P for the at least one master activity instance i_a and the at least one published activity instance i_b;

(f) iterating over each of the at least one master schedule a, a=1 . . . A and determining the existence of the at least one published schedule b by checking the schedule mapping table;

(g) creating a new published schedule if the at least one published schedule b does not exist in the schedule mapping table;

(h) iterating over each of the at least one master activity instance i_a and iterating over each of the at least one published schedule b to determine if the at least one published activity instance i_b exists in the at least one published schedule b by checking the activity instance mapping table;

(i) creating a new published activity instance if the at least one published activity instance i_b does not exist in the at least one published schedule b and storing an entry i_a/i_b in the activity instance mapping table for the at least one published schedule b;

(j) iterating over each of the at least one property p, p=1 . . . P for determining if the at least one property of the at least one master activity instance i_a matches with the at least one published activity instance i_b;

(k) altering the at least one published schedule b, the at least one published activity instance i_b and the at least one property p to match with the at least one master schedule a and registering an entry i_a/i_b in the activity instance mapping table as not valid if the at least one property p of the at least one master activity instance i_a does not match with the at least one published activity instance i_b; and

(l) registering the entry i_a/i_b in the activity instance mapping table as valid if the at least one property p of the at least one master activity instance i_a matches with the at least one published activity instance i_b.

2. The method of claim 1 wherein the publishing of the finite schedule allows the at least one master schedule to communicate with at least one device utilizing E-mail and Calendar platforms.

3. The method of claim 2 wherein the at least one device may be selected from a group consisting of a computer, a smart phone, a mobile phone and a mechanism adaptable to view the at least one master schedule a.

4. The method of claim 1 wherein each of the plurality of activities of the finite schedule includes a start date and time, end date and time, an activity name and the plurality of resources.

5. The method of claim 1 wherein the at least one unique identifier allows to map the at least one published activity instance i_b to a location on the at least one published schedule b.

6. The method of claim 1 wherein the schedule mapping table may include information to find the at least one published schedule b.

7. A method for real-time updating a finite schedule comprising a plurality of activities and a plurality of resources, the method comprising the steps of:

(a) deriving at least one master schedule a, a=1 . . . A from an output of a finite schedule, the at least one master schedule including at least one master activity instance i_a, i_a=1 . . . I_a associated therewith;

(b) providing at least one published schedule b, b=1 . . . B associated with the at least one master schedule a, the at least one published schedule b including at least one published activity instance i_b, i_b=1 . . . I_b associated therewith;

(c) creating a schedule mapping table to store at least one relationship between the at least one master schedule a and the at least one published schedule b;

(d) creating an activity instance mapping table for the at least one master schedule a, the activity instance mapping table including at least one unique identifier to map the at least one master activity instance i_a and the at least one published activity instance i_b in the at least one master schedule a and the at least one published schedule b;

(e) defining at least one property p, p=1 . . . P for the at least one master activity instance i_a and the at least one published activity instance i_b;

(f) iterating over each of the at least one master schedule a, a=1 . . . A and determining the existence of the at least one published schedule b by checking the schedule mapping table;

(g) creating a new published schedule if the at least one published schedule b does not exist in the schedule mapping table;

(h) iterating over each of the at least one master activity instance i_a and iterating over each of the at least one published schedule b to determine if the at least one published activity instance i_b exists in the at least one published schedule b by checking the activity instance mapping table;

(i) creating a new published activity instance if the at least one published activity instance i_b does not exist in the at least one published schedule b and storing an entry i_a/i_b in the activity instance mapping table for the at least one published schedule b;

(j) iterating over each of the at least one property p, p=1 . . . P for determining if the at least one property of the at least one master activity instance i_a matches with the at least one published activity instance i_b;

(k) altering the at least one published schedule b, the at least one published activity instance i_b and the at least one property p to match with the at least one master schedule a and registering an entry i_a/i_b in the activity instance mapping table as not valid if the at least one property p of the at least one master activity instance is does not match with the at least one published activity instance i_b;

(l) registering the entry i_a/i_b in the activity instance mapping table as valid if the at least one property p of the at least one master activity instance i_a matches with the at least one published activity instance i_b;

(m) iterating over each of the at least one published schedule b, b=1 . . . B and iterating over each of the at least one published activity instance i_b, i_b=1 . . . I_b in the activity instance mapping table to determine if the at least one published activity instance i_b is registered as not valid and exists in the at least one published schedule b;

(n) removing the at least one published activity instance i_b from the activity instance mapping table if the at least one published activity instance i_b is flagged as valid; and

(o) deleting the at least one published activity instance i_b from the at least one published schedule b and removing the at least one published activity instance i_b from the activity instance mapping table if the at least one master activity instance i_a is fagged as not valid.

8. The method of claim 7 wherein the publishing of the finite schedule allows the at least one master schedule to communicate with at least one device utilizing E-mail and Calendar platforms.

9. The method of claim 8 wherein the at least one device may be selected from a group consisting of a computer, a smart phone, a mobile phone and a mechanism adaptable to view the at least one master schedule a.

10. The method of claim 7 wherein each of the plurality of activities of the finite schedule includes a start date and time, end date and time, an activity name and the plurality of resources.

11. The method of claim 7 wherein the at least one unique identifier to map the at least one published activity instance i_b to a location on the at least one published schedule b.

12. The method of claim 7 wherein the schedule mapping table may include information to find the at least one published schedule b.

13. A method for communicating at least one schedule deviation with a finite schedule comprising a plurality of activities and a plurality of resources at real-time, the method comprising the steps of:

(a) deriving at least one master schedule a, a=1 . . . A from an output of a finite schedule, the at least one master schedule including at least one master activity instance i_a, i_a=1 . . . I_a associated therewith;

(b) providing at least one published schedule b, b=1 . . . B associated with the at least one master schedule a, the at least one published schedule b including at least one published activity instance i_b, i_b=1 . . . I_b associated therewith;

(c) creating a schedule mapping table to store at least one relationship between the at least one master schedule a and the at least one published schedule b;

(d) creating an activity instance mapping table for the at least one master schedule a, the activity instance mapping table including at least one unique identifier to map the at least one master activity instance i_a and the at least one published activity instance i_b in the at least one master schedule a and the at least one published schedule b;

(e) defining at least one property p, p=1 . . . P for the at least one master activity instance i_a and the at least one published activity instance i_b;

(f) iterating over each of the at least one master schedule a, a=1 . . . A and determining the existence of the at least one published schedule b by checking the schedule mapping table;

(g) creating a new published schedule if the at least one published schedule b does not exist in the schedule mapping table;

(h) iterating over each of the at least one master activity instance i_a and iterating over each of the at least one published schedule b to determine if the at least one published activity instance i_b exists in the at least one published schedule b by checking the activity instance mapping table;

(i) creating a new published activity instance if the at least one published activity instance i_b does not exist in the at least one published schedule b and storing an entry i_a/i_b in the activity instance mapping table for the at least one published schedule b;

(j) iterating over each of the at least one property p, p=1 . . . P for determining if the at least one property of the at least one master activity instance i_a matches with the at least one published activity instance i_b;

(k) altering the at least one published schedule b, the at least one published activity instance i_b and the at least one property p to match with the at least one master schedule a and registering an entry i_a/i_b in the activity instance mapping table as not valid if the at least one property p of the at least one master activity instance i_a does not match with the at least one published activity instance i_b;

(l) registering the entry i_a/i_b in the activity instance mapping table as valid if the at least one property p of the at least one master activity instance i_a matches with the at least one published activity instance i_b;

(m) iterating over each of the at least one published schedule b, b=1 . . . B and determining the presence of the at least one master schedule a for the published schedule b by checking the schedule mapping table;

(n) deleting the at least one published schedule b if the at least one master schedule a does not exist;

(o) iterating over each of the at least one published activity instance i_b in the at least one published schedule b if the at least one master schedule a exists;

(p) iterating over each of the at least one master schedule a, a=1 . . . A and determining if the entry i_a/i_b exists in the at least one master schedule a by checking the activity instance mapping table;

(q) deleting the at least one published activity instance i_b from the at least one published schedule b if the entry i_a/i_b does not exist in the at least one master schedule a;

(r) iterating over each of the at least one property p, p=1 . . . P if the entry i_a/i_b exists in the at least one master schedule a;

(s) determining if the at least one property p matches for the at least one master activity instance i_a and the at least one published activity instance i_b;

(t) storing the at least one difference in the property of the at least one master activity instance i_a and the at least one published activity instance i_b in a difference table D_a;

(u) iterating over each of the at least one master schedule a and iterating over each of the at least one master activity instance i_a in the at least one master schedule a;

(v) iterating over each of the at least one property p to collect the at least one difference stored in the difference table D_a; and

(w) performing at least one action based on the at least one difference.

14. The method of claim 13 wherein the at least one action may be to accept the at least one difference if the at least one published schedule b shows a change from the at least one master schedule a.

15. The method of claim 14 wherein the at least one difference is accepted by updating the at least one master activity instance i_a with the data from the at least one published activity instance i_b.

16. The method of claim 13 wherein the at least one action may be to reject the at least one difference if the at least one published schedule b shows the change from the at least one master schedule a.

17. The method of claim 16 wherein the at least one difference is rejected by deleting the activity instance mapping table.

18. The method of claim 13 wherein when there is no change issued from the at least one published schedule b then no change is made to the at least one master schedule a.