Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem-Reference-Cited by-同舟云学术

Parallel Neuro-Tabu Search Algorithm for the Job Shop Scheduling Problem

Published:2013 Issue: Volume: Page:489-499
ISSN:0302-9743
Container-title:Artificial Intelligence and Soft Computing
language:
Short-container-title:

Author:

Bożejko Wojciech,Uchroński Mariusz,Wodecki Mieczysław

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-38610-7_45

Reference34 articles.

1. Alba, E.: Parallel Metaheuristics. A New Class of Algorithms. Wiley & Sons Inc. (2005)

2. Armentano, V.A., Scrich, C.R.: Tabu search for minimizing total tardiness in a job shop. International Journal of Production Economics 63(2), 131–140 (2000)

3. Bożejko, W.: A new class of parallel scheduling algorithms, pp. 1–280. Wroclaw University of Technology Publishing House (2010)

4. Bożejko, W.: On single-walk parallelization of the job shop problem solving algorithms. Computers & Operations Research 39, 2258–2264 (2012)

5. Bożejko, W., Uchroński: Distributed Tabu Search Algorithm for the Job Shop Problem. In: Proceedings of the 14th International Asia Pacific Conference on Computer Aided System Theory 6th to 8th Sydney, Australia, February 6-8 (2012)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Neuro-tabu search approach to scheduling in automotive manufacturing;Neurocomputing;2021-09

2. Local Search Metaheuristics with Reduced Searching Diameter;Computer Aided Systems Theory – EUROCAST 2017;2018

3. The k-opt algorithm analysis. The flexible job shop case;Advances in Intelligent Systems and Computing;2017

4. Tabu Search Algorithm with Neural Tabu Mechanism for the Cyclic Job Shop Problem;Artificial Intelligence and Soft Computing;2016