In the work there is a NP-hard cyclic job shop problem of tasks scheduling considered. To its solution there was tabu search algorithm implemented using neural mechanism to prevent looping of the algorithm. There were computational experiments conducted that showed statistically significant efficacy of the proposed tabu method as compared to classical list of forbidden moves.
CITATION STYLE
Bożejko, W., Gnatowski, A., Niżyński, T., & Wodecki, M. (2016). Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9693, pp. 409–418). Springer Verlag. https://doi.org/10.1007/978-3-319-39384-1_35
Mendeley helps you to discover research relevant for your work.