The Discrete Particle Swarm Optimization Algorithms for Permutation Flowshop Scheduling Problem

Ikhlasul Amallynda (Department of Industrial Engineering, University Of Muhammadiyah Malang, Indonesia)

Jurnal Teknik Industri
Vol. 20 No. 2 (2019): August

In this paper, two types of discrete particle swarm optimization (DPSO) algorithms are presented to solve the Permutation Flow Shop Scheduling Problem (PFSP). We used criteria to minimize total earliness and total tardiness. The main contribution of this study was that a new position update method is developed based on the discrete domain because PFSP is represented as discrete job permutations. In addition, this article also comes with a simple case study to ensure that both the proposed algorithm can solve the problem well in a short computational time. Hybrid Discrete Particle Swarm Optimization (HDPSO) has a better performance than the Modified Particle Swarm Optimization (MPSO). The HDPSO produced the optimal solution. However, it has a slightly longer computation time. Besides, the population size and maximum iteration impact the quality of solutions produced by HDPSO and MPSO algorithms.