On the optimization of multitasking process with multiplayer

In society, many problems can be understood as multitasking process with multiplayer (MPM). Choosing different strategies or different orders in processing tasks, an individual will spend a different amount of time to complete all the tasks. Therefore, a good strategy or a good order can help an individual work more efficiently. In this paper, we propose a model to study the optimization problems of MPM. The average time spent for all the tasks by an individual is calculated in each strategy, and we find the random choice strategy can make an individual spend less time in completing all tasks. The correlation coefficient between the order of each task processed by an individual and the corresponding time spent for all the tasks by the individual is also calculated. Then the internal statistics law between the order and the corresponding time is found and explains why the random choice strategy is better. Finally, we research the change of the queue length in each task with the time. These results have certain significance on theory and practical application on MPM.