Preemptive scheduling of equal-length jobs to maximize weighted throughput. (Q1426730): Difference between revisions

@@ Property / OpenAlex ID @@
+W2015429079
@@ Property / OpenAlex ID: W2015429079 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+cs/0209033
@@ Property / arXiv ID: cs/0209033 / rank @@
+Normal rank
@@ Property / cites work @@
+An O\((n^4)\) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
+Normal rank
@@ Property / cites work @@
+Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time
+Normal rank
@@ Property / cites work @@
+Q4016820
@@ Property / cites work: Q4016820 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+$\text{D}^{\textit{over}}$: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
+Normal rank
@@ Property / cites work @@
+A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
+Normal rank
@@ Property / cites work @@
+Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the `Tower of Sets' property
+Normal rank