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

@@ Property / DOI @@
-.1111/j.1475-3995.2007.00605.x
@@ Property / DOI: 10.1111/j.1475-3995.2007.00605.x / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1111/j.1475-3995.2007.00605.x
+Normal rank
@@ Property / OpenAlex ID @@
+W2105222081
@@ Property / OpenAlex ID: W2105222081 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1111/J.1475-3995.2007.00605.X
@@ Property / DOI: 10.1111/J.1475-3995.2007.00605.X / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3502134