Approximating a two-machine flow shop scheduling under discrete scenario uncertainty (Q439320): Difference between revisions

@@ Property / cites work @@
+Optimal two- and three-stage production schedules with setup times included
+Normal rank
@@ Property / cites work @@
+The Complexity of Flowshop and Jobshop Scheduling
@@ Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Robustness in operational research and decision aiding: a multi-faceted issue
+Normal rank
@@ Property / cites work @@
+Q3252269
@@ Property / cites work: Q3252269 / rank @@
+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 @@
+On the robust shortest path problem.
@@ Property / cites work: On the robust shortest path problem. / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Interval data minmax regret network optimization problems
+Normal rank
@@ Property / cites work @@
+On the approximability of minmax (regret) network optimization problems
+Normal rank
@@ Property / cites work @@
+On the approximability of robust spanning tree problems
+Normal rank
@@ Property / cites work @@
+Min-max and min-max regret versions of combinatorial optimization problems: A survey
+Normal rank
@@ Property / cites work @@
+The minmax regret permutation flow-shop problem with two jobs
+Normal rank
@@ Property / cites work @@
+Complexity of single machine scheduling problems under scenario-based uncertainty
+Normal rank
@@ Property / cites work @@
+Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
+Normal rank
@@ Property / cites work @@
+Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
+Normal rank
@@ Property / cites work @@
+Complexity of minimizing the total flow time with interval data and minmax regret criterion
+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
@@ Property / cites work @@
+Approximating Single Machine Scheduling with Scenarios
+Normal rank
@@ Property / cites work @@
+On the robust single machine scheduling problem
@@ Property / cites work: On the robust single machine scheduling problem / rank @@
+Normal rank
@@ Property / cites work @@
+General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
+Normal rank
@@ Property / cites work @@
+Q3425131
@@ Property / cites work: Q3425131 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
+Normal rank
@@ Property / cites work @@
+Analysis of a linear programming heuristic for scheduling unrelated parallel machines
+Normal rank
@@ Property / cites work @@
+Approximability of flow shop scheduling
@@ Property / cites work: Approximability of flow shop scheduling / rank @@
+Normal rank
@@ Property / cites work @@
+Makespan minimization in open shops: A polynomial time approximation scheme
+Normal rank
@@ Property / cites work @@
+Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
+Normal rank