Browse Prior Art Database

A system for personal schedule recommandation

IP.com Disclosure Number: IPCOM000200452D
Publication Date: 2010-Oct-14
Document File: 7 page(s) / 108K

Publishing Venue

The IP.com Prior Art Database

Abstract

Disclosed is a novel schedule system which automatically recommends personal schedule by comprehensively considering the tasks’ attributes, personal preferences, etc. The system identifies user preferences and several task's attributes, then analyses the schedule history to enrich the raw data, and finally ranks and schedules tasks. The system can significantly improve the efficiency of scheduling tasks, and meanwhile, make the schedule more intelligent and reasonable.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 30% of the total text.

Page 01 of 7

A system for personal schedule recommandation

1. Introduction

In current fast-tempo society, everyone has several tasks to handle at a period of time. People always schedule the tasks by themselves,

which is time-consuming,

                         as people need to consider lots of different factors comprehensively, e.g., the priority of the task, the workload of the task, and the time period they prefer to have a rest, etc.

There are already several tools that can help people schedule their tasks, e.g., the calendar and TODO list, however, by using these existing tools, people still need to arrange their tasks manually.

This disclosure proposes a novel schedule system toautomatically recommend personal schedule by comprehensively considering the tasks' attributes, personal preferences, etc. The system can significantly improve the efficiency of scheduling tasks, and meanwhile, make the schedule more intelligent and reasonable.

Reference 1 and reference 2 are two related solutions for scheduling tasks, however, they do not resolve our proposed problem.

Reference 1 emphasizes how to assign a group of people to tasks, however, it considers all the tasks equally and does not differentiate tasks by their attributes, e.g., the priority, the sizing, and the deadline,

while, one

                                                            key point of our disclosure is how to rank tasks by their attributes. Table 1 shows the output of reference 1, in which all the tasks are arranged simultaneously and the importance and urgency is not considered. Table 5 shows the output of our system, in which the tasks are ranked and scheduled based on the input in Table 3.

Reference 2 focuses on how to display task schedule information; however, the schedule process is executed manually. Table 2 shows the task input of reference 2, in which people need to indicate the start time and end time for each task by themselves,

which are automatically scheduled by our disclosure

Task 1 Task 2 Task 3 … Task Y

Time Period 1 Worker 1 Worker 2 Worker 3 Worker X Time Period 2 Worker 9 Worker 3 Worker 4 Worker 5 Time Period 3 Worker 7 Worker 1 Worker X Worker 6

.

1


Page 02 of 7

 Time Period 4 Worker 3 Worker X Worker 5 Worker 7 Table 1. reference 1

Task ID

Visible Task

Task Type

Start

Time

End Time

1 Y Regular 8:00/M 5:00/M
2 Y Regular 1:00/T 5:00/W
3 Y Priority 8:00/F 5:00/F … … … … … Table 2. reference 2

Task ID Priority Importance Deadline Sizing 1

1

1

10:00/2010/07/2 6

4h

2

2

2

16:00/2010/07/2 6

1h

3

2

1

13:00/2010/07/2 8

12h

… … … … …

Table 3. Task input

Routine Time Period Lunch 12:00-13:00 Nap 13:00-14:00 Personal Time 16:00-8:00 Table 4. Personal preference input

Mon (07/26)

Tue (07/27)

Wed (07/28 )

Thu (07/29)

Fri (07/30)

2


Page 03 of 7

8:00-9:00

Task 1

Task 5

Task 3

Task 5

Task 9

9:00-10:00

Task 6

10:00-11:00

Task 3

Task 6

11:00-12:00

12:00-13:00 13:00-14:00 14:00-15:00 Task 2

Task 5

Task 3

Task 9

Task 7

Task 9

Table 5. The output of schedule

To solve the proposed problem, the system firstly identifies...