A two-level particle swarm optimization algorithm on job-shop scheduling problems

International Journal of Operational Research

Volumn 4, Issue 4, 2009, Pages 390-411

  Pongchairerks, Pisut ^a   Kachitvichyanukul, Voratas ^b  

^a THAMMASAT UNIVERSITY   (Thailand)

^b ASIAN INSTITUTE OF TECHNOLOGY   (Thailand)

Author keywords

Job shop; Makespan; Particle swarm optimization; PSO; Scheduling

Indexed keywords

EID: 67849118089     PISSN: 17457645     EISSN: 17457653     Source Type: Journal    
DOI: 10.1504/IJOR.2009.023535     Document Type: Article

References (34)

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. Bean, J. (1994) 'Genetic algorithms and random keys for sequencing and optimization', ORSA Journal on Computing, Vol. 6, No. 2, pp. 154-160.
3. Bierwirth, C. and Mattfeld, D. C. (1999) 'Production scheduling and rescheduling with genetic algorithms', Evolutionary Computation, Vol. 7, No. 1, pp. 1-17.
4. Blum, C. and Sampels, M. (2004) 'An ant colony optimization algorithm for shop scheduling problems', Journal of Mathematical Modelling and Algorithms, Vol. 3, No. 3, pp. 285-308.
5. Clerc, M. (2004) 'Discrete particle swarm optimization illustrated by the traveling salesman problem', New Optimization Techniques in Engineering, Springer, Heidelberg, pp. 219-239.
6. Croce, F., Tadei, R. and Volta, G. (1995) 'A genetic algorithm for the job shop problem', Computers and Operations Research, Vol. 22, No. 1, pp. 15-24.
7. Dorndorf, U. and Pesch, E. (1995) 'Evolution based learning in a job shop scheduling environment', Computers and Operations Research, Vol. 22, No. 1, pp. 25-40.
8. Fisher, H. and Thompson, G. L. (1963) 'Probabilistic learning combinations of local job-shop scheduling rules', Industrial Scheduling, Prentice-Hall, Englewood Cliffs, pp. 225-251.
9. French, S. (1987) Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, John Wiley & Sons, New York.
10. Gen, M., Tsujimura, Y. and Kubota, E. (1994) 'Solving job-shop scheduling problem using genetic algorithms', Proceedings of the 16th International Conference on Computers and Industrial Engineering, New Jersey, pp. 576-579.
11. 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 Operation Research, Vol. 167, No. 1, pp. 77-95.
12. Kennedy, J. (1999) 'Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance', Congress on Evolutionary Computation, Washington, pp. 1931-1938.
13. Kennedy, J. and Eberhart, R. C. (1995) 'Particle swarm optimization', IEEE International Conference on Neural Network, Perth, Australia, pp. 1942-1948.
14. Kolonko, M. (1999) 'Some new results on simulated annealing applied to the job shop scheduling problem', European Journal of Operational Research, Vol. 113, No. 11, pp. 123-136.
15. Lawrence, S. (1984) Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques, Graduate School of Industrial Administration, Carnegie Mellon University, Pennsylvania.
16. Lenstra, J. K. and Rinnooy Kan, A. H. G. (1979) 'Computational complexity of discrete optimisation problems', Annals of Discrete Mathematics, Vol. 4, pp. 121-140.
17. Liao, C-J., Tseng, C-T. and 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.
18. Liu, B., Wang, L. and Jin, Y-H. (2007) 'An effective hybrid particle swarm optimization for no-wait flow shop scheduling', International Journal of Advanced Manufacturing Technology, Vol. 31, Nos. 9-10, pp. 1001-1011.
19. Mattfeld, D. C. and Bierwirth, C. (2004) 'An efficient genetic algorithm for job shop scheduling with tardiness objectives', European Journal of Operational Research, Vol. 155, No. 3, pp. 616-630.
20. Norman, B. A. and Bean J. (1996) A Random Keys Genetic Algorithm for Job Shop Scheduling, Technical Report TR-96-10, Industrial and Operations Engineering Department, University of Michigan, Michigan.
21. Nowicki, E. and Smutnicki, C. (2005) 'An advanced tabu search algorithm for the job shop problem', Journal of Scheduling, Vol. 8, No. 2, pp. 145-159.
22. Ombuki, B. M. and Ventresca, M. (2004) 'Local search genetic algorithms for the job shop scheduling problem', Applied Intelligence, Vol. 21, No. 1, pp. 99-109.
23. Pongchairerks, P. and Kachitvichyanukul, V. (2006) 'Particle swarm optimization algorithm with multiple social learning structures', Proceedings of the 36th CIE Conference on Computers and Industrial Engineering, Taipei, Taiwan, pp. 1556-1567.
24. Satake, T., Morikawa, K., Takahashi, K. and Nakamura, N. (1999) 'Simulated annealing approach for minimizing the makespan of the general job-shop', International Journal of Production Economics, Vols. 60-61, No. 1, pp. 515-522.
25. Shi, Y. and Eberhart, R. C. (1998) 'A modified particle swarm optimizer', IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, pp. 69-73.
26. Storer, R. H., Wu, S. D. and Vaccari, R. (1992) 'New search spaces for sequencing problems with application to job shop scheduling', Management Science, Vol. 38, No. 10, pp. 1495-1509.
27. Suresh, R. K. and Mohanasundaram K. M. (2006) 'Pareto archived simulated annealing for job shop scheduling with multiple objectives', International Journal of Advanced Manufacturing Technology, Vol. 29, Nos. 1-2, pp. 184-196.
28. Taillard, E. D. (1994) 'Parallel taboo search techniques for the job shop scheduling problem', ORSA Journal on Computing, Vol. 6, No. 2, pp. 108-117.
29. Tasgetiren, M. F., Liang, Y-C., Sevkli, M. and Gencyilmaz, G. (2007) 'A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem', European Journal of Operational Research, Vol. 177, No. 3, pp. 1930-1947.
30. Udomsakdigool, A. and Kachitvichyanukul, V. (2006) 'Two-way scheduling approach in ant algorithm for solving job shop problem', Industrial Engineering and Management Systems, Vol. 5, No. 2, pp. 68-75.
31. Veeramachaneni, K., Peram, T., Mohan, C. and Osadciw, L. A. (2003) 'Optimization using particle swarms with near neighbor interactions', Proceedings of the Genetic and Evolutionary Computation Conference (GECCO2003), Chicago, Illinois, pp. 110-122.
32. Watanabe, M., Ida, K. and Gen, M. (2005) 'A genetic algorithm with modified crossover operator and search area adaptation for the job-shop scheduling problem', Computers and Industrial Engineering, Vol. 48, No. 4, pp. 743-752.
33. Xia, W-J. and Wu, Z-M. (2006) 'A hybrid particle swarm optimization approach for the job-shop scheduling problem', International Journal of Advanced Manufacturing Technology, Vol. 29, Nos. 3-4, pp. 360-366.
34. 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', Computer and Operations Research, Vol. 34, No. 11, pp. 3229-3242.