The minmax regret permutation flow-shop problem with two jobs (Q2572850): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ejor.2004.07.073
+Normal rank
@@ Property / OpenAlex ID @@
+W1974652680
@@ Property / OpenAlex ID: W1974652680 / rank @@
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+On the complexity of a class of combinatorial optimization problems with uncertainty
+Normal rank
@@ Property / cites work @@
+Q2734595
@@ Property / cites work: Q2734595 / rank @@
+Normal rank
@@ Property / cites work @@
+Robust Scheduling to Hedge Against Processing Time Uncertainty in Single-Stage Production
+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 @@
+Complexity of minimizing the total flow time with interval data and minmax regret criterion
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2572850