摘要
Cross-enterprise project is the main implementation form in multi enterprises collaborative production environment. Minimizing the risk of failure and tardiness caused by the uncertainty of partner’s resources in partner selection is the key problem to ensure success in Cross-enterprise project. In this paper, considering the factors and constraints of sub-project processing times, precedence of sub-project and project due date, especially the resource confidence, a 0-1 integer programming model was presented with the objective to minimize the risk of failure and the tardiness of the project. A project scheduling algorithm was designed to search and evaluate selection solutions, and the project scheduling algorithm was embedded into a Tabu search algorithm to solve the model. Simulation experiments and comparisons with other algorithms showed that the proposed approach was possible to find the optimal solution with a faster speed and higher probability.
Cross-enterprise project is the main implementation form in multi enterprises collaborative production environment. Minimizing the risk of failure and tardiness caused by the uncertainty of partner’s resources in partner selection is the key problem to ensure success in Cross-enterprise project. In this paper, considering the factors and constraints of sub-project processing times, precedence of sub-project and project due date, especially the resource confidence, a 0-1 integer programming model was presented with the objective to minimize the risk of failure and the tardiness of the project. A project scheduling algorithm was designed to search and evaluate selection solutions, and the project scheduling algorithm was embedded into a Tabu search algorithm to solve the model. Simulation experiments and comparisons with other algorithms showed that the proposed approach was possible to find the optimal solution with a faster speed and higher probability.
