Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times
Сохранить в:
| Опубликовано в:: | ProQuest Dissertations and Theses (2025) |
|---|---|
| Главный автор: | |
| Опубликовано: |
ProQuest Dissertations & Theses
|
| Предметы: | |
| Online-ссылка: | Citation/Abstract Full Text - PDF |
| Метки: |
Нет меток, Требуется 1-ая метка записи!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3235005503 | ||
| 003 | UK-CbPIL | ||
| 020 | |a 9798290643489 | ||
| 035 | |a 3235005503 | ||
| 045 | 2 | |b d20250101 |b d20251231 | |
| 084 | |a 66569 |2 nlm | ||
| 100 | 1 | |a Anbuvanan, Aadithan | |
| 245 | 1 | |a Multistage Random Key Genetic Algortihm Optimization for Scheduling Flexible Flow Lines with Sequence Depenedent Setup Times | |
| 260 | |b ProQuest Dissertations & Theses |c 2025 | ||
| 513 | |a Dissertation/Thesis | ||
| 520 | 3 | |a 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. | |
| 653 | |a Scheduling | ||
| 653 | |a Gene expression | ||
| 653 | |a Mutation | ||
| 653 | |a Genetic algorithms | ||
| 653 | |a Genetic engineering | ||
| 653 | |a Chromosomes | ||
| 653 | |a Design | ||
| 653 | |a Job shops | ||
| 653 | |a Python | ||
| 653 | |a Optimization algorithms | ||
| 653 | |a Traveling salesman problem | ||
| 773 | 0 | |t ProQuest Dissertations and Theses |g (2025) | |
| 786 | 0 | |d ProQuest |t ProQuest Dissertations & Theses Global | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3235005503/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3235005503/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |