Abstract
Job Shop Scheduling Problem (JSSP) is an optimization problem in which ideal jobs are assigned to resources at particular times. In recent years many attempts have been made at the solution of JSSP using a various range of tools and techniques such as Branch and Bound and Heuristics algorithms. This paper proposed a new algorithm based on Genetic Algorithm (GA), Tabu Search (TS) and Simulated Annealing (SA) algorithms to solve JSSP. The proposed algorithm is mainly based on the genetic algorithm. The reproduction phase of the genetic algorithm uses the tabu search to generate new population. Simulated annealing algorithm is used to speed up the genetic algorithm to get the solution by applying the simulated annealing test for all the population members. The proposed algorithm used many small but important features such as chromosome representation, effective genetic operators, and restricted neighbourhood strategies. The above features are used in the hybrid algorithm to solve several bench mark problems.
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.
