Optimal online flow time with resource augmentation
From MaRDI portal
Recommendations
- Optimal on-line flow time with resource augmentation
- Optimal Online Algorithms for Minimax Resource Scheduling
- Optimal Resource Augmentations for Online Knapsack
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- Near optimal online algorithms and fast approximation algorithms for resource allocation problems
- Optimal online algorithms on two hierarchical machines with resource augmentation
- Optimal online algorithms on two hierarchical machines with resource augmentation
- On-line scheduling to minimize Max flow time: an optimal preemptive algorithm
- Optimal time-critical scheduling via resource augmentation
- Online flow time scheduling in the presence of preemption overhead
Cited in
(9)- SPT is optimally competitive for uniprocessor flow
- Optimal on-line flow time with resource augmentation
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Optimal Resource Augmentations for Online Knapsack
- scientific article; zbMATH DE number 1559529 (Why is no real title available?)
- Optimal time-critical scheduling via resource augmentation
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
This page was built for publication: Optimal online flow time with resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4782742)
