Patent Application
20080059265
The present invention will now be described more fully hereinafter, with reference to the accompanying drawings, in which illustrative embodiments of the invention are shown. Throughout the drawings, like numbers refer to like elements.
The invention may, however, be embodied in many different forms, and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that the disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
As will be appreciated by one of skill in the art, the present invention may be embodied as a method, data processing system, or computer program product. Accordingly, the present invention may take the form of an embodiment entirely in hardware, entirely in software, or in a combination of aspects in hardware and software referred to as circuits and modules.
Furthermore, the present invention may take the form of a computer program product on a computer-usable storage medium having computer-usable program code embodied in the medium. Any suitable computer-readable medium may be utilized, including hard disks, CD-ROMs, optical storage devices, magnetic storage devices, and transmission media such as those supporting the Internet or an intranet.
Computer program code for carrying out operations of the present invention may be written in an object oriented programming language such as Java7, Smalltalk, or C++. However, the computer program code for carrying out operations of the present invention may also be written in conventional procedural programming languages, such as the C programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on a remote computer. The remote computer may be connected to the user's computer through a local area network or a wide area network, or the connection may be made to an external computer, for example through the Internet using an Internet Service Provider.
The present invention is described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions and/or acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer readable memory produce an article of manufacture including instruction means which implement the functions or acts specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions that execute on the computer or other programmable apparatus provide steps for implementing the functions and/or acts specified in the flowchart and/or block diagram block or blocks.
The present invention includes methods, apparatus, and computer program products for estimating, scheduling, and tracking preparatory work that is implicitly or explicitly associated with electronic meeting invitations. The associated work often takes the form of to-do items that require blocks of time for their completions before the meetings, such as reviewing documents of various kinds. According to the invention, a user's calendar and to-do list may be coordinated so as to keep track of such preparatory work that arises from electronically called meetings.
When an electronic meeting invitation is received and tentatively accepted, the expected preparation time for any associated work is estimated programmatically, without requiring input from the user. This estimate may be computed by examining documentation attached to or otherwise associated with the meeting invitation, for example by links. To do so, the document type of each associated document is determined, for example by determining its file-type designation. Document types may include word processing text, presentation slides, spreadsheets, PDF files, and the like. Based on each document type, and on the length of each associated document, the estimated preparation time is computed. In a preferred embodiment of the invention, default preparation times are one minute for each 250 words of text; one minute for each drawing, figure, and PDF file; and one minute for each spreadsheet line. The user may be allowed or prompted to change these values. Thus, for example, a meeting invitation having two attached documents, one being a 5000 word text file with ten drawings, and the second being a 30-line spreadsheet, would have an estimated preparation time of 20 minutes for the text, 10 minutes for the drawings, and 30 minutes for the spreadsheet, giving a total estimated preparation time of 60 minutes.
In another preferred embodiment of the invention, the expected preparation time may be estimated using a document category such as whether the document is a white paper as opposed to a conceptual design document. Gradations of such an indicator may be found by, for example, examining the linguistic complexity of the document using a technique such as the well-known “Flesch index.” The Flesch index gives a numerical factor that corresponds to the reading level needed to understand the content of the document. This numerical factor may be applied to default or otherwise-computed preparation times.
In other preferred embodiments, the expected preparation time may be estimated using the identity of the document's author or first-listed author. For example, the author's name may be assigned an organizational importance level so that, for example, a document written by an executive manager may be assigned more preparation time than a document from an entry-level worker. In other situations, preparation time may be estimated using contact information associated with the author's name, so that familiar work may be assigned less preparation time than unfamiliar work. Also, preparation time maybe estimated using a revision level of the document, so that a first encounter with a document may be assigned more preparation time than a final review of a minor update.
In some embodiments of the invention, provision may be made for considering a user profile, so that, for example, a user may select a multiplier to be applied to default or otherwise-computed estimates of preparation time. According to the profile, lead time may also be considered, so that a user who likes to prepare immediately before a meeting will be accommodated to the extent possible, as may a user who prefers a long lead time for preparation before the associated meeting.
A floating block of calendar time is then created, with a length equal to the estimated preparation time, subject to the constraint that the block's ending time must occur before the time that the meeting is scheduled to convene. If both the meeting and the associated floating block can be scheduled without irresolvable conflicts, the meeting and the associated floating block of time are added to the user's calendar 110. A to-do item associated with the floating block may be added to the user's to-do list 120. When an invitation for a second meeting conflicts with a first floating block associated with a first meeting, the first floating block may be rescheduled, if possible within its completion-time constraint, to accommodate the second meeting. Blocks of preparation time may be split. For example, a one-hour block may be split into two thirty-minute blocks, the preparation time may be split according to the number of documents or the length of the documents, and so forth.
As shown in
Otherwise (i.e., the user tentatively accepts the invitation), a determination is made as to whether the new meeting conflicts with a meeting already scheduled, which is called here an old meeting (step 220). If the new meeting conflicts with an old meeting, the user is prompted to determine whether he or she would like to overwrite the old meeting with the new meeting on the calendar (step 225). If not, a notification declining the invitation may be sent (step 210), and status returns to await the arrival of another incoming meeting invitation (step 200). If the user would like for the new meeting to overwrite the old, the old meeting and any associated floating blocks of time are deleted from the calendar, and any to-do items associated with the old meeting are deleted from the to-do list (step 230).
Upon completion of step 230, or if the result of step 220 does not indicate a conflict between the new meeting and an old meeting, a determination is made as to whether the new meeting conflicts with any floating block of time already scheduled for another meeting (step 235). If there is a conflict, an attempt is made to free space for the new meeting by rescheduling the floating block that is in conflict with the new meeting, which is now called the old floating block (step 240). In one embodiment of the invention, rescheduling may be done by looking for an open time in the calendar that is consistent with the duration and due-time of the old floating block. The user may impose constraints on the rescheduling of the old floating block. For example, the user may prohibit its movement to times outside predetermined working hours.
Thus, based on the outcome of the scheduling attempt of step 240, a determination is made as to whether or not the old floating block can be moved (step 245). If the old floating block can be moved, the old floating block is moved on the user's calendar, and the to-do list is adjusted accordingly (step 250). If the determination in step 245 is that the old floating block cannot be moved, the user is queried to determine whether he or she would like to preempt the old floating block (step 255). If the user declines to preempt the old floating block, the invitation to the new meeting cannot be accepted, and a notification declining the invitation may be sent (step 210). If the user decides to preempt the old floating block, the old floating block is deleted from the user's calendar, any associated to-do item is deleted from the user's to-do list, and the meeting associated with the old floating block is deleted from the user's calendar (step 260).
After deleting the old floating block in step 260, or moving the old floating block in step 250, or if the determination in step 235 is that the new meeting does not conflict with any of the floating blocks, the expected preparation time for work associated with the new meeting is computed (step 265) as described above. A floating block and to-do item are created in association with the new meeting, which are called here the new floating block and the new to-do item. The estimated preparation time is used as the length of the new floating block.
An attempt is then made to schedule the new floating block (step 270). In one embodiment of the invention, scheduling is done by looking for an open time in the calendar that is consistent with the due-time and length of the new floating block. Again, the user may put constraints on the scheduling process, prohibiting, for example, scheduling the new floating block outside normal working hours.
Based on the outcome of the scheduling attempt, a determination is made as to whether the new floating block can be scheduled (step 275). If the new floating block can be scheduled, the new meeting and the new floating block are added to the calendar, and a new to-do item associated with the new floating block is added to the to-do list (step 280). Status then returns to await the arrival of another meeting invitation (step 200). If the new floating block cannot be scheduled, neither the new meeting nor the associated to-do item can be accepted. In this case, a determination is made as to whether an old meeting and associated old floating block or to-do item were deleted in step 230 or step 260, or an old floating block moved in step 250 (step 285). If so, the old meeting, floating block, or to-do item is restored (step 290), and a notification declining the invitation may be sent (step 210). Otherwise (i.e., nothing has been deleted or moved), nothing needs to be restored; a notification declining the invitation may be sent (step 210).
A preferred embodiment of the invention has been described. This embodiment is illustrative of the invention, however, rather than limiting. For example, the use of simple scheduling algorithms have been described with reference to step 240 and step 270. These algorithms have the advantage of simplicity and low complexity, in that they do not move more than one old floating block when attempting to schedule a new floating block. However, the scope of the invention encompasses all scheduling algorithms, not just the simple exemplary algorithms described above. Such algorithms may be, for example, single-capacity bin-packing algorithms that move a plurality of floating blocks in an attempt to schedule efficiently. Numerous examples of such algorithms are known to those skilled in the arts of computer science and operations research.
Although the foregoing has described methods, apparatus, and computer program products for enhancing personal productivity, the description is illustrative of the invention rather than limiting, and the invention is limited only by the claims that follow.
Attention is called to commonly assigned U.S. patent application Ser. No. 10/845,964, “Accommodating preparatory work for electronically scheduled meetings,” which is now pending.
