The prize-collecting scheduling problem with deadlines (Q510929): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C05
@@ Property / Mathematics Subject Classification ID: 90C05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 90C10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C27
@@ Property / Mathematics Subject Classification ID: 90C27 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6684439
@@ Property / zbMATH DE Number: 6684439 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+single machine scheduling
@@ Property / zbMATH Keywords: single machine scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+total tardiness
@@ Property / zbMATH Keywords: total tardiness / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+integer linear programming
@@ Property / zbMATH Keywords: integer linear programming / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+hard deadlines
@@ Property / zbMATH Keywords: hard deadlines / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch and bound
@@ Property / zbMATH Keywords: branch and bound / rank @@
+Normal rank

Revision as of 02:47, 1 July 2023