scientific article; zbMATH DE number 6783379

zbMath1377.90027MaRDI QIDQ5365024

Benjamin Moseley, Sungjin Im

Publication date: 29 September 2017

Full work available at URL: http://dl.acm.org/citation.cfm?id=2133044

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)

Related Items (8)

An Optimal Control Framework for Online Job Scheduling with General Cost Functions ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Fair Scheduling via Iterative Quasi-Uniform Sampling ⋮ Scheduling parallel jobs online with convex and concave parallelizability ⋮ Minimizing maximum (weighted) flow-time on related and unrelated machines ⋮ Online Non-preemptive Scheduling to Optimize Max Stretch on a Single Machine ⋮ Non-clairvoyantly scheduling to minimize convex functions ⋮ Unnamed Item

This page was built for publication: