A comment on scheduling two parallel machines with capacity constraints (Q2581321): Difference between revisions

@@ Property / author @@
-Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
-Normal rank
@@ Property / author @@
+Gerhard J. Woeginger
@@ Property / author: Gerhard J. Woeginger / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.disopt.2005.06.005
+Normal rank
@@ Property / OpenAlex ID @@
+W2014770281
@@ Property / OpenAlex ID: W2014770281 / rank @@
+Normal rank
@@ Property / cites work @@
+Pipage rounding: a new method of constructing algorithms with proven performance guarantee
+Normal rank
@@ Property / cites work @@
+When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
+Normal rank
@@ Property / cites work @@
+An approximation algorithm for scheduling two parallel machines with capacity constraints.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2581321