J.W. Barnes and J.B. Chambers. Solving the job shop scheduling problem with tabu search. IIE Transactions, 27:257--263, 1995. 26 Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Problem Difficulty for Tabu Search in Job-Shop Scheduling - Watson, Beck, Howe, Whitley (2002) (3 citations) (Correct)
....in Sections 4 through 6 are based on a tabu search algorithm for the JSP introduced by Taillard [33] which we denote TS Taillard . We note that TS Taillard is not the best available tabu search algorithm for the JSP; the tabu search algorithms of Nowicki and Smutnicki [22] and Barnes and Chambers [3] [9] provide stronger overall performance. Rather, we have selected TS Taillard for three reasons. First, TS Taillard provides reasonable performance of the set of widely used benchmark problems, and out performs many other local and constructive search algorithms for the JSP. Second, ....
J.W. Barnes and J.B. Chambers. Solving the job shop scheduling problem with tabu search. IIE Transactions, 27:257--263, 1995.
Solving the Job Shop Problem using Taboo Search with Fuzzy.. - Yen, Wan (Correct)
.... area [8,15] Due to its wide applications, many researchers have studied this problem and dozens of approaches for this problem, including exact optimization approaches (such as mathematical programming models) 3,6,8] and approximation approaches (such as heuristic or search techniques) [1,2,4,7,13,14,16], have been proposed. The exact optimization approaches are primarily based on branch and bound scheme. Though there are considerable progress made in this approach, they show little attractiveness to the practitioners since they are time consuming with the size of the problem increase and usually ....
....approaches provide good alternatives to the job shop scheduling problem in terms of the quality of the solution and the computational time consumed. The typical approximation approaches include the following: Shifting Bottleneck heuristic [2] Simulated annealing [14] and Taboo search [4,7,13,16]. Among these approaches, taboo search is more promising since it is more efficiency and easy to implement. However, it is a meta heuristic, it has to be tailored each time with respect to parameters for every instance in order to produce desirable solution [5,11] Thus how to automatically ....
[Article contains additional citation context not shown here]
J.W. Barnes and J. B. Chambers, "Solving the Job Shop Scheduling Problem with Tabu Search", IIE Transactions, 27 (1995) 257-263.
Deconstructing Nowicki and Smutnicki's i-TSAB Tabu Search.. - Watson, Howe, Whitley (2005) (Correct)
No context found.
J.W. Barnes and J.B. Chambers. Solving the job shop scheduling problem with tabu search. IIE Transactions, 27:257--263, 1995. 26
Linking Search Space Structure, Run-Time Dynamics, and.. - Watson, Whitley, Howe (2004) (Correct)
No context found.
Barnes, J., & Chambers, J. (1995). Solving the job shop scheduling problem with tabu search. IIE Transactions, 27, 257--263.
Applying Genetic Algorithms to the Optimization of.. - Braune, Wagner.. (2004) (1 citation) (Correct)
No context found.
J.W. Barnes and J.B. Chambers. Solving the job shop scheduling problem with tabu search. IIE Transactions, 27:257-- 263, 1995.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC