Optimization of the Flow-Shop Scheduling Problem under Time Constraints with PSO Algorithm

Abstract

This study aims to minimize the makespan objective function in a Flow-Shop environment, considering two crucial temporal constraints: “Waiting time” and “Release date”. Given the NP-hardness of this scheduling problem, we employed an enhanced metaheuristic called particle swarm optimization (PSO) to find the optimal solution. Through a series of experiments conducted on a specific set of benchmark instances, we evaluated the performance of our approach by comparing the obtained results against the lower bound (LB). This comparison showcased the effectiveness of our proposed method in addressing this complex scheduling problem.

Keywords

• flow-shop scheduling problem
• release date
• waiting time
• makespan
• particle swarm optimization