Simple algorithms for multiprocessor scheduling to meet deadlines (Q1248336): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0020-0190(77)90015-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2030829902
@@ Property / OpenAlex ID: W2030829902 / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing with due-dates and early start times to minimize maximum tardiness
+Normal rank
@@ Property / cites work @@
+Q4131656
@@ Property / cites work: Q4131656 / rank @@
+Normal rank
@@ Property / cites work @@
+On a Real-Time Scheduling Problem
@@ Property / cites work: On a Real-Time Scheduling Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling Tasks with Nonuniform Deadlines on Two Processors
+Normal rank
@@ Property / cites work @@
+Minimizing maximum lateness on one machine: computational experience and some applications
+Normal rank
@@ Property / cites work @@
+Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
+Normal rank