A Literature Review: Particle Swarm Optimization (PSO) Algorithm for Scheduling Problems

Authors

  • Shofiyyah Asrida Universitas Sumatera Utara
  • Juliza Hidayati Universitas Sumatera Utara
  • Rosnani Ginting Universitas Sumatera Utara

DOI:

https://doi.org/10.32734/jsti.v28i3.25584

Keywords:

Combinatorial Optimization, Literature Review, Metaheuristic Scheduling, Particle Swarm Optimization, Swarm Intelligence

Abstract

Scheduling is a fundamental combinatorial optimization problem that arises in numerous real-world domains, including manufacturing, cloud computing, healthcare, and transportation. Particle Swarm Optimization (PSO), inspired by the collective behaviour of bird flocking and fish schooling, has emerged as one of the most effective and widely applied metaheuristic approaches for solving scheduling problems. This systematic literature review synthesizes research published between 2004 and 2024, examining 35 peer-reviewed journal articles and conference papers to provide a comprehensive analysis of PSO applications, variants, and performance outcomes in scheduling. The review identifies key research trends, categorizes PSO variants, including Standard PSO, Hybrid PSO, Multi-Objective PSO, Adaptive PSO, and Quantum PSO, and evaluates their performance across different scheduling contexts. The findings indicate that Hybrid PSO approaches consistently outperform Standard PSO in terms of solution quality, while Adaptive PSO demonstrates superior convergence behaviour in dynamic environments. Current challenges, including premature convergence, scalability limitations, and parameter sensitivity, are highlighted alongside existing research gaps and potential directions for future research.

Downloads

Download data is not yet available.

References

[1] M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, 5th ed. Springer, 2016.

[2] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: W. H. Freeman, 1979.

[3] J. Kennedy and R. Eberhart, "Particle swarm optimisation," in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, 1995.

[4] R. Poli, J. Kennedy, and T. Blackwell, "Particle swarm optimisation: An overview," Swarm Intelligence, vol. 1, no. 1, pp. 33–57, 2007.

[5] D. Y. Sha and C. Y. Hsu, "A hybrid particle swarm optimisation for job shop scheduling problem," Computers & Industrial Engineering, vol. 51, no. 4, pp. 791–808, 2006.

[6] Z. Lian, X. Gu, and B. Jiao, "A similar particle swarm optimisation algorithm for permutation flowshop scheduling to minimise makespan," Applied Mathematics and Computation, vol. 175, no. 1, pp. 773–785, 2006.

[7] J. Ding, S. Schulz, L. Shen, U. Buscher, and Z. Lü, "Energy-aware scheduling in flexible flow shops with hybrid particle swarm optimization," Computers & Operations Research, vol. 125, Art. no. 105088, Jan. 2021.

[8] Y. Wang and X. Zuo, "An effective cloud workflow scheduling approach combining PSO and idle time slot-aware rules," IEEE/CAA Journal of Automatica Sinica, vol. 8, no. 5, pp. 1079–1094, 2021.

[9] S. Kaya, A. Gümüşçü, İ. B. Aydilek, T. Saraç, and A. Allahverdi, "Solution for flow shop scheduling problems using chaotic hybrid firefly and particle swarm optimization algorithm with improved local search," Soft Computing, vol. 25, no. 9, pp. 7143–7154, 2021.

[10] S. Nabi, M. Ahmad, M. Ibrahim, and H. Hamam, "AdPSO: Adaptive PSO-based task scheduling approach for cloud computing," Sensors, vol. 22, no. 3, Art. no. 920, 2022.

[11] A. I. Awad, M. M. Fouda, M. M. Khashaba, E. R. Mohamed, and K. M. Hosny, "Efficient workflow scheduling in fog-cloud collaboration using a hybrid IPSO-GWO algorithm," Scientific Reports, vol. 15, Art. no. 13591, 2025.

[12] Y. Shi and R. Eberhart, "A modified particle swarm optimiser," in Proceedings of the IEEE World Congress on Computational Intelligence, pp. 69–73, 1998.

[13] R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, "Optimization and approximation in deterministic sequencing and scheduling: A survey," Annals of Discrete Mathematics, vol. 5, pp. 287–326, 1979.

[14] J. Blazewicz, K. H. Ecker, E. Pesch, G. Schmidt, M. Sterna, and J. Weglarz, Handbook on Scheduling: From Theory to Practice. Cham, Switzerland: Springer, 2019.

[15] D. Moher, A. Liberati, J. Tetzlaff, and D. G. Altman, "Preferred reporting items for systematic reviews and meta-analyses: The PRISMA statement," PLOS Medicine, vol. 6, no. 7, Art. no. e1000097, 2009.

[16] M. F. Tasgetiren, Y. C. Liang, M. Sevkli, and G. Gencyilmaz, "A particle swarm optimisation algorithm for makespan and total flowtime minimisation in the permutation flowshop sequencing problem," European Journal of Operational Research, vol. 177, no. 3, pp. 1930–1947, 2007.

