Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597): Difference between revisions

@@ Property / cites work @@
+Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
+Normal rank
@@ Property / cites work @@
+Open Shop Scheduling to Minimize Finish Time
@@ Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3137912
@@ Property / cites work: Q3137912 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3964013
@@ Property / cites work: Q3964013 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Knapsack Problems with Bounded Weights
+Normal rank