DMCA
Trading places: How to schedule more in a multi-resource oversubscribed scheduling problem (2004)
Cached
Download Links
- [www-rcf.usc.edu]
- [www-bcf.usc.edu]
- [www-bcf.usc.edu]
- [www.aaai.org]
- [www.cs.colostate.edu]
- [www.cs.colostate.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Proceedings of the International Conference on Planning and Scheduling |
| Citations: | 7 - 4 self |
BibTeX
@INPROCEEDINGS{Barbulescu04tradingplaces:,
author = {Laura Barbulescu and Adele E. Howe and L. Darrell Whitley and Mark Roberts},
title = {Trading places: How to schedule more in a multi-resource oversubscribed scheduling problem},
booktitle = {In Proceedings of the International Conference on Planning and Scheduling},
year = {2004},
pages = {227--234}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Oversubscribed scheduling problems require removing tasks when enough resources are not available. Prior AI approaches have mostly been constructive or repairbased heuristic search. In contrast, we have found a genetic algorithm (GA) to be the best approach to the overconstrained problem of Air Force Satellite Control Network scheduling. We present empirical results that elucidate sources of difficulty in the application and partially explain why the GA is well suited to this problem. We show that the task interaction compels changes involving many tasks simultaneously and the GA appears to be learning domain specific patterns in the data.
