Abstract
Job Shop Scheduling Problem (JSSP) is one of the well-known hardest combinatorial optimization problems. The goal of this research is to study an efficient scheduling method based on Genetic Algorithm (GA) to address JSSP. A GA based on Giffler and Thompson (GT) algorithm known as GT-GA that utilizes the GT crossover is investigated. This algorithm is modified to produce better results than the existing algorithm by using Visual Prolog programming language. Keywords: Job Shop Scheduling Problem; Genetic Algorithms; GT-GA.
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.
