Tight bounds for the identical parallel machine‐scheduling problem: Part II (Q3502134): Difference between revisions

@@ Property / cites work @@
+Optimal Scheduling of Tasks on Identical Parallel Processors
+Normal rank
@@ Property / cites work @@
+A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
+Normal rank
@@ Property / cites work @@
+A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems
+Normal rank
@@ Property / cites work @@
+Tight bounds for the identical parallel machine scheduling problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the identical parallel machine scheduling problem.
+Normal rank
@@ Property / cites work @@
+Improving Discrete Model Representations via Symmetry Considerations
+Normal rank