Tabu search algorithm with neural tabu mechanism for the cyclic job shop problem

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free