Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
From MaRDI portal
Publication:4606335
DOI10.4230/LIPIcs.ESA.2016.63zbMath1397.68233OpenAlexW2521105525MaRDI QIDQ4606335
Abhinav Srivastav, Nguyen Kim Thang, Giorgio Lucarelli, Denis Trystram
Publication date: 2 March 2018
Full work available at URL: https://hal.univ-grenoble-alpes.fr/hal-01334219
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (9)
An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Simple paths with exact and forbidden lengths ⋮ Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence ⋮ Minimizing the maximum flow time in the online food delivery problem ⋮ A best possible online algorithm for minimizing the total completion time and the total soft penalty cost ⋮ Non-Preemptive Flow-Time Minimization via Rejections ⋮ Online Non-Preemptive Scheduling to Minimize Weighted Flow-time on Unrelated Machines ⋮ Approximating \(k\)-forest with resource augmentation: a primal-dual approach ⋮ Game efficiency through linear programming duality
This page was built for publication: Online Non-preemptive Scheduling in a Resource Augmentation Model based on Duality
