The Robotics Institute
Search the site
RI | Publications | Resource Contention Metrics for Oversubscribed Scheduling Problems

Text only version of this site

Resource Contention Metrics for Oversubscribed Scheduling Problems
L. Kramer and S. Smith
Proceedings 16th International Conference on Automated Planning and Scheduling (ICAPS-06), June, 2006.

Jump to: Download | Abstract | Notes | Text Reference | BibTeX Reference

Download [Help]

Adobe portable document format (pdf) [127 KB]

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

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.

Notes

Associated center: CIMDS
Associated lab/group: Intelligent Coordination and Logistics Laboratory
Associated project: AMC Barrelmaster Scheduling

Number of pages: 4

Text Reference

L. Kramer and S. 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.
For updates and comments, please see these instructions.
This page maintained by robotwebmaster@ri.cmu.edu