Loading...

A guided tabu search/path relinking algorithm for the job shop problem

Nasiri, M. M ; Sharif University of Technology | 2012

879 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s00170-011-3441-0
  3. Publisher: 2012
  4. Abstract:
  5. The job shop scheduling problem with makespan criterion is valuable from both practical and theoretical points of view. This problem has been attacked by most of the well-known meta-heuristic algorithms. Among them, tabu search has emerged as the most effective approach. The proposed algorithm takes advantages of both N1 and N6 neighborhoods. N1 neighborhood is used as a path relinking procedure while N6 neighborhood with its guideposts is applied in a tabu search framework. In addition, a method is presented for updating the topological order, heads and tails in N6 neighborhood. The algorithm is tested on standard benchmark sets, outperformed all previous approaches (include i-TSAB) and found six new upper bounds among the unsolved problems. Furthermore, we have tried to collect the newest upper bounds for the other problems
  6. Keywords:
  7. Scheduling ; Tabu search ; Job shop ; Job shop problem ; Job shop scheduling problems ; Makespan criterion ; Meta heuristic algorithm ; Neighborhood ; Path relinking ; Relinking algorithms ; Theoretical points ; Topological order ; Unsolved problems ; Upper Bound ; Heuristic algorithms ; Scheduling algorithms
  8. Source: International Journal of Advanced Manufacturing Technology ; Volume 58, Issue 9-12 , February , 2012 , Pages 1105-1113 ; 02683768 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs00170-011-3441-0