Abstract
We propose two parallel algorithms based on neuro-tabu search method, designed to solve the jobs shop problem of scheduling. The fist algorithm is based on independent runs of the neuro-tabu with different starting points. The second one uses sophisticated diversification method based on path-relinking methodology applied to the set of elite solutions. Proposed approaches are especially effective for the instances of large size. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Bozejko, W., Uchroński, M., & Wodecki, M. (2013). Parallel neuro-tabu search algorithm for the job shop scheduling problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7895 LNAI, pp. 489–499). https://doi.org/10.1007/978-3-642-38610-7_45
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
