A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [An article from: Computers and Operations Research]

Review for A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [An article from: Computers and Operations Research] customer Reviews, Overview, Features and Description
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [An article from: Computers and Operations Research]

List Price: ~~$7.95~~
Offer Price: Click for See Price

A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [An article from: Computers and Operations Research] Product Description
This digital document is a journal article from Computers and Operations Research, published by Elsevier in 2007. The article is delivered in HTML format and is available in your Amazon.com Media Library immediately after purchase. You can view it with any web browser.

Description:
Tabu search (TS) algorithms are among the most effective approaches for solving the job shop scheduling problem (JSP) which is one of the most difficult NP-complete problems. However, neighborhood structures and move evaluation strategies play the central role in the effectiveness and efficiency of the tabu search for the JSP. In this paper, a new enhanced neighborhood structure is proposed and applied to solving the job shop scheduling problem by TS approach. Using this new neighborhood structure combined with the appropriate move evaluation strategy and parameters, we tested the TS approach on a set of standard benchmark instances and found a large number of better upper bounds among the unsolved instances. The computational results show that for the rectangular problem our approach dominates all others in terms of both solution quality and performance.

Special Offer at Amazon Click for See Price Now!
A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem [An article from: Computers and Operations Research]