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

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6066758
@@ Property / zbMATH DE Number: 6066758 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorial optimization
@@ Property / zbMATH Keywords: combinatorial optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation
@@ Property / zbMATH Keywords: approximation / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+robust optimization
@@ Property / zbMATH Keywords: robust optimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+flow shop
@@ Property / zbMATH Keywords: flow shop / rank @@
+Normal rank

Revision as of 01:42, 30 June 2023