scientific article; zbMATH DE number 6783381
From MaRDI portal
Publication:5365026
zbMath1387.90085arXiv1011.2187MaRDI QIDQ5365026
Publication date: 29 September 2017
Full work available at URL: https://arxiv.org/abs/1011.2187
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 (4)
Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Unnamed Item
This page was built for publication:
