An analysis of the non-preemptive mixed-criticality match-up scheduling problem (Q341470): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6653506
@@ Property / zbMATH DE Number: 6653506 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+uncertain processing times
@@ Property / zbMATH Keywords: uncertain processing times / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+scheduling
@@ Property / zbMATH Keywords: scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+complexity
@@ Property / zbMATH Keywords: complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+robustness
@@ Property / zbMATH Keywords: robustness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed-criticality
@@ Property / zbMATH Keywords: mixed-criticality / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+ILP
@@ Property / zbMATH Keywords: ILP / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+match-up
@@ Property / zbMATH Keywords: match-up / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+packing
@@ Property / zbMATH Keywords: packing / rank @@
+Normal rank

Revision as of 06:17, 28 June 2023