A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion (Q943795): Difference between revisions

@@ Property / cites work @@
+Q4396949
@@ Property / cites work: Q4396949 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for interval data minmax regret combinatorial optimization problems
+Normal rank
@@ Property / cites work @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Complexity of minimizing the total flow time with interval data and minmax regret criterion
+Normal rank
@@ Property / cites work @@
+Complexity of Scheduling under Precedence Constraints
+Normal rank
@@ Property / cites work @@
+A mixed integer programming formulation for the total flow time single machine robust scheduling problem with interval data
+Normal rank