NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026): Difference between revisions

@@ Property / cites work @@
+Q4208001
@@ Property / cites work: Q4208001 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4940090
@@ Property / cites work: Q4940090 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4393386
@@ Property / cites work: Q4393386 / rank @@
+Normal rank
@@ Property / cites work @@
+Compact Scheduling In Open Shop With Zero-One Time Operations
+Normal rank
@@ Property / cites work @@
+A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
+Normal rank
@@ Property / cites work @@
+Q2713634
@@ Property / cites work: Q2713634 / rank @@
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling Shops with No Wait in Process
+Normal rank
@@ Property / cites work @@
+Q4033261
@@ Property / cites work: Q4033261 / rank @@
+Normal rank