Heuristic approaches for \(n/m/F/\sum C_i\) scheduling problems (Q1278545): Difference between revisions

@@ Property / cites work @@
+Openshop and flowshop scheduling to minimize sum of completion times
+Normal rank
@@ Property / cites work @@
+Flowshop/no-idle or no-wait scheduling to minimize the sum of completion times
+Normal rank
@@ Property / cites work @@
+Q3211098
@@ Property / cites work: Q3211098 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4279265
@@ Property / cites work: Q4279265 / rank @@
+Normal rank
@@ Property / cites work @@
+Ordered Flow Shop Problems with no In-Process Waiting: Further Results
+Normal rank