On preemption redundancy in scheduling unit processing time jobs on two parallel machines (Q5945391): Difference between revisions

@@ Property / cites work @@
+Q4396949
@@ Property / cites work: Q4396949 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4247460
@@ Property / cites work: Q4247460 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4658190
@@ Property / cites work: Q4658190 / rank @@
+Normal rank
@@ Property / cites work @@
+Scheduling chain-structured tasks to minimize makespan and mean flow time
+Normal rank
@@ Property / cites work @@
+Scheduling with Deadlines and Loss Functions
@@ Property / cites work: Scheduling with Deadlines and Loss Functions / rank @@
+Normal rank
@@ Property / cites work @@
+Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity
+Normal rank
@@ Property / cites work @@
+Is a unit-job shop not easier than identical parallel machines?
+Normal rank