A Task Selecting Algorithm For Personal Schedules In Workflow Systems

In personal schedules for workflow systems, a participant may be assigned a lot of tasks in a work cycle or work period. However, the cycle may not be long enough such that all the assigned tasks can be scheduled within it, i.e. there does not exist a task sequence containing all the tasks so that any two tasks do not overlap and the makespan does not exceed the work cycle. So we can filter out some tasks to make up a task subsequence based on certain strategy. The participant executes these selected tasks in the work cycle and achieves the best working efficiency. The strategy can be either maximum task amount completed in the cycle or maximum working time during the period. This paper proposes an algorithm solving this problem with experimental result showing good performance.