A comparative study of a new heuristic based on adaptive memory programming and simulated annealing: The case of job shop scheduling

European Journal of Operational Research

Volumn 177, Issue 3, 2007, Pages 1894-1910

  El Bouri, A ^a   Azizi, N ^a   Zolfaghari, S ^a  

^a RYERSON UNIVERSITY   (Canada)

Author keywords

Adaptive memory programming; Job shop scheduling; Meta heuristics; Simulated annealing; Tabu search

Indexed keywords

HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING;

ADAPTIVE MEMORY PROGRAMMING; JOB SHOP SCHEDULING; META-HEURISTICS; TABU SEARCH;

SCHEDULING;

EID: 33750736617     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2005.12.013     Document Type: Article

References (42)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for job shop scheduling. Management Science 34 (1988) 391-401
2. Ahmadi S., and Osman I.H. Greedy random adaptive memory programming search for the capacitated clustering problem. European Journal of Operational Research 162 (2004) 30-44
3. Aiex R.M., Binato S., and Resende M.G.C. Parallel GRASP with path relinking for job shop scheduling. Parallel Computing 29 (2003) 393-430
4. Applegate D., and Cook W. A computational study of job shop scheduling problem. ORSA Journal on Computing 3 (1991) 149-156
5. Balas E., Lenstra J.K., and Vazacopoulos A. The one-machine problem with delayed precedence constraints and its use in job shop scheduling. Management Science 41 (1995) 94-109
6. Barnes, J.W., Carlton, W.B., 1995. Solving the vehicle routing problem with time windows using reactive tabu search. INFORMS Conference, New Orleans, LA.
7. Barnes J.W., and Chambers J.B. Solving the job shop scheduling problem using tabu search. IIE Transaction 27 (1995) 257-263
8. Boese K.D., Kahng A.B., and Muddu S. A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters 16 (1994) 101-113
9. Brinkkotter W., and Brucker P. Solving open benchmark instances for the job-shop problem by parallel head-tail adjustments. Journal of Scheduling 4 (2001) 53-64
10. Carlier J., and Pinson E. An algorithm for solving the job shop problem. Management Science 35 (1989) 164-176
11. Colorni A., Dorigo M., and Maniezzo V. Distributed optimization by ant colonies. In: Varela F.J., and Bourgine P. (Eds). Proceedings of the First European Conference on Artificial Life (ECAL-91) (1992), The MIT press, Cambridge, MA 134-142
12. Colorni A., Dorigo M., and Maniezzo V. An investigation of some properties of an ant algorithm. In: Manner R., and Manderick B. (Eds). Parallel Problem Solving from Nature 2 (1992), North-Holland, Amsterdam 509-520
13. Colorni A., Dorigo M., and Maniezzo V. Ant system for job-shop scheduling. Belgian Journal of Operations Research, Statistics, and Computer Science 34 (1994) 39-53
14. Dell' Amico M., and Trubian M. Applying tabu search to the job shop scheduling problem. Annals of Operations Research 41 (1993) 231-252
15. Dorigo M., and Gambardella L.M. Ant colony system: A cooperative learning approach to the traveling salesman problem. IEEE Transaction on Evolutionary Computation 1 (1997) 53-66
16. Feo T., and Resende M. Greedy randomized adaptive search procedures. Journal of Global Optimization 16 (1995) 109-133
17. Gambardella L.M., and Dorigo M. Solving symmetric and asymmetric TSP's by ant colonies. Proceedings of the IEEE Conference on Evolutionary Computation (ICEC'96) (1996), IEEE Press, New York 622-627
18. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13 (1986) 533-549
19. Holland J.H. Adaptation in Natural and Artificial Systems (1975), The University of Michigen Press, Ann Arbor, MI
20. Jain A.S., and Meeran S. Deterministic job-shop scheduling: Past, present and future. European Journal of Operational Research 113 (1999) 390-434
21. Kirkpatrick S., Gelatt Jr. C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 (1983) 671-680
22. Mason S.J., Fowler J.W., and Carlyle M.W. A modified shifting bottleneck heuristic for minimizing total weighted tardiness in complex job shops. Journal of Scheduling 5 (2002) 247-262
23. Matsuo, H., Suh, C.J., Sullivan, R.S., 1988. A controlled search simulated annealing method for the general job-shop scheduling problem. Working Paper #03-04-88, Graduate School of Business, The University of Texas at Austin, Austin.
24. Mattfeld D.C., and Bierwirth C. An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155 (2004) 616-630
25. Murovec B., and Suhel P. A repairing technique for the local search of the job-shop problem. European Journal of Operational Research 153 (2004) 220-238
26. Muth J.F., and Thompson G.L. Industrial Scheduling (1963), Prentice Hall, New Jersey
27. Nowicki E., and Smutnicki C. A fast tabu search algorithm for the permutation flow shop problem. European Journal of Operational Research 91 (1996) 160-175
28. Ombuki B.M., and Ventresca M. Local search algorithms for the job shop scheduling problem. Applied Intelligence 21 (2004) 99-109
29. Osman I.H. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421-451
30. Osman I.H., and Potts C.N. Simulated annealing for permutation flow-shop scheduling. OMEGA 17 (1989) 551-557
31. Steinhofel K., Albrecht A., and Wong C.K. An experimental analysis of local minima to improve neighborhood search. Computers and Operations Research 30 (2003) 2157-2173
32. Stutzle T., and Hoos H. MAX-MIN ant system. Future Generation Computer Systems (FGCS) 16 (2000) 889-914
33. Taillard E.D. Robust tabu search for quadratic assignment problem. Parallel Computing 17 (1991) 443-455
34. Taillard E.D. Parallel tabu search techniques for the job shop scheduling problem. ORSA Journal on Computing 6 (1994) 108-117
35. Taillard E.D., Badeau P., Gendreau M., Guertin F., and Potvin J.Y. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31 (1997) 170-186
36. Taillard E.D., Gambardella L.M., Gendreau M., and Potvin J.Y. Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research 135 (2001) 1-16
37. T'kindt V., Monmarche N., Tercinet F., and Laugt D. An ant colony optimization algorithm to solve a 2-machine bicriteria flow shop scheduling problem. European Journal of Operational Research 142 (2002) 250-257
38. Van Laarhoven P.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by simulated annealing. Operation Research 40 (1992) 113-126
39. Vaessens R.J.M., Aarts E.H.L., and Lenstra J.K. Job shop scheduling by local search. ORSA Journal on Computing 8 (1996) 302-317
40. Wang L., and Zheng D.Z. An effective hybrid optimization strategy for job-shop scheduling problems. Computers and Operations Research 28 (2001) 585-596
41. Yamada, T., Nakano, R., 1997. Genetic Algorithms for job-shop scheduling problems. Proceedings of Modern Heuristic for Decision Support (UNICOM seminar). pp. 67-81.
42. Zolfaghari S., and Liang M. Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach. International Journal of Production Research 37 (1999) 2377-2397