In large construction projects, optimal confidence in partner selection is the key problem in order to ensure success of the project. Considering on the processing time of the sub-project and timing constrains between each other, we established the 0–1 integer programming model in order to implement the project within the optimal confidence and the optimize possibility of delays. For the dynamic redistribution of the candidate partners'' confidence level in different time slots, refer to the solving idea of “limit fixed time - resource leveling” scheduling problem, project scheduling algorithm is designed to evaluate the fitness of the feasible solution, and embed the project scheduling algorithm into tabu search algorithm on order to solve the model.
展开▼
