A discrete particle swarm optimization algorithm for the permutation flowshop sequencing problem with Makespan criterion

Research and Development in Intelligent Systems XXIII - Proceedings of AI 2006, the 26th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence

Volumn , Issue , 2007, Pages 19-31

  Pan, Quan Ke ^a   Fatih Tasgetiren, M ^b   Liang, Yun Chia ^c  

^a LIAOCHENG UNIVERSITY   (China)

^b SULTAN QABOOS UNIVERSITY   (Oman)

^c YUAN ZE UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

INTELLIGENT SYSTEMS; PARTICLE SWARM OPTIMIZATION (PSO);

COMPUTATIONAL EXPERIMENT; DISCRETE PARTICLE SWARM OPTIMIZATION; DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM; INSERT NEIGHBORHOOD; LOCAL SEARCH ALGORITHM; MAKESPAN CRITERION; PERMUTATION FLOW SHOPS; SEQUENCING PROBLEMS;

BENCHMARKING;

EID: 84881467372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-1-84628-663-6_2     Document Type: Conference Paper

References (36)

1. S.M. Johnson, Optimal two-And three-stage production schedules, Naval Research Logistics Quarterly 1 (1954) 61-68
2. A.H.G. Rinnooy Kan, Machine Scheduling Problems: Classification, Complexity, and Computations, Nijhoff, The Hague, (1976
3. D.S. Palmer, Sequencing jobs through a multistage process in the minimum total time: A quick method of obtaining a near-optimum, Operational Research Quarterly 16 (1965) 101-107
4. H.G. Campbell, R.A. Dudek, M.L. Smith, A heuristic algorithm for the n job, m machine sequencing problem, Management Science 16(10) (1970) B630-B637
5. D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Management Science 23(11) (1977) 1174-1182
6. M. Nawaz, E.E. Enscore Jr., I. Ham, A heuristic algorithm for the m-machine, n-job flow shop sequencing problem, OMEGA 11(1) (1983) 91-95
7. E. Taillard, Some effident heuristic methods for the flowshop sequencing problems, European Journal of Operational Research 47 (1990) 65-74
8. J .M. Framinan, R. Leisten, An efficient constructive heuristic for flowtime minimisation in permutation flow shops, OMEGA 31 (2003) 311-317
9. J.M. Framinan, R. Leisten, R. Ruiz-Usano, Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation, European Journal of Operational Research 141 (2002) 559-569
10. Osman, C. Potts, Simulated annealing for permutation flow shop scheduling, OMEGA 17(6) (1989) 551-557
11. F. Ogbu, D. Smith, The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem, Computers and Operations Research 17(3) (1990) 243-253
12. M. Widmer, A. Hertz., A new heuristic method for the flow shop sequencing problem, European Journal of Operational Research 20(7) (1989) 707-722
13. C. Reeves, Improving the efficiency of tabu search for machine sequencing problem, Journal of the Operational Research Society 44(4) (1993) 375-382
14. J .Grabowski, M. Wodecki, A very fast tabu search algorithm for the permutation flowshop problem with makespan criterion, Computers and Operations Research, 31(11) (2004) 1891-1909
15. E. Nowicki, C. Smutnicki, A fast tabu search algorithm for the permutation flowshop problem, European Journal of Operational Research 91 (1996) 160-175
16. C. Reeves, A genetic algorithm for flowshop sequencing, Computers and Opcrat.ions Research 22(1) (1995) 5-13
17. C. Reeves, T. Yamada, Genetic algorithms, path relinking and the f1owshop sequencing problem, Evolutionary Computation 6 (1998) 45-60
18. C. L. Chen, V. S. Vempati, N. Aljaber, An application of Genetic algorithms for flow shop problems, European Journal of Operational Research 80(2) (1995) 389-396
19. T. Aldowaisan, A. Allahverdi, New heuristics for no-wait f1owshops to minimize makespan, Computers and Operations Research 30(8) (2003) 1219-1231
20. T. Murata, H. Ishibuchi, H. Tallaka, Genetic algorithms for f1owshop scheduling problems, Computers and Industrial Engineering 30(4) (1996) 1601-1071
21. C. Rajendran, H. Ziegler, Ant-colony algorithms for permutation f1owshop scheduling to minimize makespan/total flowtime of jobs, European Journal of Operational Research 155(2) (2004) 426-438
22. T. Stutzle, An ant approach to the f1owshop problem, In: Proceedings of the 6th European Congress on Intelligent Techniques and Soft Cmputing (EUFIT'98), Verlag Mainz, Aachen, Germany, (1998) 1560-1564
23. T. Stutzle, Applying iterated local search to the permutation f1owshop problem, Technical Report, AIDA-98-04, Darmstad University of Technology, Computer Science Department, Intellctics Group, Darmstad, Germany, (1998
24. M.F. Tasgetiren, M. Sevkli, Y.C. Liang, and G. Gencyilmaz, Particle swarm optimization algorithm for permutation flowshop sequencing problem, In: Proceedings of the 4th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2004), LNCS 3172, Brussels, Belgium, (2004) 382-390
25. M.F.Tasgetiren, Y.C. Liang, M. Sevkli, G. Gencyilmaz, Particle swarm optimization algorithm for makespan and total f10wtime minimization in the permutation f1owshop sequencing problem, European Journal of Operational Research, in press (2006
26. C-J. Liao, C-T. Tseng, P. Luarn, A discrete version of particle swarm optimization for flowshop scheduling problems, Computers and Operations Research, in Press
27. R. Ruiz, C. Maroto, J. Alcaraz, Two new robust genetic algorithms for the flowshop scheduling problems, OMEGA 34 (2006) 461-476
28. R. Ruiz, T. Stutzle, A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem, European Joumal of Operational Research, in press (2006
29. E. Taillard, Benchmarks for basic scheduling problems, European Journal of Operational Research 64 (1993) 278-285
30. R.C. Eberhart and J. Kennedy, A new optimizer using particle swarm theory, In: Proceed-ings of the Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, (1995) 39-43
31. J. Kennedy, R.C. Eberhart, and Y. Shi, Swarm Intelligence, San Mateo, Morgan Kaufmann, CA, USA, (2001
32. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem with makespan criterion, In: Proceedings of the International Workshop on UK Planning and Scheduling Special Interest Group (PLANSIG2005), City University, London, UK, (2005) 34-43
33. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for t.he no-wait. Ilowshop scheduling problem wit.h makespan and t.otal ftowt.ime crit.eria, (Under review by Computers and Operations Research
34. Q.K. Pan, M.F. Tasgetiren, and Y.C. Liang, A discrete particle swarm optimization algorithm for the single-machine total weighted earliness and tardiness penalties with a com-mon due date, In: Proceeding of the World Congress on Evolutionary Computation (CEC06), accepted (2006
35. Q.K. Pan, M.F. Tasgetiren, and YC. Liang, Minimizing total earliness and tardiness penalties with a common due date on single machine using a discrete particle swarm optimization algorithm, In: Proceedings of the 5th International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS2006), Accepted (2006
36. E. Taillard, Summary of best known lower and upper bounds of Taillard's instances. Available in http://ina2.eivd.ch/ collaborateurs/ etd/ problemes.dir/ ordonnancement. dir/ ordonnancement.html