1.

Task Execution Overview

Tri-state cyclic task execution - Execution of tasks in a of a certain type using a rotation
between three subtasks related to the parent task. The rotation period (s
T
) for each
subtask must be determined empirically.

Task Subtask Period (s
T
)*
Montonous (M)** 10 min
Development (D) 30 min
Learning (L) 30 min
Reflection (R) 30 min
*Needs to be optimized empirically
**May consider exercise after total task period is completed.

Task Subtask(s)
Montonous (M) Filing, processing emails, documents, GRE vocab, etc
Development (D) Specific Dev task process:
1. Understand via Design (prob statement)
2. Test Algorithm w/Test case
3. Implement Algorithm
4. Back to 1

Possible Dev tasks:
Program C++ / Java / ...
Embedded Mobile
FPGA
Learning (L) Patent Search
Idea Search
Read Articles
Study Text book / new material
Do problems
Reflection (R) Write up documentation: diagrams, test cases, white papers, etc
Update task manager

2. Day classification

Let n define the number of iterations for a specific task's repetition in a given day. Each
task can be assigned a unique n value that corresponds to the number of times it is
executed in a day. Effectively creating a type of day (D).

Let n
m
, n
d
, n
l
, n
r
define the rotation period (r
T
) of a given task, the time it takes to
complete one cycle of a given subtask (ie 3*s
T
)

Let i
n
{ n
m
, n
d
, n
l
, n
r
} | all i
n
define a type of day that can focus on a particular type of
goal as indicated by the specfic n values.

The Day Type Definition table will be constructed empirically, and is shown below;

Day Type n
m
n
d
n
l
n
r

1 16 4 2 4
Table 1 - Day Type Definition

3. Task sequencing

In a given day tasks must be alternated from one type to another to maximize efficiency.
The empirical testing results of task sequencing will be recorded in the following table.

Day Type n
m
n
d
n
r
[2] n
l

1 4 1 1 1

Table 2 - Task Sequencing