Abstract

In this paper the tabu search technique is considered for solving job shop scheduling problems. The performance measure considered is makespan time. The adjacent pairwise interchange method is used to generate neighbourhoods. The results of tabu search are compared with simulated annealing and genetic algorithms. It is concluded that the performance of tabu search is comparable to that of genetic algorithm and simulated annealing. The future research directions are also discussed.

Full Text
Paper version not known

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 call

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.