Optimal on-line flow time with resource augmentation
From MaRDI portal
Publication:2489955
DOI10.1016/J.DAM.2005.05.016zbMATH Open1125.90016OpenAlexW2099303310MaRDI QIDQ2489955FDOQ2489955
Authors: Leah Epstein, Rob van Stee 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.05.016
Recommendations
Cites Work
- Title not available (Why is that?)
- Optimal on-line algorithms for single-machine scheduling
- Scheduling data transfers in a network and the set scheduling problem
- Title not available (Why is that?)
- Optimal time-critical scheduling via resource augmentation
- Minimizing the flow time without migration
- Title not available (Why is that?)
Cited In (15)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- Optimal Online Algorithms for Minimax Resource Scheduling
- From preemptive to non-preemptive scheduling using rejections
- Title not available (Why is that?)
- Extra Unit-Speed Machines Are Almost as Powerful as Speedy Machines for Flow Time Scheduling
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Multi-processor scheduling to minimize flow time with \(\epsilon\) resource augmentation
- Optimal time-critical scheduling via resource augmentation
- Optimal on-line algorithms to minimize makespan on two machines with resource augmentation
- Speed is as powerful as clairvoyance
- Approximation and Online Algorithms
- Minimizing the maximum flow time in the online food delivery problem
This page was built for publication: Optimal on-line flow time with resource augmentation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489955)
