The manufacturing industry continues to be a prime contributor and it requires an efficient schedule. Scheduling is the allocation of resources to activities over time and it is considered to be a major task done to improve shop-floor productivity. Job shop problem comes under this category and is combinatorial in nature. Research on optimization of the job shop problem is one of the most significant and promising areas of optimization. This paper presents an application of the global optimization technique called tabu search that is combined with the ant colony optimization technique to solve the job shop scheduling problems. The neighborhoods are selected based on the strategies in the ant colony optimization with dynamic tabu length strategies in the tabu search. The inspiring source of ant colony optimization is pheromone trail that has more influence in selecting the appropriate neighbors to improve the solution. The performance of the algorithm is tested using well-known benchmark problems and is also compared with other algorithms in the literature.
This is a preview of subscription content, log in to check access.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13:533–549
Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern 26(2):29–41
Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the travelling salesman problem. IEEE Trans Evol Comput 1(1):53–66
Glover F (1989) Tabu search – part I. ORSA J Comput 1:190–206
Glover F (1990) Tabu search – part II. ORSA J Comput 2:4–32
Pezzella F, Merelli E (2000) A tabu search method guided by shifting bottleneck for the job shop scheduling problem. Eur J Oper Res 120:297–310 Elsevier
Calderia JP, Melicio F, Rosa A (2004) Using a hybrid evolutionary-taboo algorithm to solve job shop problem. ACM Symp Appl Comput 1446–1451
Nowicki E, Smutnicki C (2005) An advanced tabu search algorithm for the job shop problem. J Sched 8:145–159
Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3:149–156
Ponnambalam SG, Aravindan P, Rajesh SV (2000) A tabu search algorithm for job shop scheduling. Int J Adv Manuf Technol 16:765–771
Amaral Armentano VV, Scrich CR (2004) Tabu search for minimizing total tardiness in a job shop. Int J Prod Econ 63:131–140
Blum C, Samples M, (2004) An ant colony optimization algorithm for shop scheduling problems. J Math Model Algorithms. 3:285–308
Ventresca M, Ombuki BM (2004) Ant colony optimization for job shop scheduling problem. Tech Report #CS-04-04, Brock University, Canada
Zhang J, Hu X, Tan X, Zhong JH, Huang Q (2006) Implementation of an ant colony optimization technique for job shop scheduling problem. Trans Inst Meas Control 28(1):93–108
Hertz A, de Werra D (1991) The tabu search metaheuristic: how we used it. Ann Math Artif Intell 1:111–121
Dorigo M, Maniezzo V, Colorni A (1991) The ant system: an autocatalytic optimizing process. Technical Report TR91-016, Politecnico di Milano
Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Proceedings of ECAL’91 European Conference on Artificial Life. Elsevier, Amsterdam, pp 134–142
About this article
Cite this article
Eswaramurthy, V.P., Tamilarasi, A. Hybridizing tabu search with ant colony optimization for solving job shop scheduling problems. Int J Adv Manuf Technol 40, 1004–1015 (2009). https://doi.org/10.1007/s00170-008-1404-x
- Tabu list
- Neighborhood structures
- Tabu length
- Pheromone trail
- Ant colony optimization