Abstract
A genetic algorithm is applied to an optimal scheduling problem for a large-scale complex manufacturing system. The system is operated basically in a job shop mode with several constraints. Each job is subject to precedence constraints among jobs. Each operation has freedom of selecting a processing machine from different kinds of parallel machines. In the design of genetic algorithm two kinds of individual description and several genetic operators are proposed to satisfy the constraints. In order to examine the effectiveness of the algorithm, a simulation is carried out on the basis of real operation data of a metal mold assembly process.
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.
