A Tabu-Genetic Hybrid Search Algorithm for Job-shop Scheduling Problem

To deal with the job-shop scheduling problem (JSP), a tabu-genetic hybrid search algorithm is proposed. The algorithm generates several initial solutions distributed in the whole solution space for tabu search by genetic algorithm, which avoids the over-dependence on the initial solution of tabu sea...

Full description

Bibliographic Details
Main Authors: Ge Yan, Wang Aimin, Zhao Zijin, Ye Jieran
Format: Article
Language:English
Published: EDP Sciences 2019-01-01
Series:E3S Web of Conferences
Online Access:https://www.e3s-conferences.org/articles/e3sconf/pdf/2019/21/e3sconf_icpeme2018_04007.pdf