Collaborative Manufacturing Unit Selection Using a Sorting Adaptive Genetic Algorithm in Networked Environment

Abstract:

Article Preview

In order to solve the collaborative manufacturing unit (CMU) selection problem in the networked cooperative manufacturing environment, a sorting adaptive genetic algorithm is proposed. To obtain the optimal executive manufacturing process, the objective function is constructed considering manufacturing cost and product load rate of candidate CMUs under time-sequence constraint. The embedded subtask scheduling procedure in sorting adaptive genetic algorithm is used to ascertain the penalty cost for the tardiness of the task. Finally, a case study is implemented to verify the feasibility of the proposed approach. The results show that the proposed model and algorithm can obtain satisfactory solutions.

Info:

Periodical:

Key Engineering Materials (Volumes 407-408)

Edited by:

Fan Rui, Qiao Lihong, Chen Huawei, Ochi Akio, Usuki Hiroshi and Sekiya Katsuhiko

Pages:

230-233

DOI:

10.4028/www.scientific.net/KEM.407-408.230

Citation:

F. Q. Cheng and F. F. Ye, "Collaborative Manufacturing Unit Selection Using a Sorting Adaptive Genetic Algorithm in Networked Environment", Key Engineering Materials, Vols. 407-408, pp. 230-233, 2009

Online since:

February 2009

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.