A Genetic Algorithm for Task Scheduling Based on User Overall Satisfaction

Xiaoguang Wang · 2012

In traditional research on task scheduling algorithms based on user satisfaction, all users can only have the same satisfaction function that means system assumes all users have the same scheduling motivation. But in real distributed system, different users usually have different motivations. To solve this problem, in this paper, we propose a genetic scheduling algorithm based on user overall satisfaction, which is the sum of the value of every user satisfaction. This algorithm supports different satisfaction functions for different users, which meets the requirements of real distributed environment well.

Read the paper · More papers on PaperTik