Hybrid simulated annealing in flow shop scheduling: A diversification and intensification approach

International Journal of Industrial and Systems Engineering

Volumn 4, Issue 3, 2009, Pages 326-348

  Azizi, Nader ^a   Liang, Ming ^a   Zolfaghari, Saeed ^b  

^a UNIVERSITY OF OTTAWA   (Canada)

^b RYERSON UNIVERSITY   (Canada)

Author keywords

Evolution based diversification; Flow shop scheduling; FSS; GA; Genetic algorithms; SA; Simulated annealing; Tabu search; TS

Indexed keywords

COMBINATORIAL OPTIMIZATION; GALLIUM; GENETIC ALGORITHMS; MACHINE SHOP PRACTICE; SCHEDULING; SIMULATED ANNEALING; TABU SEARCH;

COMBINATORIAL PROBLEM; COMPUTATIONAL RESULTS; CONVENTIONAL TECHNIQUES; EVOLUTION BASED DIVERSIFICATION; FLOW-SHOP SCHEDULING; HYBRID GENETIC ALGORITHMS; HYBRID SIMULATED ANNEALING; STANDARD GENETIC ALGORITHM;

COMPUTATIONAL EFFICIENCY;

EID: 61649097058     PISSN: 17485037     EISSN: 17485045     Source Type: Journal    
DOI: 10.1504/IJISE.2009.023545     Document Type: Article

References (50)

