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.
Previous Article in event Previous Article in session
Next Article in event
Characterizing the biological behavior of Fe3O4 nanoparticles conjugated with acridine orange using in vitro co-culture systems relevant to skin, lung and gut barrier modelsNext Article in session
Optimization of the Flow-Shop Scheduling Problem under Time Constraints with PSO Algorithm.
Published: 27 October 2023 by MDPI in 4th International Electronic Conference on Applied Sciences session Computing and Artificial Intelligence
Keywords: Flow-Shop Scheduling Problem; Release date; Waiting time; Makespan; Particle Swarm Optimization.