Abstract
Job shop scheduling problems are one of the challenging combinatorial problems that have drawn the attention of researchers for the last three decades. It is observed that genetic algorithm (GA) is gaining more importance over the past several years. An attempt has been made through GA to solve job shop scheduling problems with job-based, operation-based, and proposed methods of representation and schedule deduction with the make-span objective. Computational experiments of this attempt have yielded better solutions coupled with appreciable reduction in computer processing time. A set of selected benchmark problems have been used with the proposed heuristic for validation and the results show the better performance of the proposed method of representation of jobs and schedule deduction.
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 callMore From: The International Journal of Advanced Manufacturing Technology
Disclaimer: 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.
