Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | The 2003 Congress on Evolutionary Computation, 2003. CEC '03 |
| Publisher | IEEE |
| Pages | 966-970 |
| Number of pages | 5 |
| ISBN (Print) | 0-7803-7804-0 |
| DOIs | |
| Publication status | Published - 2003 |
| MoE publication type | A4 Article in a conference publication |
| Event | 2003 Congress on Evolutionary Computation, CEC 2003 - Canberra, ACT, Australia Duration: 8 Dec 2003 → 12 Dec 2003 |
Conference
| Conference | 2003 Congress on Evolutionary Computation, CEC 2003 |
|---|---|
| Country/Territory | Australia |
| City | Canberra, ACT |
| Period | 08/12/03 → 12/12/03 |
Fingerprint
Dive into the research topics of 'Scheduling a specific type of batch process with evolutionary computation'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver