Abstract: It is believed that agile manufacturing is the 21st century manufacturing enterprise strategy and it should be realized by agile virtual enterprise (AVE) which is dynamically reconfigured for the manufacturing of one or more products.It creates a significant challenge for the resource selection in reconfiguring an AVE.In this paper,an integer programming (IP) formulation is presented for the resource selection problems to minimize the cost.The IP formulation is then transformed into a graph theoretical formulation by taking the advantage of the precedence relationship between the tasks.Based on the graph theoretical formulation,an efficient algorithm is proposed to seed for the optimal solutions of the problems.It is shown that the algorithm is polynomial bounded.