Abstract: 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 its different release time and variable processing time (lengths) on any different unrelated processor at per starting time unit.This problem is proved to be NP hard in a strong sense.In addition,this problem can be transmitted to the maximum matching problem in some special case,and then it is solvable in polynomial time.