Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Tabu Search/Path Relinking Algorithm to Solve the Job Shop Scheduling
  Problem   We present an algorithm that incorporates a tabu search procedure into the
framework of path relinking to tackle the job shop scheduling problem (JSP).
This tabu search/path relinking (TS/PR) algorithm comprises several
distinguishing features, such as a specific relinking procedure and a reference
solution determination method. To test the performance of TS/PR, we apply it to
tackle almost all of the benchmark JSP instances available in the literature.
The test results show that TS/PR obtains competitive results compared with
state-of-the-art algorithms for JSP in the literature, demonstrating its
efficacy in terms of both solution quality and computational efficiency. In
particular, TS/PR is able to improve the upper bounds for 49 out of the 205
tested instances and it solves a challenging instance that has remained
unsolved for over 20 years.

3
The categories of this paper are: physics
21
The categories of this paper are: adap-org
9
The categories of this paper are: nlin
12
The categories of this paper are: nucl-th
28
The categories of this paper are: alg-geom
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
33
The categories of this paper are: plasm-ph
31
The categories of this paper are: ao-sci
2
The categories of this paper are: math
19
The categories of this paper are: eess
23
The categories of this paper are: solv-int
27
The categories of this paper are: comp-gas
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex