{"id":{"repo_id":"clemson","oai_identifier":"oai:open.clemson.edu:all_theses-5591"},"canonical_url":"https://search.ndltd.org/etd/clemson/oai:open.clemson.edu:all_theses-5591","repository":{"repo_id":"clemson","name":"Clemson University","base_url":"https://open.clemson.edu/do/oai/"},"display":{"title":"Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times","abstract":"This thesis proposes a new variation to the Random Key Genetic Algorithm (RKGA) for scheduling optimization in flexible flow line manufacturing with sequence dependent setup times. The proposed RKGA representation decodes scheduling information independently at each stage, unlike the traditional RKGA, which is only sequenced based on the first stage, limiting flexibility. The proposed method's performance is compared to the traditional method with varying numbers of jobs and stages. It is compared regarding performance ratio and statistical significance of differences through the Wilcoxon Signed Rank Test. Results show that the proposed RKGA outperformed traditional RKGA in high complexity (8 Stage system) and low complexity scenarios, and the traditional RKGA performs better and more consistently. This thesis demonstrates that a dynamic chromosome can impact solution quality.","abstract_html":"This thesis proposes a new variation to the Random Key Genetic Algorithm (RKGA) for scheduling optimization in flexible flow line manufacturing with sequence dependent setup times. The proposed RKGA representation decodes scheduling information independently at each stage, unlike the traditional RKGA, which is only sequenced based on the first stage, limiting flexibility. The proposed method&#x27;s performance is compared to the traditional method with varying numbers of jobs and stages. It is compared regarding performance ratio and statistical significance of differences through the Wilcoxon Signed Rank Test. Results show that the proposed RKGA outperformed traditional RKGA in high complexity (8 Stage system) and low complexity scenarios, and the traditional RKGA performs better and more consistently. This thesis demonstrates that a dynamic chromosome can impact solution quality.","abstract_has_math":false,"creators":["Anbuvanan, Aadithan"],"institution":null,"degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Industrial Engineering","degree_department":null,"school":null,"contributors":["Mary E. Kurz","Emily Tucker","David M. Neyens"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T07:33:22Z","subjects":["Scheduling","Heuristics","Genetic algorithms","Flexible flow line","Industrial Engineering","Operational Research"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[],"person_identifier_entries":[]},"links":{"outbound_url":"https://open.clemson.edu/all_theses/4448","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://open.clemson.edu/all_theses/4448","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-5591","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Mary E. Kurz","Emily Tucker","David M. Neyens"]},{"key":"dc:creator","label":"Author","values":["Anbuvanan, Aadithan"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2025-04-21T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2025-05-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":["Scheduling","Heuristics","Genetic algorithms","Flexible flow line","Industrial Engineering","Operational Research"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://open.clemson.edu/all_theses/4448"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["This thesis proposes a new variation to the Random Key Genetic Algorithm (RKGA) for scheduling optimization in flexible flow line manufacturing with sequence dependent setup times. The proposed RKGA representation decodes scheduling information independently at each stage, unlike the traditional RKGA, which is only sequenced based on the first stage, limiting flexibility. The proposed method's performance is compared to the traditional method with varying numbers of jobs and stages. It is compared regarding performance ratio and statistical significance of differences through the Wilcoxon Signed Rank Test. Results show that the proposed RKGA outperformed traditional RKGA in high complexity (8 Stage system) and low complexity scenarios, and the traditional RKGA performs better and more consistently. This thesis demonstrates that a dynamic chromosome can impact solution quality."]},{"key":"dc:title","label":"Title","values":["Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times"]}]}],"canonical_facts":{"dc:contributor":["Mary E. Kurz","Emily Tucker","David M. Neyens"],"dc:creator":["Anbuvanan, Aadithan"],"dc:date.available":["2025-04-21T07:00:00Z"],"dc:date.created":["2025-05-01T07:00:00Z"],"dc:description.abstract":["This thesis proposes a new variation to the Random Key Genetic Algorithm (RKGA) for scheduling optimization in flexible flow line manufacturing with sequence dependent setup times. The proposed RKGA representation decodes scheduling information independently at each stage, unlike the traditional RKGA, which is only sequenced based on the first stage, limiting flexibility. The proposed method's performance is compared to the traditional method with varying numbers of jobs and stages. It is compared regarding performance ratio and statistical significance of differences through the Wilcoxon Signed Rank Test. Results show that the proposed RKGA outperformed traditional RKGA in high complexity (8 Stage system) and low complexity scenarios, and the traditional RKGA performs better and more consistently. This thesis demonstrates that a dynamic chromosome can impact solution quality."],"dc:identifier":["https://open.clemson.edu/all_theses/4448"],"dc:subject":["Scheduling","Heuristics","Genetic algorithms","Flexible flow line","Industrial Engineering","Operational Research"],"dc:title":["Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times"],"thesis:degree_discipline":["Industrial Engineering"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T07:33:22Z"}