BREAKING 1-1/e BARRIER FOR NONPREEMPTIVE THROUGHPUT MAXIMIZATION

Im, S; Li, S; Moseley, B

Im, S (corresponding author), Univ Calif, Elect Engn & Comp Sci, Merced, CA 95343 USA.

SIAM JOURNAL ON DISCRETE MATHEMATICS, 2020; 34 (3): 1649

Abstract

In this paper we consider one of the most basic scheduling problems where jobs have their respective arrival times and deadlines. The goal is to sched......

Full Text Link