An efficient new heuristic for the hoist scheduling problem (Q342278): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B35
@@ Property / Mathematics Subject Classification ID: 90B35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C11
@@ Property / Mathematics Subject Classification ID: 90C11 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C59
@@ Property / Mathematics Subject Classification ID: 90C59 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6654131
@@ Property / zbMATH DE Number: 6654131 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+transportation resources
@@ Property / zbMATH Keywords: transportation resources / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+dynamic scheduling
@@ Property / zbMATH Keywords: dynamic scheduling / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+mixed integer linear programming (MILP)
@@ Property / zbMATH Keywords: mixed integer linear programming (MILP) / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+heuristic
@@ Property / zbMATH Keywords: heuristic / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+bounded processing times
@@ Property / zbMATH Keywords: bounded processing times / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+initial products sequence
@@ Property / zbMATH Keywords: initial products sequence / rank @@
+Normal rank

Revision as of 07:27, 28 June 2023