A hybrid evolutionary algorithmfor the job shop scheduling problem

Journal of the Operational Research Society

Volumn 60, Issue 2, 2009, Pages 221-235

  Zobolas, G I ^a   Tarantilis, C D ^a   Ioannou, G ^a  

^a ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

Evolutionary algorithms; Job shop; Production scheduling; VNS

Indexed keywords

BENCHMARKING; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; PRODUCTION CONTROL; SCHEDULING;

COMPUTATIONAL EXPERIMENT; DIFFERENTIAL EVOLUTION; HIGH-QUALITY SOLUTIONS; JOB SHOP; JOB SHOP SCHEDULING PROBLEMS; OPTIMIZATION CRITERIA; PRODUCTION SCHEDULING; VARIABLE NEIGHBOURHOOD SEARCH;

JOB SHOP SCHEDULING;

EID: 58449134175     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2602534     Document Type: Article

References (44)

1. Aarts EHL, Van Laarhoven PJM, Lenstra JK and Ulder NLJ (1994). A computational study of local search algorithms for job shop scheduling. ORSA J Comput 6: 118-125.
2. Adams J, Balas E and Zawack D (1988). The shifting bottleneck procedure for job-shop scheduling. Mngt Sci 34: 391-401.
3. Aiex RM, Binato S and Resende MGC (2003). Parallel GRASP with path-relinking for job shop scheduling. Parallel Comput 29: 393-430.
4. Anghinolfi D and Paolucci M (2006). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Comput Opl Res 34: 3471-3490.
5. Applegate D and Cook W (1991). A computational study of the jobshop scheduling problem. ORSA J Comput 3: 149-156.
6. Balas E and Vazacopoulos A (1998). Guided local search with shifting bottleneck for job shop scheduling. Mngt Sci 44: 262-275.
7. Bean JC (1994). Genetic algorithm and random keys for sequencing and optimization. ORSA J Comput 6: 154-160.
8. Beasley JE. http://people.brunel.ac.uk/-mastjjb/jeb/orlib/jobshopinfo. html, accessed 5 May 2006.
9. Blum C and Roli A (2003). Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Comput Surv 35: 268-308.
10. Cheng R, Gen M and Tsujimura Y (1996). A tutorial survey of job-shop scheduling problems using genetic algorithms, part I: Representation. Comput Ind Eng 30: 983-997.
11. Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y and Semet F (2002). A guide to vehicle routing heuristics. J Opl Res Soc 53: 512-522.
12. Della Croce F, Tadei R and Volta G (1995). A genetic algorithm for the job shop problem. Comput Opl Res 22: 15-24.
13. Dongarra JJ (2006). Performance of various computers using standard linear equations software. Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN, 2006.
14. Dorndorf U and Pesch E (1993). Combining genetic and local search for solving the job shop scheduling problem. In: Maros I (ed). Symposium on Applied Mathematical Programming and Modelling APMOD93. Akaprint: Budapest, Hungary, pp 142-149.
15. El-Bouri A, Azizi N and Zolfaghari S (2006). A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling. Eur J Opl Res 177: 1894-1910.
16. Etiler O, Toklu B, Atak M and Wilson J (2004). A genetic algorithm for flow shop scheduling problems. J Opl Res Soc 55: 830-835.
17. Fisher H and Thompson GL (1963). Probabilistic learning combinations of local job-shop scheduling rules. In: Muth JF and Thompson GL (eds). Industrial Scheduling. Prentice-Hall: Englewood Cliffs, NJ.
18. Fleszar K and Hindi KS (2004). Solving the resource-constrained project scheduling problem by a variable neighbourhood search. Eur J Opl Res 155: 402-413.
19. Gagné C, Gravel M and Price WL (2005). Using metaheuristic compromise programming for the solution of multiple-objective scheduling problems. J Opl Res Soc 56: 687-698.
20. Gen M, Tsujimura Y and Kubota E (1994). Solving job-shop scheduling problem using genetic algorithms. In: Gen M and Kobayashi S (eds). Proceedings of the 16th International Conference on Computer and Industrial Engineering, Ashikaga Institute of Technology: Ashikaga, Japan, pp 576-579.
21. Gonçalves JF, Mendes JJDM and Resende MGC (2005). A hybrid genetic algorithm for the job shop scheduling problem. Eur J Opl Res 167: 77-95.
22. Hansen P and Mladenović N (2001). Variable neighborhood search: Principles and applications. Eur J Opl Res 130: 449-467.
23. Hindi KS, Fleszar K and Charalambous C (2003). An effective heuristic for the CLSP with set-up times. J Opl Res Soc 54: 490-498.
24. Holland JH (1992). Genetic Algorithms, Sci Am July: 44-50.
25. Huang KL and Liao CJ (2006). Ant colony optimization combined with taboo search for the job shop scheduling problem. Comput Opl Res, doi: 10.1016/j.cor.2006.07.003.
26. Jain AS and Meeran S (1999). Deterministic job-shop scheduling: Past, present and future. Eur J Opl Res 113: 390-434.
27. Lawrence S (1984). Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques Supplement. Graduate School of Industrial Administration, Carnegie-Mellon University: Pittsburgh, Pennsylvania.
28. Lee DS, Vassiliadis VS and Park JM (2004). A novel threshold accepting meta-heuristic for the job-shop scheduling problem. Comput Opl Res 31: 2199-2213.
29. Lenstra JK and Rinnooy Kan AHG (1979). Computational complexity of discrete optimization problems. Ann Discrete Math 4: 121-140.
30. Matsuo H, Suh CJ and Sullivan RS (1988). A controlled search simulated annealing method for the general job-shop scheduling problem. Graduate School of Business, University of Texas at Austin. Nearchou A (2006). A differential evolution approach for the common due date early/tardy job scheduling problem. Comput Opl Res 35: 1329-1343.
31. Nowicki E and Smutnicki C (1996). A fast taboo search algorithm for the job shop scheduling problem. Mngt Sci 42: 797-813.
32. Onwubolu G and Davendra D (2006). Scheduling flow shops using differential evolution algorithm. Eur J Opl Res 171: 674-692.
33. Storer RH, Wu SD and Vaccari R (1992). New search spaces for sequencing problems with applications to job-shop scheduling. Mngt Sci 38: 1495-1509.
34. Storn R and Price K (1997). Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11: 341-359.
35. Shutler PME (2003). A priority list based heuristic for the job shop problem. J Opl Res Soc 54: 571-584.
36. Shutler PME (2004). A priority list based heuristic for the job shop problem: part 2 tabu search. J Opl Res Soc 55: 780-784.
37. Taillard ED (1994). Parallel taboo search techniques for the job shop scheduling problem. ORSA J Comput 6: 108-117.
38. Tarantilis CD and Kiranoudis CT (2002a). A list-based threshold accepting method for the job-shop scheduling problems. Int J Prod Econ 77: 159-171.
39. Tarantilis CD and Kiranoudis CT (2002b). A modern local search method for operations scheduling of dehydration plants. J Food Eng 52: 17-23.
40. Tasgetiren MF, Liang YC, Sevkli M and Gencyilmaz G (2007). A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem. Eur J Opl Res 177: 1930-1947.
41. Van Laarhoven PJM, Aarts EHL and Lenstra JK (1992). Job shop scheduling by simulated annealing. Opl Res 40: 113-125.
42. Wang L and Zheng DZ (2001). An effective hybrid optimization strategy for job-shop scheduling problems. Comput Opl Res 28: 585-596.
43. Yamada T and Nakano R (1992). A genetic algorithm applicable to large-scale job-shop problems. In: Manner R and Manderick B (eds). Proceedings of the Second International Workshop on Parallel Problem Solving from Nature (PPSN'2). Elsevier Science: Brussels, Belgium, pp 281-290.
44. Zhang C, Li P, Guan Z and Rao Y (2007). A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem. Comput Opl Res 34: 3229-3242.