Abstract
Manufacturing scheduling is one of the most important and complex combinatorial optimization problems, where it can have a major impact on the productivity of a production process. Moreover, most of manufacturing scheduling problems fall into the class of NP-hard combinatorial problems. In this paper, we introduce how to design hybrid genetic algorithms (HGA) and multiobjective hybrid genetic algorithms (Mo-HGA) for solving practical manufacturing scheduling problems for the hard disc device (HDD) and the thin-film transistor-liquid crystal display (TFT-LCD) manufacturing systems, respectively. In particularly, evolutionary representations and the fitness assignment mechanism as well as the hybrid genetic operations are introduced. Through a variety of computational experiments, the effectiveness of these HGA algorithm for HDD and Mo-HGA algorithm for TFT-LCD module assembly as the practical manufacturing scheduling problems are demonstrated. This paper introduces how to design Mo-HGAs for solving the practical multiobjective manufacturing scheduling problems expanded by a multiobjective flexible job-shop scheduling problem (Mo-FJSP; operation sequencing and resources assignment).
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.
