Combinatorial algorithms for scheduling jobs to minimize server usage time
This thesis is concerned with three combinatorial optimization problems for job scheduling, named the MinUsageTime Dynamic Bin Packing problem, the Energy-Efficient Job Scheduling problem and the Flexible Job Scheduling problem. These problems are motivated by emerging issues arising from cloud c...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2018
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/88251 http://hdl.handle.net/10220/46906 |