A scatter search algorithm for scheduling optimisation of job shop problems

International Journal of Product Development

Volumn 10, Issue 1-3, 2010, Pages 259-272

  Saravanan, M ^a   Noorul Haq, A ^b  

^a Department of Computer Applications RVS College of Engineering and Technology   (India)

^b NATIONAL INSTITUTE OF TECHNOLOGY   (India)

Author keywords

Heuristic; Improvement method; Job shop scheduling; JSS; Makespan; Metaheuristics; RefSet; Scatter search; Subset

Indexed keywords

EID: 77950678567     PISSN: 14779056     EISSN: 17418178     Source Type: Journal    
DOI: 10.1504/IJPD.2010.029996     Document Type: Article

References (47)

1. Adams, J,. Balas, E. and Zawack, D. (1988) 'The shifting bottleneck procedure for job shop scheduling', Management Science, Vol. 34, No. 3, pp.391-101. (Pubitemid 18580052)
2. Baker, K.R. (1974) Introduction to Sequencing and Scheduling, New York: John Wiley.
3. Bean, J. (1994) 'Genetic algorithms and random keys for sequencing and optimization', Operations Research Society of America (ORSA) Journal on Computing, Vol. 6, pp.154-160.
4. Blazewicz, J,. Ecker, K,. Schmidt, G. and Weglarz, J. (1993) Scheduling in Computer and Manufacturing Systems, Berlin/Heidelberg: Springer-Verlag.
5. Brucker, P. (1995) Scheduling Algorithms, Berlin/Heidelberg: Springer-Verlag.
6. Cheng, R,. Gen, M. and Tsujimura, Y. (1996) 'A tutorial survey of jobshop scheduling problems using genetic algorithms - I. Representation', Computers and Industrial Engineering, Vol. 30, pp.983-997. (Pubitemid 126375908)
7. Croce, D,. Tadei, R. and Volta, G. (1995) 'A genetic algorithm for the job shop problem', Computers and Operations Research, Vol. 22, pp.15-24.
8. DellAmico, M. and Trubian, M. (1993) 'Applying tabu search to the job shop scheduling problem', Annual Operations Research, Vol. 41, pp.231-252.
9. Dorndorf, U. and Pesch, E. (1995) 'Evolution based learning in a job shop scheduling environment', Computers and Operations Research, Vol. 22, pp.25-40.
10. Fisher, H. and Thompson, G.L. (1963) Industrial Scheduling, Englewood Cliffs, NJ: Prentice-Hall.
11. Foo, S.Y,. Takefuji, Y. and Szu, H. (1995) 'Scaling properties of neural networks for job shop scheduling', Neurocomputing, Vol. 8, No. 1, pp.79-91.
12. Gao, J,. Gen, M,. Sun, L. and Zhao, X. (2007) 'A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems', Computers &Industrial Engineering, Vol. 53, pp.149-162. (Pubitemid 47042310)
13. Garey, E.L,. Johnson, D.S. and Sethi, R. (1976) 'The complexity of flowshop and job-shop scheduling', Mathematics of Operations Research, Vol. 1, pp.117-129.
14. Gen, M. and Cheng, R. (1996) Genetic Algorithm and Engineering Design, New York: John Wiley.
15. Glover, F. (1998) 'A template for scatter search and path relinking', in J-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (Eds.) Artificial Evolution, Lecture Notes in Computer Science, Berlin: Springer, Vol. 1363, pp.13-54.
16. Glover, F,. Laguna, M. and Marti, R. (2000) 'Fundamentals of scatter search and path relinking', Control and Cybernetics, Vol. 39, No. 3, pp.653-684.
17. Goncalves, 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. (Pubitemid 40220004)
18. Grefenstette, J. (1988) 'Optimization of control parameters for genetic algorithms', IEEE Transactions on Systems, Man and Cybernetics, Vol. 16, No. 1, pp.122-128. (Pubitemid 16187857)
19. Hajek, B. (1988) 'Cooling schedules for optimal annealing', Mathematics of Operations Research, Vol. 13, No. 2, pp.311-329.
20. Haupt, R. (1989) 'A survey of priority-rule based scheduling', OR Spektrum, Vol. 11, pp.3-16.
21. Jain, S. and Meeran, S. (1999) 'Deterministic job-shop scheduling: past, present and future', European Journal of Operational Research, Vol. 113, pp.390-434.
22. Kobayashi, S,. Ono, I. and Yamamura, M. (1995) 'An efficient genetic algorithm for job shop scheduling problems', Proceedings of the 6th International Conference on Genetic Algorithms, pp.506-511.
23. Lageweg, J,. Lenstra, J.K. and Rinnooy, K.A. (1977) 'Job-shop scheduling by implicit enumeration', Management Science, Vol. 24, pp.441-450.
24. Lawrence, S. (1984) Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, Graduate School of Industrial Administration (GSIA), Carnegie Mellon University, Pittsburgh, Pennsylvania.
25. Leung, Y,. Gao, Y. and Xu, Z.B. (1997) 'Degree of population diversity - a perspective on premature convergence in genetic algorithms and its Markov-chain analysis', IEEE Transactions on Neural Networks, Vol. 8, No. 5, pp.1165-1176. (Pubitemid 127763347)
26. Lourenco, H.R. (1995) 'Local optimization and the job-shop scheduling problem', European Journal of Operational Research, Vol. 83, pp.347-364.
27. Martí, R,. Laguna, M. and Campos, V. (2005) 'Scatter search vs. genetic algorithms: an experimental evaluation with permutation problems', in C. Rego and B. Alidaee (Eds.) Metaheuristic Optimization via Adaptive Memory and Evolution: Tabu Search and Scatter Search, Norwell, MA: Kluwer Academic Publishers, pp.263-282.
28. Mattfeld, D.C. (1996) Evolutionary Search and the Job Shop - Investigations on Genetic Algorithm for Production Scheduling, Heidelberg, Germany: Physica-Verlag.
29. Muth, F. and Thompson, G. (1963) Industrial Scheduling, Englewood Cliffs, NJ: Prentice Hall.
30. Noorul Haq, A. and Saravanan, M. (2007) 'A scatter search approach for minimizing earliness and tardiness penalties in single machine scheduling around large restrictive common due windows', International Journal ofAppliedManagement and Technology, Vol. 5, No. 2, pp.76-91.
31. Noorul Haq, A. and Saravanan, M,. et al. (2007) 'A scatter search algorithm for general flow shop scheduling problem', International Journal of Advanced Manufacturing Technology, Vol. 31, pp.731-736. (Pubitemid 46005344)
32. Nowicki, E. and Smutnicki, C. (1996) 'A fast taboo search algorithm for the job shop problem', Management Science, Vol. 42, No. 6, pp.797-813. (Pubitemid 126577322)
33. Pezzella, F. and Merelli, E. (2000) 'A tabu search method guided by shifting bottleneck for the job shop scheduling problem', European Journal of Operational Research, Vol. 120, No. 2, pp.297-310. (Pubitemid 30542651)
34. Ponnambalam, S.G,. Aravindan, P. and Rajesh, S.V. (2000) 'A tabu search algorithm for job shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 16, pp.765-771.
35. Ponnambalam, S.G,. Jawahar, N. and Senthil Kumar, B. (2002) 'Estimation of optimum genetic control parameters for job shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 19, pp.224-234. (Pubitemid 34268720)
36. Rudolph, G. (1994) 'Convergence properties of canonical genetic algorithms', IEEE Transactions on Neural Networks, Vol. 5, No. 1, pp.96-101.
37. Saravanan, M. and Noorul Haq, A. (2008) 'Evaluation of scatter search approach for scheduling optimization of flexible manufacturing systems', International Journal of Advanced Manufacturing Technology, Vol. 38, Nos. 9-10, pp.978-986.
38. Saravanan, M,. Noorul Haq, A,. Vivekraj, A.R. and Prasad, T. (2008) 'Performance evaluation of scatter search method for permutation flow-shop sequencing problems', International Journal of Advanced Manufacturing Technology, Vol. 37, Nos. 11-12, pp.1200-1208.
39. Sha, D.Y. and Hsu, C-Y. (2006) 'A hybrid particle swarm optimization for job shop scheduling problem', Computers & Industrial Engineering, Vol. 51, pp.791-808.
40. Shi, G. (1997) 'A genetic algorithm applied to a classic job-shop scheduling problem', International Journal of Systems Science, Vol. 28, No. 1, pp.25-32. (Pubitemid 127589686)
41. Sun, D,. Batta, R. and Lin, L. (1995) 'Effective job shop scheduling through active chain manipulation', Computers & Operations Research, Vol. 22, No. 2, pp.159-172.
42. Taillard, E.D. (1993) 'Benchmarks for basic scheduling problems', European Journal of Operational Research, Vol. 64, pp.278-285.
43. Van Laarhoven, P,. Aarts, E. and Lenstra, J.K. (1992) 'Job shop scheduling by simulated annealing', Operations Research, Vol. 40, pp.113-125.
44. Wang, L. and Zheng, D.Z. (2000) 'Global derivative-free training for feed-forward neural networks', The Third Asian Control Conference, Shanghai, China, pp.1570-1575.
45. Wang, L. and Zheng, D.Z. (2001) 'An effective hybrid optimization strategy for job-shop scheduling problems', Computers and Operations Research, Vol. 28, pp.585-596. (Pubitemid 32223133)
46. Wang, L. and. Zheng, D.Z. (2002) 'A modified genetic algorithm for job shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 20, pp.72-76. (Pubitemid 34882427)
47. Yang, R. and Douglas, I. (1998) 'Simple genetic algorithm with local tuning: efficient global optimizing technique', Journal of Optimization Theory and Applications, Vol. 98, No. 2, pp.449-465. (Pubitemid 128356591)