Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
