A tabu search/path relinking algorithm to solve the job shop scheduling problem

Abstract

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.

Solving Variants of the Job Shop Scheduling Problem Through Conflict-Directed Search

“…The current best metaheuristic method is a tabu search with path-relinking recently proposed by Peng et al (2014), which improved the best-known solutions on 49 of 205 well-known instances studied. The SGMPCS approach of Beck (2007), discussed earlier in Section 3.1.3, has shown best performance of systematic methods proposed to date.…”

A new hybrid island model genetic algorithm for job shop scheduling problem

“…Table 6 shows the number of instances solved (NIS), the BS-ARD and AvS-ARD values for HIMGA and the other algorithms (OA), and the improvement achieved by HIMGA with respect to each of the other algorithms. From Table 6, it can be seen that HIMGA yields -1229 ------TA01 15 Â 15 1231 1231 -------1314 --TA11 20 Â 15 1357 1366 -------1442 --TA21 20 Â 20 1642 1650 -------1675 --YN1 20 Â 20 884 893 -909 ------911 -YN2 20 Â 20 904 913 --------941 -YN3 20 Â 20 892 900 --------928 -YN4 20 Â 20 968 977 --------1011 -SWV11 50 Â 10 2983 3095 -3206 -------- improvements with respect to all compared algorithms, except TS/PR (Peng et al, 2015) and HEA (Cheng et al, 2013), which validates the effectiveness of the proposed algorithm HIMGA.…”

“…-Tabu with path relinking TS/PR (Peng et al, 2015). Hybrid IMGA based on asynchronous colony GA (ACGA) and autonomous immigration GA (AIGA) HPGA (Yusof et al, 2011).…”

Multi-start iterated tabu search for the minimum weight vertex cover problem

“…Tabu search enhances the performance of this technique by using memory structures that describe the visited solutions or user-provided sets of rules. This heuristic algorithm has been successfully applied to many classical problems such as circle packing problem Huang et al 2013), job shop scheduling Problem (Peng et al 2015), course timetabling problem (Lü and Hao 2010), traveling salesman problem (Malek et al 1989), complex network community detection (Lü and Huang 2009), and so on.…”