[17] Z. H. Zhan, J. Zhang, Y. Li, and H. S. H. Chung, "Adaptive particle swarm optimisation," IEEE Transactions on Systems, Man, and Cybernetics, Part B, vol. 39, no. 6, pp. 1362–1381, 2009.

[18] C. Akkan and A. Gulcu, "A bi-criteria hybrid genetic algorithm with robustness objective for the course timetabling problem," Computers & Operations Research, vol. 90, pp. 22–32, Feb. 2018.

[19] Y. Xie et al., "A novel directional and non-local-convergent particle swarm optimization based workflow scheduling in cloud-edge environment," Future Generation Computer Systems, vol. 97, pp. 361–378, 2019.

[20] C. A. Coello Coello, G. T. Pulido, and M. S. Lechuga, "Handling multiple objectives with particle swarm optimization," IEEE Transactions on Evolutionary Computation, vol. 8, no. 3, pp. 256–279, Jun. 2004.

[21] Q. K. Pan, M. F. Tasgetiren, and Y. C. Liang, "A discrete differential evolution algorithm for the permutation flowshop scheduling problem," Computers & Industrial Engineering, vol. 55, no. 4, pp. 795–816, 2008.

[22] M. Farid, R. Latip, M. Hussin, and N. A. W. Abdul Hamid, "A survey on QoS requirements based on particle swarm optimization scheduling techniques for workflow scheduling in cloud computing," Symmetry, vol. 12, no. 4, Art. no. 551, Apr. 2020.

[23] J. Xiong, L. Xing, and Y. Chen, "Robust scheduling for multi-objective flexible job-shop problems with random machine breakdowns," International Journal of Production Economics, vol. 141, no. 1, pp. 112–126, 2012.

[24] J. Tang, G. Zhang, B. Lin, and B. Zhang, "A Hybrid Algorithm for Flexible Job-Shop Scheduling Problem," Procedia Engineering, vol. 15, pp. 3678–3683, 2011.

[25] N. Singh and S. B. Singh, "Hybrid Algorithm of Particle Swarm Optimization and Grey Wolf Optimizer for Improving Convergence Performance," Journal of Applied Mathematics, vol. 2017, Art. ID 2030489, 2017.

[26] L. Zuo, L. Shu, S. Dong, C. Zhu, and T. Hara, "A multi-objective optimisation scheduling method based on the ant colony algorithm in cloud computing," IEEE Access, vol. 3, pp. 2687–2699, 2015.

[27] S. Pandey, L. Wu, S. M. Guru, and R. Buyya, "A particle swarm optimization-based heuristic for scheduling workflow applications in cloud computing environments," in Proceedings of the 24th IEEE International Conference on Advanced Information Networking and Applications, pp. 400–407, 2010.

[28] M. Hadwan, M. Ayob, N. R. Sabar, and R. Qu, "A harmony search algorithm for nurse rostering problems," Information Sciences, vol. 233, pp. 126–140, 2013.

[29] M. Dehghani, E. Trojovská, and P. Trojovský, "A new human-based metaheuristic algorithm for solving optimisation problems on the base of simulation of driving training process," Scientific Reports, vol. 12, Art. no. 9924, 2022.

[30] Y. J. Gong, J. Zhang, O. Liu, R. Z. Huang, H. S. H. Chung, and Y. Shi, "Optimising the vehicle routing problem with time windows: A discrete particle swarm optimisation approach," IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, vol. 42, no. 2, pp. 254–267, Mar. 2012.

[31] O. J. Ibarra-Rojas, F. Delgado, R. Giesen, and J. C. Muñoz, "Planning, operation, and control of bus transit systems: A literature review," Transportation Research Part B: Methodological, vol. 77, pp. 38–75, 2015.

[32] 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, no. 4, pp. 1265–1280, Apr. 2008.

[33] C. Nothegger, A. Mayer, A. Chwatal, and G. R. Raidl, "Solving the post enrolment course timetabling problem by ant colony optimisation," Annals of Operations Research, vol. 194, no. 1, pp. 325–339, 2012.

[34] M. López-Ibáñez, J. Dubois-Lacoste, L. P. Cáceres, M. Birattari, and T. Stützle, "The irace package: Iterated racing for automatic algorithm configuration," Operations Research Perspectives, vol. 3, pp. 43–58, 2016.

[35] M. Clerc and J. Kennedy, "The particle swarm—Explosion, stability, and convergence in a multidimensional complex space," IEEE Transactions on Evolutionary Computation, vol. 6, no. 1, pp. 58–73, Feb. 2002.

Downloads

Published

2026-07-31

How to Cite

Asrida, S., Hidayati, J., & Ginting, R. (2026). A Literature Review: Particle Swarm Optimization (PSO) Algorithm for Scheduling Problems. Jurnal Sistem Teknik Industri, 28(3), 166–179. https://doi.org/10.32734/jsti.v28i3.25584

Similar Articles

<< < > >> 

You may also start an advanced similarity search for this article.