Breaking \(1-1/e\) barrier for non-preemptive throughput maximization

DOI10.1007/978-3-319-59250-3_24zbMath1416.90006OpenAlexW2617601670MaRDI QIDQ2401168

Benjamin Moseley, Shi Li, Sungjin Im

Publication date: 31 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-59250-3_24

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items

Online Throughput Maximization on Unrelated Machines: Commitment is No Burden, Unnamed Item, Throughput scheduling with equal additive laxity, Throughput scheduling with equal additive laxity