scientific article; zbMATH DE number 7053351
From MaRDI portal
Publication:5743474
zbMath1423.68610MaRDI QIDQ5743474
Benjamin Moseley, Sungjin Im, Kirk R. Pruhs
Publication date: 10 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=2095215
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (2)
An improved algorithm for online machine minimization ⋮ Non-clairvoyantly scheduling to minimize convex functions
Cites Work
- Unnamed Item
- Unnamed Item
- Online weighted flow time and deadline scheduling
- Preemptive scheduling in overloaded systems.
- Approximation algorithms for average stretch scheduling
- Scalably scheduling processes with arbitrary speedup curves
- A unified approach to scheduling on unrelated parallel machines
- Better Scalable Algorithms for Broadcast Scheduling
- Speed is as powerful as clairvoyance
- All-norm approximation algorithms
- A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation
- Poisson Disorder Problem with Exponential Penalty for Delay
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of Service
- Online Scheduling with General Cost Functions
This page was built for publication:
