The sequencing problem for variable length tasks in multiprocessors

The author studies the problem involved in information gathering which has its value in real life, and this problem is theoretically treated as sequencing n independent tasks in m unrelated multiprocessors, where each task might have a different release time and variable processing time (lengths) on different processors. This problem is proved to be NP-hard in a strong sense. In addition, this problem can be transformed to the maximum matching problem in some special cases, and then it is solvable in polynomial time.