{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-3093"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-3093","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling","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).","abstract_html":"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).","abstract_has_math":false,"creators":["Amiri, Parastoo"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Dr. Mary E. Kurz","Dr. Scott J. Mason","Dr. Amin Khademi"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:11:43Z","subjects":["Flexible Flow Line","Makespan","Metaheuristic","Particle Swarm Optimization"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/2087","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/2087","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://open.clemson.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Aopen.clemson.edu%3Aall_theses-3093","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Dr. Mary E. Kurz","Dr. Scott J. Mason","Dr. Amin Khademi"]},{"key":"dc:creator","label":"Author","values":["Amiri, Parastoo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2015-09-30T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2015-04-01T07:00:00Z"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Industrial Engineering"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Flexible Flow Line","Makespan","Metaheuristic","Particle Swarm Optimization"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/2087"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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)."]},{"key":"dc:title","label":"Title","values":["Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling"]}]}],"canonical_facts":{"dc:contributor":["Dr. Mary E. Kurz","Dr. Scott J. Mason","Dr. Amin Khademi"],"dc:creator":["Amiri, Parastoo"],"dc:date.available":["2015-09-30T07:00:00Z"],"dc:date.created":["2015-04-01T07:00:00Z"],"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)."],"dc:identifier":["https://open.clemson.edu/all_theses/2087"],"dc:subject":["Flexible Flow Line","Makespan","Metaheuristic","Particle Swarm Optimization"],"dc:title":["Discrete Particle Swarm Optimization for Flexible Flow Line Scheduling"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:11:43Z"}