Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion (Q2488241): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2004.07.004
+Normal rank
@@ Property / OpenAlex ID @@
+W2074424584
@@ Property / OpenAlex ID: W2074424584 / rank @@
+Normal rank
@@ Property / cites work @@
+Minmax regret solutions for minimax optimization problems with uncertainty
+Normal rank
@@ 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 @@
+Robust discrete optimization and its applications
@@ Property / cites work: Robust discrete optimization and its applications / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Sequencing of a Single Machine Subject to Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Q2743982
@@ Property / cites work: Q2743982 / rank @@
+Normal rank