Carnegie Mellon Robotics Institute
Laurence Kramer and Stephen Smith
Proceedings 16th International Conference on Automated Planning and Scheduling (ICAPS-06), June, 2006.
| Download |
|
| Abstract |
| We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals expected to have the best worst case resource availability. Prior research in value and variable ordering heuristics for scheduling problems indicated that sophisticated, but more costly measures of resource contention can outperform simpler ones by more reliably pruning the search space. We demonstrate that for oversubscribed, priority-based problems where a feasible, optimal solution may not even exist, max-availability generates schedules of similar quality to other contention based heuristics with much less computational overhead. |
| Keywords |
| scheduling, heuristics |
| Notes |
Associated Center(s) / Consortia:
Center for Integrated Manfacturing Decision Systems Associated Lab(s) / Group(s):
Intelligent Coordination and Logistics Laboratory Associated Project(s):
AMC Barrelmaster Scheduling Number of pages: 4 |
| Text Reference |
| Laurence Kramer and Stephen Smith , "Resource Contention Metrics for Oversubscribed Scheduling Problems," Proceedings 16th International Conference on Automated Planning and Scheduling (ICAPS-06), June, 2006. |
| BibTeX Reference |
|
@inproceedings{Kramer_2006_5477, author = "Laurence Kramer and Stephen {Smith }", title = "Resource Contention Metrics for Oversubscribed Scheduling Problems", booktitle = "Proceedings 16th International Conference on Automated Planning and Scheduling (ICAPS-06)", month = "June", year = "2006", } |
| The Robotics Institute is part of the School of Computer Science, Carnegie Mellon University. Contact Us | Update Instructions |