scientific article; zbMATH DE number 6783380
From MaRDI portal
Publication:5365025
zbMath1377.90026MaRDI QIDQ5365025
Benjamin Moseley, Sungjin Im, Jeff Edmonds
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133045
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (8)
The efficiency-fairness balance of round robin scheduling ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Scheduling to minimize energy and flow time in broadcast scheduling ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models ⋮ Unnamed Item
This page was built for publication:
