Sammanfattning
A genetic algorithm is used to calculate production schedules for a specific type of batch-mode manufacturing process. Previous scheduling efforts included both time discretised MILP as well as continuous-time MILP, both of which were outperformed by the GA when measured in calculation times and final schedule accuracy. The approach is two-folded and an algorithm to reproduce it on similar processes is presented.
Originalspråk | Engelska |
---|---|
Titel på värdpublikation | The 2003 Congress on Evolutionary Computation, 2003. CEC '03 |
Förlag | IEEE |
Sidor | 966-970 |
Antal sidor | 5 |
ISBN (tryckt) | 0-7803-7804-0 |
DOI | |
Status | Publicerad - 2003 |
MoE-publikationstyp | A4 Artikel i en konferenspublikation |
Evenemang | 2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australien Varaktighet: 8 dec. 2003 → 12 dec. 2003 |
Konferens
Konferens | 2003 Congress on Evolutionary Computation, CEC 2003 |
---|---|
Land/Territorium | Australien |
Ort | Canberra, ACT |
Period | 08/12/03 → 12/12/03 |