Abstract
This paper deals with tabu search with neural network instead of classic tabu list applied for solving the classic job shop scheduling problem with makespan criterion. Computational experiments are given and compared with the results yielded by the best algorithms discussed in the literature. These results show that the proposed algorithm solves the job shop instances with high accuracy in a very short time. Presented ideas can be applied for many scheduling problems. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Bozejko, W., & Uchroński, M. (2010). A neuro-tabu search algorithm for the job shop problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6114 LNAI, pp. 387–394). https://doi.org/10.1007/978-3-642-13232-2_47
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
