An improved event selection technique in a modified PSO algorithm to solve class scheduling problems

2009 IEEE Symposium on Industrial Electronics and Applications, ISIEA 2009 - Proceedings

Volumn 1, Issue , 2009, Pages 203-208

  Aziz, Mohd Azri Abdul ^a   Taib, Mohd Nasir ^a   Hussin, Naimah Mohd ^a  

^a UNIVERSITI TEKNOLOGI MARA   (Malaysia)

Author keywords

Particle swarm optimization; Scheduling; Timetabling

Indexed keywords

CLASS SCHEDULING; EARLY CONVERGENCE; EVENT SELECTION; EXECUTION TIME; INITIAL SOLUTION; ITERATION STEP; ITERATIVE PROCESS; OPTIMIZATION ALGORITHMS; PARTICLE SWARM; PENALTY REDUCTION; PSO ALGORITHMS; TABU LIST; TABU SEARCH ALGORITHMS; TIME SLOTS; TIMETABLING;

INDUSTRIAL ELECTRONICS; LEARNING ALGORITHMS; TABU SEARCH;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 76449109835     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIEA.2009.5356466     Document Type: Conference Paper

References (14)

1. N. Arous, S. B. Abdallah, and N. Ellouze, "Evolutionary Potential Timetables Optimization by Means of Genetic and Greedy Algorithms," in Proc. 1999 International Conference on Information Intelligence and Systems, 1999, pp. 24-31.
2. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and Q. X. Wang, "Particle swarm optimization-based algorithms for TSP and generalized TSP," Information Processing Letters, vol. 103, pp. 169-176, 2007.
3. C. Akjiratikarl, P. Yenradee, and P. R. Drake, "PSO-based algorithm for home care worker scheduling in the UK," Computers & Industrial Engineering, vol. 53, pp. 559-583, 2007.
4. B. Liu, L. Wang, and Y. H. Jin, "An effective hybrid PSObased algorithm for flow shop scheduling with limited buffers," Computers & Operations Research, vol. 35, pp. 2791-2806, 2008.
5. A. Salman, I. Ahmad, and S. Al-Madani, "Particle swarm optimization for task assignment problem," Microprocessors and Microsystems, vol. 26, pp. 363-371, 2002.
6. W. Kang-Ping, H. Lan, Z. Chun-Guang, and P. Wei, "Particle swarm optimization for traveling salesman problem," in Proc. 2003 International Conference on Machine Learning and Cybernetics, 2003, vol. 3, pp. 1583-1585.
7. I. H. Kuo, S. J. Horng, T. W. Kao, T. L. Lin, C. L. Lee, T. Terano, and Y. Pan, "An efficient flow-shop scheduling algorithm based on a hybrid particle swarm optimization model," Expert Systems with Applications, vol. In Press, Corrected Proof.
8. P. Y. Yin, S. S. Yu, P. P. Wang, and Y. T. Wang, "Multiobjective task allocation in distributed computing systems by hybrid particle swarm optimization," Applied Mathematics and Computation, vol. 184, pp. 407-420, 2007.
9. Z. Lian, X. Gu, and B. Jiao, "A novel particle swarm optimization algorithm for permutation flow-shop scheduling to minimize makespan," Chaos, Solitons & Fractals, vol. 35, pp. 851-861, 2008.
10. M. F. Tasgetiren, Y. C. Liang, M. Sevkli, and G. Gencyilmaz, "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," European Journal of Operational Research, vol. 177, pp. 1930-1947, 2007.
11. G. N. Beligiannis, C. N. Moschopoulos, G. P. Kaperonis, and S. D. Likothanassis, "Applying evolutionary computation to the school timetabling problem: The Greek case," Computers & Operations Research, vol. 35, pp. 1265-1280, 2008.
12. V. Bhatt and R. Sahajpal, "Lecture timetabling using hybrid genetic algorithms," in Proc. International Conference on Intelligent Sensing and Information Processing, 2004, pp. 29-34.
13. K. L. Huang and C. J. Liao, "Ant colony optimization combined with taboo search for the job shop scheduling problem," Comput. Oper. Res., vol. 35, pp. 1030-1046, 2008.
14. B. Yagmahan and M. M.Yenisey, "Ant colony optimization for multi-objective flow shop scheduling problem," Comput. Ind. Eng., vol. 54, pp. 411-420, 2008.