Collaborative Design Task Decomposition And Task Scheduling Method

Computer supported collaborative design (CSCD) is a web-based technology which can provide a working environment. In this environment, experts who are in different places can work together to complete a product's design task. Using this technology, enterprises can shorten their products' design cycles and enhance the market competitiveness of their products. However, to achieve this purpose, we should pay more attention to the problem of task decomposition and scheduling. Because this problem is an important precondition for CSCD. If we can solve this problem effectively, the whole process of collaborative design will be smoothly. So, carrying out the research of the method of task decomposition and task scheduling about CSCD is of great significance.Firstly, the basic concepts of the CSCD's task decomposition and scheduling was introduced in this paper. Secondly, it's current research situation was reviewed. Many used means and methods of it are summarized. In the end, based on these foundations, planning model of the task was given in this paper.To describe the coming out complicated relationships after the task decomposition, sub-task model was established using fuzzy design structure matrix (DSM). Then decomposition algorithm and separated algorithm were introduced in this paper. By analyzing coupling degree between the sub-tasks in the coupled task set, a new decoupling strategy was proposed. Finally, related examples were put to demonstrate the effectiveness of the proposed algorithm.To solve subtask scheduling problem with the nature of discreteness and Non-Deterministic, a particle swarm algorithm was proposed by designing a dual coding method. Firstly, pre-constraint was used to produce particle population. Then, a search strategy based on harmony algorithm was brought into particle swarm algorithm to avoid its defect of easily plunging into the local optimum. Finally, simulation results of the classical cases and comparison to other algorithms demonstrated the effectiveness of this algorithm.