arc start
3.For the problem of assignment tasks with the objective of minimizing the makespan (the total elapsed time from the start of execution until all tasks arc completed), an effective algorithm is discussed in this paper,and this algorithm is the same as the Hungarian method for the assignment problem.

