On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688): Difference between revisions

@@ Property / cites work @@
+An efficient algorithm for the job-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+Q4542585
@@ Property / cites work: Q4542585 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4448359
@@ Property / cites work: Q4448359 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5755525
@@ Property / cites work: Q5755525 / rank @@
+Normal rank
@@ Property / cites work @@
+Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
+Normal rank
@@ Property / cites work @@
+Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
+Normal rank
@@ Property / cites work @@
+Computational Complexity of Discrete Optimization Problems
+Normal rank