Fast approximation algorithms for job scheduling with processing set restrictions (Q410716): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+M20
@@ Property / Mathematics Subject Classification ID: 68M20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6021253
@@ Property / zbMATH DE Number: 6021253 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+tree-hierarchical processing set
@@ Property / zbMATH Keywords: tree-hierarchical processing set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+inclusive processing set
@@ Property / zbMATH Keywords: inclusive processing set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nested processing set
@@ Property / zbMATH Keywords: nested processing set / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+makespan minimization
@@ Property / zbMATH Keywords: makespan minimization / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial-time approximation algorithm
@@ Property / zbMATH Keywords: polynomial-time approximation algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+NP-hard
@@ Property / zbMATH Keywords: NP-hard / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+nonpreemptive scheduling
@@ Property / zbMATH Keywords: nonpreemptive scheduling / rank @@
+Normal rank

Revision as of 19:29, 29 June 2023