Abstract
Order acceptance and scheduling is an interesting and challenging scheduling problem in which two decisions need to be handled simultaneously. While the exact methods are not efficient and sometimes impractical, existing meta-heuristics proposed in the literature still have troubles dealing with large problem instances. In this paper, a dispatching rule based genetic algorithm is proposed to combine the advantages of existing dispatching rules/heuristics, genetic algorithm and local search. The results indicates that the proposed methods are effective and efficient when compared to a number of existing heuristics with a wide range of problem instances.
| Original language | English |
|---|---|
| Title of host publication | GECCO'15 |
| Subtitle of host publication | Proceedings of the 2015 Genetic and Evolutionary Computation Conference |
| Publisher | Association for Computing Machinery |
| Pages | 433-440 |
| ISBN (Print) | 9781450334723 |
| DOIs | |
| Publication status | Published - Jul 2015 |
| Externally published | Yes |
| Event | 17th Genetic and Evolutionary Computation Conference (GECCO 2015) - Madrid, Spain Duration: 11 Jul 2015 → 15 Jul 2015 |
Conference
| Conference | 17th Genetic and Evolutionary Computation Conference (GECCO 2015) |
|---|---|
| Place | Spain |
| City | Madrid |
| Period | 11/07/15 → 15/07/15 |
Research Keywords
- Genetic algorithm
- Local search
- Scheduling
Fingerprint
Dive into the research topics of 'A Dispatching rule based Genetic Algorithm for Order Acceptance and Scheduling'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver