An application of particle swarm optimization algorithm to permutation flowshop scheduling problems to minimize makespan, total flowtime and completion time variance

2006 IEEE International Conference on Automation Science and Engineering, CASE

Volumn , Issue , 2006, Pages 513-518

  Chandrasekaran, S ^a   Suresh, R K ^b   Ponnambalam, S G ^c   Vijayakumar, N ^d  

^a Sri Ramakrishna Mission Vidyalaya College of Arts and Science   (India)

^b AMRITA SCHOOL OF ENGINEERING   (India)

^c MONASH UNIVERSITY MALAYSIA   (Malaysia)

^d Acetech Computer Education   (India)

Author keywords

Flowshop scheduling; Makespan; Particle swarm optimization algorithm; Total flowtime and completion time variance

Indexed keywords

SCHEDULING;

COMPLETION TIME; COMPLETION TIME VARIANCE; FLOW SHOP SCHEDULING PROBLEM; FLOW-SHOP SCHEDULING; MAKESPAN; MINIMIZING MAKESPAN; PARTICLE SWARM OPTIMIZATION ALGORITHM; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 45149088909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/COASE.2006.326934     Document Type: Conference Paper

References (33)

1. E. Taillard, "Benchmarks for the basic scheduling problem," European Journal of Operational Research, vol. 64, pp. 278 - 285, 1993.
2. E. Ignall, and L. Scharge, "Application of the branch and bound technique to some flow shop-scheduling problems," Operations Research, vol. 13, pp. 400-412, 1965.
3. H. G. Campbell., R.A. Dudek, and M.L. Smith, "A heuristic algorithm for the n-job, m-machine sequencing problem," Management Science, vol. 16/b, pp. 630-637, 1970.
4. D.G. Dannenbring, "An evaluation of flow shop sequencing heuristics," Management Science, vol. 23, pp. 1174-1182, 1977.
5. M. Nawaz, E.E Enscore, and I. Ham, "A heuristic algorithm for the m machine n job flow shop-sequencing problem", Omega, vol. 11, pp. 91-98, 1983.
6. I. Osman, and C.N. Potts, "Simulated annealing for permutation flow shop scheduling," mega, vol. 17, pp. 551 - 557, 1989.
7. M. Ben-Daya, M.A.I. Fawzan, "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, vol. 109, pp. 88 - 95, 1998.
8. J.M. Framinan, R. Leisten, "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," OMEGA, vol. 31, pp. 311-317, 2003.
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, vol. 141, pp. 559-569, 2002.
10. R. Ruiz, and C. Maroto, "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, vol. 165, pp. 479-494, 2005.
11. M.R. Garey, D.S. Johnson, and R. Sethi, "The complexity of flow shop and shop job scheduling," Mathematics of Operation Research, vol. 1, pp. 117-129, 1976.
12. A.H.G. Rinnooy Kan, 1976, Machine Scheduling Problems: Classification, Complexity, and Computations, Nijhoff, The Hague.
13. W. Kubiak, "Completion time variance minimization on a single machine is difficult," Operations Research Letters vol.14, pp. 49-59, 1993.
14. R.A. Dudek, S.S. Panwalkar, and M.L. Smith, "The lessons of flowshop scheduling research," Operations Research, vol. 40, No. 1, pp. 7-13, 1992.
15. A. Reisman, A. Kumar, J. Motwani, J, "Flowshop scheduling/sequencing research: A statistical review of the literature," 1952-1994. IEEE Transactions, 1994.
16. C.L. Chen., V.S. Vempati, and N. Aljaber, "An application of genetic algorithms for flow shop problems," European Journal of Operational Research, vol. 80, pp. 389-396, 1995.
17. T. Murata, H. Ishibuchi, and H. Tanaka, "Genetic algorithms for flow shop scheduling problems," Computers and Industrial Engineering, vol. 30, pp. 1061-1071, 1996.
18. J. Sridhar and C. Rajendran, "Scheduling in flow shop and cellular manufacturing system with multiple objectives-A genetic algorithmic approach," Production Planning and Control, vol.74, pp. 374-382, 1996.
19. F.T.S. Chan, T.C. Wong, T.C. and L.Y. Chan, "A genetic algorithm-based approach to machine assignment problem," International Journal of Production Research, Vol. 43, No. 12, pp. 2451-2472, 2005.
20. F.A. Ogbu, and D.Smith., "The application of the simulated annealing algorithm to the solution of the n /m /cmax flow shop problem," Computers and Operations Research, vol. 17, pp. 243-253, 1990.
21. R.W. Eglese, "Simulated Annealing: a tool for operational research," European Journal of Operational Research, vol. 46, pp. 271-281, 1990.
22. J. V. Moccellin, M.S. Nagamo, "Evaluating the performance of tabu search procedures for flow shop sequencing, Journal of the Operational Research Society, vol. 49, pp. 1296 - 1302, 1998.
23. Fatih Tasgetiran, Mehmet Sevkli, Yun-Chia Liang And Gunes Gencyilmaz., "Particle swarm optimization algorithm for single machine total weighted tardiness problem, IEEE Transaction on Power and Energy Systems, pp. 1412 - 1419, 2004.
24. K. Rameshkumar. R.K., Suresh, and K.M. Mohanasundaram "Discrete particle swarm optimization (DPSO) algorithm for permutation flow shop scheduling to minimize makespan," Lecture Notes In Computer Science, Springer Verlag- GMBH. 0302-9743. vol. 3612, pp. 2005.
25. G. Prabharan, B. Shahul Hamid Khan, P. Asokan, and M. Thiyagu, "Algorithm for permutation flow shop scheduling with regular and non-regular measures," International Journal of Applied Management and Technology, vol. 3, No. 1, pp 171-182, 2005.
26. R. Eberhart, J. Kennedy, "A new optimizer-using particle swarm theory," In: Proceedings of the Sixth International Symposium on Micro-machine and Human science," Japan, 1995, pp. 39-43.
27. J. Kennedy, R. Eberhart and Y. Shi, Swarm Intelligence, Morgan Kaufmann, San Mateo, CA, USA, 2001.
28. Shi, Y., Eberhart, R., 1999. Empirical Study of Particle Swarm Optimization. Proceedings of Congress on Evolutionary Computation, p.1945-1950. Shigenori, N., Takamu, G.J., Toshiki, Y., Yoshikazu, F., 2003.
29. Yuhui Shi, "Particle Swarm Optimization," IEEE neural networks society, pp. 8-13, Feb 2004.
30. J. Liu, C.R. Reeves, Constructive and composite heuristic solutions to the P || Σ Ci scheduling problem," European Journal of Operational Research, vol. 132, pp. 439-452, 2001.
31. C. Rajendran, H. Ziegler, "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," European Journal of Operational Research, vol. 155, No. 2, pp. 426-438, 2004.
32. Gowrishankar, K., Rajendran, C., Srinivasan, G., 2001. Flow shop scheduling algorithms for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date. European Journal of Operational Research 132, 643-665.
33. Yuvraj Gajpal, Chandrasekharan Rajendran, "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops", Int. J. Production Economics, In Press.