Back to search

Clemson University

Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling

Abstract

dc:description.abstract

Previous research on scheduling flexible flow lines (FFL) to minimize makespan has utilized approaches such as branch and bound, integer programming, or heuristics. Metaheuristic methods have attracted increasing interest for solving scheduling problems in the past few years. Particle swarm optimization (PSO) is a population-based metaheuristic method which finds a solution based on the analogy of sharing useful information among individuals. In the previous literature different PSO algorithms have been introduced for various applications. In this research we study some of the PSO algorithms, continuous and discrete, to identify a strong PSO algorithm in scheduling flexible flow line to minimize the makespan. Then the effectiveness of this PSO algorithm in FFL scheduling is compared to genetic algorithms. Experimental results suggest that discrete particle swarm performs better in scheduling of flexible flow line with makespan criteria compared to continuous particle swarm. Moreover, combining discrete particle swarm with a local search improves the performance of the algorithm significantly and makes it competitive with the genetic algorithm (GA).

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Industrial Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Amiri, Parastoo
Contributors dc:contributor
  • Dr. Mary E. Kurz
  • Dr. Scott J. Mason
  • Dr. Amin Khademi

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/2087

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Amiri, Parastoo. Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling. Thesis thesis, https://open.clemson.edu/all_theses/2087