|Table of Contents|

A Tabu Search Algorithm of Double Tabu List for Job Shop Scheduling Problem(PDF)

《哈尔滨理工大学学报》[ISSN:1007-2683/CN:23-1404/N]

Issue:
2016年06期
Page:
50-54
Research Field:
计算机与控制工程
Publishing date:

Info

Title:
A Tabu Search Algorithm of Double Tabu List for Job Shop Scheduling Problem
Author(s):
    LIU Sheng-huiLI Xiao-yangZHANG Shu-li
    (School of Computer Science and Technology, Harbin University of Science and Technology, Harbin 150080, China)
Keywords:
Job-Shop scheduling heuristics tabu search tabu list neighborhood 
PACS:
TP301
DOI:
10.15938/j.jhust.2016.06.010
Abstract:
According to the characteristics of the job scheduling problem,in order to solve the problem that the traditional tabu search algorithm is easy to fall into local optimal solution,we have proposed an improved tabu search algorithm for solving job shop scheduling problems—a tabu search algorithm based on double tabu list algorithm.This algorithm avoids the phenomenon of the cycle by establishing the double tabu list when searching the optimal solution.By comparing the algorithm with TSAB algorithm,the algorithm has a strong ability of searching for the best solution.

References:

-

Memo

Memo:
-
Last Update: 2017-02-28