Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
From MaRDI portal
Publication:4606335
DOI10.4230/LIPICS.ESA.2016.63zbMATH Open1397.68233OpenAlexW2521105525MaRDI QIDQ4606335FDOQ4606335
Abhinav Srivastav, Nguyen Kim Thang, Denis Trystram, G. Lucarelli
Publication date: 2 March 2018
Full work available at URL: https://hal.univ-grenoble-alpes.fr/hal-01334219
Recommendations
- Lagrangian duality in online scheduling with resource augmentation and speed scaling
- Online scheduling on multiple resources under stochastic conditions
- Optimal non-preemptive semi-online scheduling on two related machines
- scientific article; zbMATH DE number 1929942
- Online non-preemptive scheduling to optimize max stretch on a single machine
- Optimal preemptive semi-online scheduling on two uniform processors
- An optimal algorithm for preemptive on-line scheduling
- Nonmigratory Online Deadline Scheduling on Multiprocessors
- Optimal preemptive online scheduling to minimize \(l_p\) norm on two processors
- Semi-online preemptive scheduling: study of special cases
Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)
Cited In (12)
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Simple paths with exact and forbidden lengths
- Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines
- Non-Preemptive Flow-Time Minimization via Rejections
- Game efficiency through linear programming duality
- A best possible online algorithm for minimizing the total completion time and the total soft penalty cost
- Approximating \(k\)-forest with resource augmentation: a primal-dual approach
- Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence
- Dual representation and its online scheduling method for event-varying DESs with capacity constraints
- An Optimal Control Framework for Online Job Scheduling with General Cost Functions
- An on-line \textit{seru} scheduling algorithm with proactive waiting considering resource conflicts
- Minimizing the maximum flow time in the online food delivery problem
This page was built for publication: Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606335)
