Multi-objective particle swarm optimization algorithm for scheduling in flowshops to minimize makespan, total flowtime and completion time variance

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 4012-4018

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

^a Polytechnic College   (India)

^b MONASH UNIVERSITY MALAYSIA   (Malaysia)

^c AMRITA UNIVERSITY   (India)

^d Acetech Computer Education   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLETION TIME VARIANCE; LOCAL SEARCH MECHANISM; MULTIOBJECTIVE FLOWSHOP;

PARETO PRINCIPLE; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING; SCHEDULING;

EVOLUTIONARY ALGORITHMS;

EID: 79955239297     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424994     Document Type: Conference Paper

References (29)

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. D.G. Dannenbring, "An evaluation of flow shop sequencing heuristics," .Management Science, vol. 23, pp. 1174-1182, 1977.
4. 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.
5. 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.
6. C. Rajendran and H. Ziegler, "Ant-colony algorithms for minimizing total flowtime in permutation flow shops", Computers & Industrial engineering, vol. 48, pp 789-797, 2005.
7. C. Rajendran and H. Ziegler, "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan / total flowtime of jobs," European Journal of Opn. Research, vol. 155, pp. 426-438, 2004.
8. Yuvraj Gajpal and Chandrasekharan Rajendran, "An ant-colony algorithms for minimizing the completion time variance of jobs in flowshop," International Journal of Production Economics, 2005.
9. Viswanath Kumar Ganesan, Appa Iyer Sivakumar and G. Srinivasan, "Hierarchical minimization of completion time variance and makespan injobshops", Computers &OperationsResearch, vol. 33, pp 1345-1367, 2006.
10. R.K. Suresh and K.M. Mohanasundaram, "Pareto archived simulated annealing for permutation flow shop scheduling with multiple objectives", Proceedings of the IEEE conference on Cybermatics and Intelligent Systems, 1-3 Dec 2004, Singapore
11. W. Kusiak, "Completion time variance minimization on a single machine is difficult," Operations Research Letters, vol.14, pp. 49-59, 1993.
12. 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.
13. 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.
14. max flow shop problem," Computers and Operations Research, vol. 17, pp 243 -253, 1990.
15. 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.
16. K. Rameshkumar, R.K. Suresh and K.M. Mohana sundaram, "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.
17. Faith Tasgetiren, Mehmet Sevkli, Yen-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.
18. G. Prabhaharan, B. Shahul Hamid Khan, P. Asokan and M. Thiyagu, "A Particle swarm optimization 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.
19. Kalyanmoy Deb, "Multi-Objective Optimization Using Evolutionary Algorithms ", First Edition, .John Wiley & Sons, 2003.
20. T. Pasupathy, Chandrasekharan Rajendran and R.K. Suresh, "A multi-objective genetic algorithm for scheduling in flow shops to minimize makespan and total flow time", International Journal of Advanced Manufacturing Technology, Publisher: Springer-Verlag London Ltd, vol. 27, pp 804-815, 2006.
21. Chandrasekharan Rajendran, "Heuristics for scheduling in flowshop with multiple objectives", European Journal of Operational Research,vol. 82, pp 540-555, 1995.
22. Ali Allahverdi, "The two- and m- machine flowshop scheduling problems with bi-criteria of makespan and mean flowtime", European Journal of Operational Research, vol. 147, pp 373-396, 2003
23. Ali Allahverdi, "A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness", Computers & Operations Research, vol. 31, pp 157-180, 2004.
24. Vincent T'kindt, Nicolas Monmarche, Fabrice Tercinet and Daniel Laugt, "An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem", European Journal of Operational Research, vol. 142, pp 250-257, 2002.
25. Hisao Ishibuchi, Tadashi Yoshida and Tadahiko Murata, "Balance between genetic search and local search in memtic algorithms for multi objective permutation flowshop scheduling", IEEE Transactions on evolutionary computation, vol. 7, No. 2, pp 204-223, 2003.
26. R.C. Eberhart, J. Kennedy, "A new optimizer-using particle swarm theory," In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science, Japan, pp.39-43, 1995.
27. J. Kennedy, R.C. Eberhart and Y. Shi, "Swarm Intelligence," Morgan Kaufmann, San Mateo, CA, USA, 2001
28. Yuhui Shi, "Particle Swarm Optimization," IEEE Neural Networks Society, pp. 8-13, Feb 2004.
29. S. Chandrasekaran, S.G. Ponnambalam, R.K. Suresh, N. Vijayakumar. "An Application of Particle Swarm Optimization Algorithm to Permutation Flowshop Scheduling Problems to Minimize Makespan, Total Flowtime and Completion Time Variance," In Proceedings of the IEEE International Conference on Automation Science and Engineering, 2006 (CASE '06.), Shanghai, China, pp. 513-518, ISBN: 1-4244-0311-1.