Using Queueing Analysis to Guide Combinatorial Scheduling in Dynamic Environments
The central thesis of this dissertation is that insight from queueing analysis can effectively guide standard (combinatorial) scheduling algorithms in dynamic environments. Scheduling is generally concerned with complex combinatorial decisions for static problems, whereas queueing theory simplifies...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_ca |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1807/31609 |