Y. Changfeng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Y. Changfeng has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
B. Kun
The Key Laboratory of Contemporary Design and Integrated Manufacturing Technology , Ministry of Education , Northwestern Polytechnical University , Box 552, Xi’an, Shaanxi 710072, People's Republic of China
1 shared publicationP. Wenli
The Key Laboratory of Contemporary Design and Integrated Manufacturing Technology , Ministry of Education , Northwestern Polytechnical University , Box 552, Xi’an, Shaanxi 710072, People's Republic of China
1 shared publicationZ. Dinghua
The Key Laboratory of Contemporary Design and Integrated Manufacturing Technology , Ministry of Education , Northwestern Polytechnical University , Box 552, Xi’an, Shaanxi 710072, People's Republic of China
1 shared publication
Latest Publications
- 15 August 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (16) , 3279-3301
Research on resources optimisation deployment model and algorithm for collaborative manufacturing process
Agility is the competitive advantage in the global manufacturing environment. It is believed that agility can be realised by networked manufacturing resource optimisation deployment. However, this is a challenge to us now. To solve this question, logical manufacturing unit and logical manufacturing process are proposed to decompose and model the networked manufacturing task, and networked manufacturing resources are organised and modelled based on physical manufacturing unit. During the deployment of manufacturing resources to the task, many factors should be taken into consideration. Of these, manufacturing cost, time and quality are the most important factors. In this paper, before these factors are considered, networked manufacturing resources pre-deployment is carried out to find the candidate manufacturing resources on the basis of manufacturing abilities. Then, resources optimisation deployment is modelled as a multi-objectives optimisation. This optimisation problem is solved based on genetic algorithm after transforming the multi-objectives optimisation problem to a single objectives optimisation problem. Although we may not find the optimal solution for the problem by genetic algorithm, the better and feasible solution is produced. Thus, this algorithm is efficient and can be applicable to practical problem. At last, an illustrative example is presented to show the application of the proposed algorithm.
- 15 August 2006
- Published by Taylor & Francis in International Journal of Production Research
- Vol. 44 (16) , 3279-3301
Research on resources optimisation deployment model and algorithm for collaborative manufacturing process
Agility is the competitive advantage in the global manufacturing environment. It is believed that agility can be realised by networked manufacturing resource optimisation deployment. However, this is a challenge to us now. To solve this question, logical manufacturing unit and logical manufacturing process are proposed to decompose and model the networked manufacturing task, and networked manufacturing resources are organised and modelled based on physical manufacturing unit. During the deployment of manufacturing resources to the task, many factors should be taken into consideration. Of these, manufacturing cost, time and quality are the most important factors. In this paper, before these factors are considered, networked manufacturing resources pre-deployment is carried out to find the candidate manufacturing resources on the basis of manufacturing abilities. Then, resources optimisation deployment is modelled as a multi-objectives optimisation. This optimisation problem is solved based on genetic algorithm after transforming the multi-objectives optimisation problem to a single objectives optimisation problem. Although we may not find the optimal solution for the problem by genetic algorithm, the better and feasible solution is produced. Thus, this algorithm is efficient and can be applicable to practical problem. At last, an illustrative example is presented to show the application of the proposed algorithm.