On-line scheduling on a single machine: Maximizing the number of early jobs (Q5929136): Difference between revisions

@@ 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 @@
+Q2768123
@@ Property / cites work: Q2768123 / rank @@
+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 @@
+Q4055377
@@ Property / cites work: Q4055377 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Parallel Machines On-Line
@@ Property / cites work: Scheduling Parallel Machines On-Line / rank @@
+Normal rank
@@ Property / cites work @@
+Q2753958
@@ Property / cites work: Q2753958 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368485
@@ Property / cites work: Q4368485 / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q127124827
@@ Property / Wikidata QID: Q127124827 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0167-6377(00)00061-4
+Normal rank
@@ Property / OpenAlex ID @@
+W1980008867
@@ Property / OpenAlex ID: W1980008867 / rank @@
+Normal rank