The Discrete Particle Swarm Optimization Algorithms for Permutation Flowshop Scheduling Problem

Abstract

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 is 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 proposed algorithm can solve the problem well in the short computational time. The result of 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 have any impact on the quality of solutions produced by HDPSO and MPSO algorithms

Novel Heuristic Algorithm for Flexible Job Shop Scheduling based on the Longest Processing Time Rules to Minimize Makespan

“…Each stage represents an operation on a particular machine. Research dealing with flow shop scheduling is done by [13][14][15][16][17][18][19]. Compared to FS, the JS situation happens when the jobs have various stage sequence requirements and mostly do not necessarily have the same number of stages [1].…”