A fast hybrid tabu search algorithm for the no-wait job shop problem

Solving the no-wait job-shop problem by using genetic algorithm with automatic adjustment

“…A more thorough analysis, examples and numerical tests proving the above-mentioned conclusions are presented in the work of Bożejko and Makuchowski [1]. They propose an additional application of not only the loading procedure but also its symmetrical equivalent which improves the effectiveness of an algorithm.…”

“…Schuster [11] described a tabu search algorithm and considered complexity of subproblems of the no-wait job shop. Bożejko and Makuchowski [1] proposed an efficient hybrid tabu search algorithm for the considered problem.…”

“…Numerical tests of the proposed HGA algorithm consist of generated solutions quality and working time comparison with other algorithms (GASA [12], TS [11]) taken from the literature. For each instance, a relative deviation of a scheduled length to a reference solution taken from Bożejko and Makuchowski [1] was calculated:…”

Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach

“…In Table 2a, we report the results from our model on the instances used in that paper, where instances are grouped based on type (car (4 instances) / la (3 instances)) and maximum time lag (0.5 / 1 / 2). For the no-wait job shop problem, we first present our results in terms of each solver's average percentage relative deviation (PRD) from the reference values given in [6] per problem set in Table 2b. The PRD is given by the following formula:…”

“…For the no-wait job shop problem, the best methods are a tabu search method by Schuster (TS [25]), another metaheuristic introduced by Framinian and Schuster (CLM [10]) and a hybrid constructive/tabu search algorithm introduced by Bozėjko and Makuchowski in 2009 (HTS [6]). We report the best results of each paper.…”