Preemptive scheduling of equal-length jobs to maximize weighted throughput

$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems

G. Koren, Dennis Shasha · SIAM Journal on Computing · 1995 · 189 citations

Computing, Computer Engineering, Computer Science +17

A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Eugene L. Lawler · Annals of Operations Research · 1990 · 136 citations

Management, Computer Engineering, Computer Science +12

Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times

Philippe Baptiste · Journal of Scheduling · 1999 · 111 citations

Computing, Computer Science, Algorithms +8

An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Philippe Baptiste · Operations Research Letters · 1999 · 66 citations

Computing, Computer Science, Computer Systems +11

Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘tower of sets’ property

Eugene L. Lawler · Mathematical and Computer Modelling · 1994 · 56 citations

Natural Sciences, Computer Science, Mathematics +13