In this paper, we study a muti resource time flexible task assignment problem. In this problem, a set of task need to be served by multiple resources within a given time window. The difficulty of this problem is to determine the start and end service time for different resources simultaneously. This problem can be viewed as a generalization of traditional task assignment problem. We propose a duplication based formulation and a column-and -row generation method to solve the model. We also extend this problem with travel time, and propose a sequence base model to solve the problem efficiently. The computational results show that the proposed model provide satisfied result within a limited time.