Scheduling parallelizable jobs online to maximize throughput
From MaRDI portal
Publication:2294735
DOI10.1007/978-3-319-77404-6_55zbMath1504.90054OpenAlexW2793328768MaRDI QIDQ2294735
Benjamin Moseley, Kefu Lu, Kunal Agrawal, Jing Li
Publication date: 12 February 2020
Full work available at URL: https://doi.org/10.1007/978-3-319-77404-6_55
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (6)
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden ⋮ Optimally Handling Commitment Issues in Online Throughput Maximization ⋮ Maximizing Throughput in Flow Shop Real-Time Scheduling ⋮ A general framework for handling commitment in online throughput maximization ⋮ Open problems in queueing theory inspired by datacenter computing ⋮ Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
This page was built for publication: Scheduling parallelizable jobs online to maximize throughput
