Tabu search strategies for solving job shop scheduling problems

Journal of Advanced Manufacturing Systems

Volumn 6, Issue 1, 2007, Pages 59-75

  Eswaramurthy, V P ^a   Tamilarasi, A ^a  

^a KONGU ENGINEERING COLLEGE   (India)

Author keywords

Combinatorial optimization; Job shop scheduling; Neighborhood structures; Tabu length; Tabu list; Tabu search

Indexed keywords

JOB SHOP SCHEDULING; NEIGHBORHOOD STRUCTURES; TABU LENGTH; TABU LIST;

COMBINATORIAL OPTIMIZATION; GLOBAL OPTIMIZATION; JOB ANALYSIS; PARALLEL ALGORITHMS; SCHEDULING;

TABU SEARCH;

EID: 34547257049     PISSN: 02196867     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219686707000899     Document Type: Article

References (30)

1. M. R. Garey, D. S. Johnson and R. Sethi, The complexity of flow shop and job shop scheduling, Mathematics of Operations Research 1 (1976) 117-29.
2. M. R. Garey, Computers and intractability, A Guide to the Theory of NP-Completeness (W.H. Freeman and Company, 1979).
3. F. Glover, Future paths for integer programming and links to artificial intelligence, Computers and Operations Research 13 (1986) 533-549.
4. F. Glover, Tabu Search - Part I, ORSA Journal on Computing 1 (1989) 190-206.
5. F. Glover, Tabu Search - Part II, ORSA Journal on Computing 2 (1990) 4-32.
6. J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA Journal on Computing 2 (1990) 33-45.
7. E. Taillard, Some efficient heuristic methods for the flow shop sequencing problem, European Journal of Operational Research 47 (1990) 65-74.
8. E. Taillard, Robust tabu search for the quadratic assignment problem, Parallel Computing 17 (1991) 443-455.
9. D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spektrum 11 (1989) 131-141.
10. A. Hertz and D. de Werra, The tabu search metaheuristic: How we used it, Annals of Mathematics and Artificial Intelligence 1 (1991) 111-121.
11. P. Soriano and M. Gendreau, Diversification strategies in Tabu search algorithms for the maximum clique problems, Annals of Operations Research 63 (1996) 189-207.
12. T. G. Crainic, M. Toulouse and M. Gendreau, Toward a taxonomy of parallel tabu search heuristics, INFORMS Journal on Computing 9 (1997) 61-72.
13. V. D. Cung, S. L. Martins, C. C. Ribeiro and C. Roucairol, Strategies for the Parallel Implementation of Metaheuristics, in Essays and Surveys in Metaheuristics, eds. C. C. Ribeiro and P. Hansen (Kluwer Academic Publishers, 2002), pp. 263-308.
14. F. Glover, Ejection chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems 65 (Shortened version published in Discrete Applied Mathematics University of Colorado, 1992), pp. 223-253.
15. F. Glover and M. Laguna, Tabu Search, in Modern Heuristic Techniques for Combinatorial Problems, C. R. Reeves (ed.), Blackwell (1993), pp. 70-150.
16. Y. Rochat and É.D. Taillard, Probabilistic diversification and intensification in local search for vehicle routing, Journal of Heuristics 1 (1995) 147-167.
17. D. Taillard, Parallel Tabu search techniques for the job shop scheduling problem, ORSA journal of Computing 6 (1994) 108-116.
18. B. John Chambers and J. Wesley Barnes, Solving the job shop scheduling problem with tabu search, IIE Transactions 27 (1995) 257-263.
19. E. Nowicki, A fast tabu search algorithm for the job shop problem, Management Science 42 (1996) 797-813.
20. E. Nowicki, An advanced tabu search algorithm for the Job shop problem, J. Scheduling 8 (2005) 145-159.
21. Anant Singh Jain, A Multi Level Hybrid Framework for the Deterministic Job Shop Scheduling Problem, Ph.D Thesis, Department of Applied Physics, Electronic and Mechanical Engineering, University of Dundee, Scotland, (1998).
22. F. Glover and M. Laguna, TABU SEARCH (KLUWER Academic Publishers, Boston, MA, 1997).
23. Alain Hertz and Marino Widmer, An improved tabu search approach for solving the job shop scheduling problem with tooling constraints, Discrete Applied Mathematics 65 (1996) 319-345.
24. C. Chu, J. M. Proth and C. Wang, Improving job-shop schedules through critical pairwise exchanges, Int. J. Production Research 3 (1998) 683-694.
25. S. G. Ponnambalam, P. Aravindan and S. V. Rajesh, A Tabu Search Algorithm for Job Shop Scheduling, Int. J. Advance Manufacturing Technology 6 (2000) 765-771.
26. F. Pezzella, and E. Merelli, A tabu search method guided by shifting bottleneck for the job shop scheduling problem, European Journal of Operational Research 120 (2000) 297-310.
27. VinmH cius Amaral Armentano and Cintia Rigao Scrich, Tabu search for minimizing total tardiness in a job shop Int. J. Production Economics 63 (2000) 131-140.
28. J.-P. Watson, J. C. Beck, A. E. Howe and L. D. Whitley, Problem difficulty for tabu search in job-shop scheduling, Artificial Intelligence 143 (2003) 189-217.
29. F. Geyik and I. H. Cedimoglu, The strategies and parameters of tabu search for job shop scheduling, J. Intelligent Manufacturing 15 (2004) 439-448.
30. J. Hurink and S. Knust, Tabu search algorithms for job-shop problems with a single transport robot, European Journal of Operational Research 162 (2005) 99-111.