1. Aarts, E.H.L., van Laarhoven, P.J.M, Lenstra, J.K. and Ulder, N.L.J. (1994) 'A computational study of local search algorithms for job shop scheduling', ORSA Journal on Computing, Vol. 6, No. 2, pp.118-125.
2. Azizi, N. and Zolfaghari, S. (2004) 'Adaptive temperature control for simulated annealing: A comparative study', Computers and Operations Research, Vol. 31, No. 14, pp.2439-2451.
3. Ben-Daya, M. and Al-Fawzan, M. (1998) 'A tabu search approach for the flow shop scheduling problem', European Journal of Operational Research, Vol. 109, No. 1, pp.88-95.
4. Boukef, H., Benrejeb, M. and Borne, P. (2007) 'A proposed genetic algorithm coding for flow-shop scheduling problems', International Journal of Computers, Communications and Control, Vol. 2, No. 3, pp.229-240.
5. Campbell, H.G., Dudek, R.A. and Smith, M.L. (1970) 'A heuristic algorithm for the n-job, m-machine sequencing problem', Management Science, Vol. 16, No. 10, pp.630-637.
6. Carlier, J. and Rebaï, I. (1996) 'Two branch and bound algorithms for the permutation flow shop problem', European Journal of Operational Research, Vol. 90, No. 2, pp.238-251.
7. Chen, C.L., Vempati, V.S. and Aljaber, N. (1995) 'An application of genetic algorithms for flow shop problems', European Journal of Operational Research, Vol. 80, No. 2, pp.389-396.
8. Cheng, R. (1997) A Study on Genetic Algorithms-based Optimal Scheduling Techniques, PhD Thesis, Tokyo Institute of Technology.
9. Demirkol, E., Mehta, S. and Uzsoy, R. (1998) 'Benchmarks for shop scheduling problems', European Journal of Operational Research, Vol. 109, No. 1, pp.137-141.
10. Eksioǧlu, B., Eksioǧlu, S.D. and Jain, P. (2008) 'A tabu search algorithm for the flow shop scheduling problem with changing neighbourhoods', Computers and Industrial Engineering, Vol. 54, No. 1, pp.1-11.
11. El-Bouri, A., Azizi, N. and Zolfaghari, S. (2007) 'A comparative study of new metaheuristics based on simulated annealing and adaptive memory programming', European Journal of Operations Research, Vol. 177, No. 3, pp.1894-1910.
12. Etiler, O., Toklu, B., Atak, M. and Wilson, J. (2004) 'A genetic algorithm for flow shop scheduling problems', Journal of the Operational Research Society, Vol. 55, No. 8, pp.830-835.
13. Framinan, J.M., Gupta, J.N.D. and Leisten, R. (2004) 'A review and classification of heuristics for permutation flow shop scheduling with makespan objective', Journal of Operational Research Society, Vol. 55, No. 12, pp.1243-1255.
14. Garey, M.R., Johnson, D.S. and Sethi, R. (1976) 'The complexity of flow shop and job shop scheduling', Mathematics of Operations Research, Vol. 1, No. 2, pp.117-129.
15. Glover, F. (1986) 'Future paths for integer programming and links to artificial intelligence', Computers and Operations Research, Vol. 13, No. 5, pp.533-549.
16. Gonçalves, J.F., Mendes, J.J.M. and Resende, M.G.C. (2005) 'A hybrid genetic algorithm for the job shop scheduling problem', European Journal of Operational Research, Vol. 167, No. 1, pp.77-95.
17. Grabowski, J. and Wodecki, M. (2004) 'A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion', Computers and Operations Research, Vol. 31, No. 11, pp.1891-1909.
18. Gupta, J.N.D. (1971a) Flow Shop Scheduling via Sorting Analogy, UARI Research Report No. 109, University of Alabama.
19. Gupta, J.N.D. (1971b) 'A functional heuristic for the flow-shop scheduling problem', Operational Research Quarterly, Vol. 22, No. 1, pp.39-47.
20. Hejazi, S.R. and Saghafian, S. (2005) 'Flowshop-scheduling problems with makespan criterion: A review', International Journal of Production Research, Vol. 43, No. 14, pp.2895-2929.
21. Held, M. and Karp, R.M. (1962) 'A dynamic programming approach to sequencing problems', Journal of SIAM, Vol. 10, No. 1, pp.196-210.
22. Holland, J.H. (1975) Adaptation in Natural and Artificial Systems, The University of Michgan Press, Ann Arbor, MI.
23. Ishibuchi, M., Misaki, S. and Tanaka, H. (1995) 'Modified simulated annealing for the flow shop sequencing problems', European Journal of Operational Research, Vol. 81, No. 2, pp.388-398.
24. Johnson, S.M. (1954) 'Optimal two- and three-stage production schedules with set-up times included', Naval Research, Logistic Quarterly, Vol. 1, No. 1, pp.61-68.
25. Kirkpatrick, S., Gelatt, C.D. and Vecchi, M.P. (1983) 'Optimization by simulated annealing', Science, Vol. 220, No. 4598, pp.671-680.
26. Kolonko, M. (1999) 'Some new results on simulated annealing applied to the job shop scheduling problem', European Journal of Operations Research, Vol. 113, No. 1, pp.123-136.
27. Lageweg, B.J., Lenstra, J.K. and Rinnooy Kan, A.H.G. (1978) 'A general bounding scheme for the permutation flowshop problem', Operations Research, Vol. 26, No. 1, pp.53-67.
28. Liao, C.J., Tseng, C.T. Luarn, P. (2007) 'A discrete version of particle swarm optimization for flowshop scheduling problems', Computers and Operations Research, Vol. 34, No. 10, pp.3099-3111.
29. Lourenço, H.R. (1996) 'Sevast'yanov's algorithm for the flow-shop scheduling problem', European Journal of Operational Research, Vol. 91, No. 1, pp.176-189.
30. Murata, T., Ishibuchi, H. and Tanaka, H. (1996a) 'Genetic algorithms for flow shop scheduling problems', Computers and Industrial Engineering Vol. 30, No. 4, pp.1061-1071.
31. Murata, T., Ishibuchi, H. and Tanaka, H. (1996b) 'Multi-objective genetic algorithm and its applications to flowshop-scheduling', Computers and Industrial Engineering, Vol. 30, No. 4, pp.957-968.
32. Nawaz, M., Enscore, E.E. and Ham, I. (1983) 'A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem', OMEGA, Vol. 11, No. 1, pp.91-95.
33. Nowicki, E. and Smutnicki, C. (1996) 'A fast tabu search algorithm for the permutation flow-shop problem', European Journal of Operational Research, Vol. 91, No. 1, pp.160-175.
34. Obgu, F.A. and Smith, D.K. (1990) 'The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem', Computers and Operations Research, Vol. 17, No. 3, pp.243-253.
35. Osman, I.H. (1993) 'Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem', Annals of Operations Research, Vol. 41, No. 4, pp.421-451.
36. Osman, I.H. and Potts, C.N. (1989) 'Simulated annealing for permutation flow-shop scheduling', OMEGA, Vol. 17, No. 6, pp.551-557.
37. Palmer, D.S. (1965) 'Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum', Operational Research Quarterly, Vol. 16, No. 1, pp.101-107.
38. Prabhaharan, G., Shahul Hamid Khan, B. and Rakesh, L. (2006) 'Implementation of grasp in flow shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 30, No. 11, pp.1126-1131.
39. Reeves, C. and Yamada, T. (1998) 'Genetic algorithms, path relinking, and the flowshop sequencing problem', Evolutionary Computation Journal, (MIT press), Vol. 6, No. 1, pp.45-60.
40. Reeves, C.R. (1995) 'A genetic algorithm for flow shop sequencing', Computers and Operations Research, Vol. 22, No. 1, pp.5-13.
41. Ruiz, R. and Maroto, C. (2005) 'A comprehensive review and evaluation of permutation flow shop heuristics', European Journal of Operational Research, Vol. 165, No. 2, pp.479-494.
42. Ruiz, R., Maroto, C. and Alcaraz, J. (2006) 'Two new robust genetic algorithms for the flowshop scheduling problem', Omega, Vol. 34, No. 5, pp.461-476.
43. Shahul Hamid Khan, B., Prabhaharan, G. and Asokan, P. (2007) 'A grasp algorithm for m-machine flow shop scheduling problem with bicriteria of makespan and maximum tardiness', International Journal of Computer Mathematics, Vol. 84, No. 12, pp.1731-1741.
44. Solimanpur, M., Vrat, P. and Shankar, R. (2004) 'A neuro-tabu search heuristic for the flow shop scheduling problem', Computers and Operations Research, Vol. 31, No. 13, pp.2151-2164.
45. Stützle, T. (1998) 'An ant approach for the flow shop problem', Proceedings EUFIT, Aachen, Germany, pp.1560-1564.
46. Taillard, E. (1990) 'Some efficient heuristic methods for the flow-shop sequencing problem', European Journal of Operational Research, Vol. 47, No. 1, pp.65-74.
47. Taillard, E. (1993) 'Benchmark for basic scheduling problems', European Journal of Operational Research, Vol. 64, No. 2, pp.278-285.
48. Wang, L. and Zheng, D.Z. (2003) 'An effective hybrid heuristic for flow shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 21, No. 1, pp.38-44.
49. Ying, K.C. and Liao, C.J. (2004) 'An ant colony system for permutation flow-shop sequencing', Computers and Operations Research, Vol. 31, No. 5, pp.791-801.
50. Zolfaghari, S. and Liang, M. (1999) 'Jointly solving the group scheduling and machining speed selection problems: A hybrid tabu search and simulated annealing approach', International Journal of Production Research, Vol. 37, No. 10, pp.2377-2397.