Scheduling a single machine with parallel batching to minimize makespan and total rejection cost (Q266826): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C39
@@ Property / Mathematics Subject Classification ID: 90C39 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6566292
@@ Property / zbMATH DE Number: 6566292 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+batching machine scheduling
@@ Property / zbMATH Keywords: batching machine scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+rejection
@@ Property / zbMATH Keywords: rejection / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+makespan
@@ Property / zbMATH Keywords: makespan / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic programming
@@ Property / zbMATH Keywords: dynamic programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+FPTAS
@@ Property / zbMATH Keywords: FPTAS / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank

Revision as of 14:39, 27 June 2023