Amortized efficiency of list update and paging rules
Communications of the ACM
Trade-offs between speed and processor in hard-deadline scheduling
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Speed is as powerful as clairvoyance
Journal of the ACM (JACM)
On-Line Load Balancing in a Hierarchical Server Topology
SIAM Journal on Computing
Non-clairvoyant Scheduling for Minimizing Mean Slowdown
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Maximizing Job Completions Online
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Speed is more powerful than clairvoyance
Nordic Journal of Computing
On-line algorithms for the channel assignment problem in cellular networks
Discrete Applied Mathematics
Optimal On-Line Algorithms to Minimize Makespan on Two Machines with Resource Augmentation
Theory of Computing Systems
Preemptive scheduling on a small number of hierarchical machines
Information and Computation
Online parallel machines scheduling with two hierarchies
Theoretical Computer Science
Online and semi-online scheduling of two machines under a grade of service provision
Operations Research Letters
| Hi-index | 0.00 |
This paper investigates an online hierarchical scheduling problem with resource augmentation, i.e., the resources of the online algorithms are different from those of the offline algorithms. The machines are provided with different capacity according to their hierarchies. One with the hierarchy 1 has a speed of s (q) in the online (offline) algorithms and can process all the jobs. The other with hierarchy 2 has a speed of 1 in the online/offline algorithms and can only process partial jobs. The objective is to minimize makespan. For any 0 q,s