One of the problems faced by persons involved in research is that they are usually involved in mental tasks which require multiple sittings. It is usually not possible and sit down and keep on thinking till you find a solution. One need to find a way to manage all the task which one does. The objective should be to finish the task as soon as possible once it is taken up. It is not better to take up a task and leave it halfway, instead do'nt take up a task.
We can manage it using two task lists. First task list is where all the pending tasks are just listed. Let call it P list. We can also maintain another task list S. All the task which are part of list S should be done or attempted to be done one by one in cyclic fashion. This means all the tasks will progress steadily if they are in list S. Ideally, if all the tasks in list S are attempted in a day, we can move some important task from list P to S. If all tasks are not attempted in a day, we simply keep on attempting the tasks in cyclic fashion from list S. This usually will try to keep size of the list S, such that one attempts all the tasks in list S at least once a day. This regular attempt on problem, will help in gaining insight or identifying subproblems, issues which need to be resolved. Sometimes, when a problem has been attempted for multiple times, our subconsious part of the mind start working on the problem and solution is seen as flash of insight.
Some minor modifications can be made to this above task management algorithms. In the queue S, if you do'nt have resources for attempting the task, you can just move ahead to the next task and when in next cycle the turn of the jumped task comes, you make an attempt. If some task is has be given a higher priority, it can be listed multiple times in the S list.
--------/ ---------/
<-------->
Length of S
We can manage it using two task lists. First task list is where all the pending tasks are just listed. Let call it P list. We can also maintain another task list S. All the task which are part of list S should be done or attempted to be done one by one in cyclic fashion. This means all the tasks will progress steadily if they are in list S. Ideally, if all the tasks in list S are attempted in a day, we can move some important task from list P to S. If all tasks are not attempted in a day, we simply keep on attempting the tasks in cyclic fashion from list S. This usually will try to keep size of the list S, such that one attempts all the tasks in list S at least once a day. This regular attempt on problem, will help in gaining insight or identifying subproblems, issues which need to be resolved. Sometimes, when a problem has been attempted for multiple times, our subconsious part of the mind start working on the problem and solution is seen as flash of insight.
Some minor modifications can be made to this above task management algorithms. In the queue S, if you do'nt have resources for attempting the task, you can just move ahead to the next task and when in next cycle the turn of the jumped task comes, you make an attempt. If some task is has be given a higher priority, it can be listed multiple times in the S list.
/-----------------\
| ---------\ |
--------\ \--> | |
P |---------> S | ---/---->--------/ ---------/
<-------->
Length of S