A neuro-tabu search algorithm for the job shop problem

Authors:
Wojciech Bożejko;Mariusz Uchroński
Affiliations:
Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland;Institute of Computer Engineering, Control and Robotics, Wrocław University of Technology, Wrocław, Poland
Venue:
ICAISC'10 Proceedings of the 10th international conference on Artifical intelligence and soft computing: Part II
Year:
2010

Citing 4
Cited 1

A fast taboo search algorithm for the job shop problem

Management Science
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling

Management Science
Tabu Search

Tabu Search
A neuro-tabu search heuristic for the flow shop scheduling problem

Computers and Operations Research

On single-walk parallelization of the job shop problem solving algorithms

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

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.